发明授权
- 专利标题: Vertex-proximity query processing
- 专利标题(中): 顶点邻近查询处理
-
申请号: US13315415申请日: 2011-12-09
-
公开(公告)号: US08903824B2公开(公告)日: 2014-12-02
- 发明人: Leman Akoglu , Rohit M. Khandekar , Vibhore Kumar , Srinivasan Parthasarathy , Deepak Rajan , Kun-Lung Wu
- 申请人: Leman Akoglu , Rohit M. Khandekar , Vibhore Kumar , Srinivasan Parthasarathy , Deepak Rajan , Kun-Lung Wu
- 申请人地址: US NY Armonk
- 专利权人: International Business Machines Corporation
- 当前专利权人: International Business Machines Corporation
- 当前专利权人地址: US NY Armonk
- 代理机构: Ryan, Mason & Lewis, LLP
- 主分类号: G06F17/30
- IPC分类号: G06F17/30
摘要:
A method, an apparatus and an article of manufacture for processing a random-walk based vertex-proximity query on a graph. The method includes computing at least one vertex cluster and corresponding meta-information from a graph, dynamically updating the clustering and corresponding meta-information upon modification of the graph, and identifying a vertex cluster relevant to at least one query vertex and aggregating corresponding meta-information of the cluster to process the query.
公开/授权文献
- US20130151536A1 Vertex-Proximity Query Processing 公开/授权日:2013-06-13
信息查询