首页> 外国专利> 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.
机译:一种用于有效地回答图数据的本地邻域聚合查询的方法和系统。具有多个节点的图被接收并存储在存储器中。收到本地邻居聚合查询。处理引擎应用基于差分索引的修剪的正向处理,使用部分分布的反向处理或结合了反向处理和正向处理的增强型反向处理。作为前向,后向或增强的后向处理的结果,确定了图中节点的h跳内邻居中具有前k个最高聚合值的节点。与确定的节点相关联的实体或个人的身份被呈现和/或存储。

著录项

  • 公开/公告号US8234297B2

    专利类型

  • 公开/公告日2012-07-31

    原文格式PDF

  • 申请/专利权人 BIN HE;

    申请/专利号US20100714729

  • 发明设计人 BIN HE;

    申请日2010-03-01

  • 分类号G06F7/00;

  • 国家 US

  • 入库时间 2022-08-21 17:28:09

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号