首页>
外国专利>
Efficient computation of top-K aggregation over graph and network data
Efficient computation of top-K aggregation over graph and network data
展开▼
机译:对图和网络数据进行top-K聚合的高效计算
展开▼
页面导航
摘要
著录项
相似文献
摘要
A method and system for efficiently answering a local neighborhood aggregation query over graph data. A graph which has a plurality of nodes is received and stored in memory. A local neighborhood aggregation query is received. A processing engine applies forward processing with differential index-based pruning, backward processing using partial distribution, or an enhanced backward processing that combines the backward processing and the forward processing. As a result of the forward, backward, or enhanced backward processing, nodes in the graph that have the top-k highest aggregate values over neighbors within h-hops of the nodes are determined. Identities of entities or persons associated with the determined nodes are presented and/or stored.
展开▼