首页>
外国专利>
FAST GRAPH QUERY ENGINE OPTIMIZED FOR TYPICAL REAL-WORLD GRAPH INSTANCES WHOSE SMALL PORTION OF VERTICES HAVE EXTREMELY LARGE DEGREE
FAST GRAPH QUERY ENGINE OPTIMIZED FOR TYPICAL REAL-WORLD GRAPH INSTANCES WHOSE SMALL PORTION OF VERTICES HAVE EXTREMELY LARGE DEGREE
展开▼
机译：对于小部分比例具有极大程度的典型的世界级图实例，对快速图查询引擎进行了优化
展开▼
页面导航
摘要
著录项
相似文献
摘要
Techniques herein accelerate graph querying by caching neighbor vertices (NVs) of super-node vertices. In an embodiment, a computer receives a graph query (GQ) to extract result paths from a graph in a database. The GQ has a sequence of query vertices (QVs) and a sequence of query edges (QEs). The computer successively traverses each QE and QV to detect paths of the graph that match the GQ. Traversing each QE and QV entails retrieving NVs of a current graph vertex (CGV) of a current traversal path. If the CGV is a key in a cache whose keys are graph vertices having an excessive degree, then the computer retrieves NVs from the cache. Otherwise, the computer retrieves NVs from the database. If the degree is excessive, and the CGV is not a key in the cache, then the computer stores, into the cache, the CGV as a key for the NVs.
展开▼
