1-hop sub-query result caches for graph databases
AssigneeseBay Inc., University of Southern California
InventorsHieu Trung NGUYEN, Shahram GHANDEHARIZADEH, Jun LI
Life of this patent
Estimating the term…
Loading patent…
AssigneeseBay Inc., University of Southern California
InventorsHieu Trung NGUYEN, Shahram GHANDEHARIZADEH, Jun LI
Estimating the term…
Some aspects relate to technologies for graph databases with 1-hop sub-query result caching. In accordance with some aspects, cache entries are generated that comprise key-value pairs, each having a cache key based on a vertex identifier of a vertex from a 1-hop sub-query instance and a value based on results of a 1-hop graph traversal from the vertex based on the 1-hop sub-query instance. A cache key can also be based on a property value of a predicate from a 1-hop sub-query instance. During graph query processing, a 1-hop sub-query instance is obtained based on the graph query. A cache key is generated using a vertex identifier for the vertex from the 1-hop sub-query instance. A lookup is performed in the cache data using the cache key, and an output is provided using one or more leaf vertex identifiers from a value of a cache entry having the cache key.
One or more computer storage media storing computer-useable instructions that, when used by one or more computing devices, cause the one or more computing devices to perform operations, the operations comprising:
A computer-implemented method comprising:
A computer system comprising:
Dependencies are inferred from the claim text.