Method, Apparatus and System for Graph Data Caching
AssigneeSiemens Aktiengesellschaft
InventorWen Ke Wang
Life of this patent
Estimating the term…
Abstract
Various embodiments of the teachings herein include a method for graph data caching. An example method includes: receiving a first semantic query on graph data; extracting, from the first semantic query, each first value of at least one semantic element; matching the first semantic query with at least one second semantic query stored in the cache based on each first value of the at least one semantic element; if the first semantic query has a match, achieving graph data linked with the at least one matched second semantic query from the cache, otherwise, achieving graph data from a database; and storing, in the cache, the first semantic query and the achieved graph data, wherein the first semantic query is linked with the achieved graph data.
Claims19
A method for graph data caching, the method comprising:
- receiving a first semantic query on graph data;
- extracting, from the first semantic query, each first value of at least one semantic element;
- matching the first semantic query with at least one second semantic query stored in the cache based on each first value of the at least one semantic element;
- if the first semantic query has a match, achieving graph data linked with the at least one matched second semantic query from the cache, otherwise, achieving graph data from a database;
- storing, in the cache, the first semantic query and the achieved graph data, wherein the first semantic query is linked with the achieved graph data.
An apparatus for graph data caching, the apparatus comprising:
- a receiving unit to receive a first semantic query on graph data;
- a semantic parser to extract from the first semantic query each first value of at least one semantic element;
- a query analyzer to match the first semantic query with at least one second semantic query stored in the cache based on each first value of the at least one semantic element;
- a query executor to, if matches achieve graph data linked with at least one matched second semantic query from the cache, otherwise, achieve graph data from a database;
- and
- a cache manager to store in the cache the first semantic query and the achieved graph data, wherein the first semantic query is linked with the achieved graph data.
An apparatus for graph data caching, the apparatus comprising:
- at least one processor;
- at least one memory coupled to the at least one processor (101), the at least one memory storing computer-executable instructions, wherein the computer-executable instructions when executed cause the at least one processor to:
- receive a first semantic query on graph data;
- extract, from the first semantic query, each first value of at least one semantic element;
- match the first semantic query with at least one second semantic query stored in the cache based on each first value of the at least one semantic element;
- if the first semantic query has a match, achieve graph data linked with the at least one matched second semantic query from the cache, otherwise, achieve graph data from a database;
- store, in the cache, the first semantic query and the achieved graph data, wherein the first sematic query is linked with the achieved graph data.
18-19. (canceled)
A system for graph data caching, comprising:
- a cache;
- a database;
- and
- an apparatus for graph data caching, the apparatus comprising:
- a receiving unit to receive a first semantic query on graph data;
- a semantic parser to extract from the first semantic query each first value of at least one semantic element;
- a query analyzer to match the first semantic query with at least one second semantic query stored in the cache based on each first value of the at least one semantic element;
- a query executor to, if matches achieve graph data linked with at least one matched second semantic query from the cache, otherwise, achieve graph data from a database;
- and
- a cache manager to store in the cache the first semantic query and the achieved graph data, wherein the first semantic query is linked with the achieved graph data.
Dependencies are inferred from the claim text.