QLiG: Query Like a Graph For Subgraph Matching
- BATTELLE (PACIFIC NW LAB)
A graph is a natural and flexible modeling approach to represent entities and relationships between them in real-world. A Knowledge Graphs (KG) is a specialized graph with formal and structured representation of facts, relationships, annotated with semantic descriptions. Subgraph matching is one of the fundamental graph problems to identify relationships, interactions and activities of interest within a large graph. A query specification is a collection of abstract components, operations, and constraints to express a pattern. The specification can be implemented in different ways based on underlying data model. Various graph query specifications have been developed over the years and have led to the development of different open-sourced and vendor-specific query languages. Such specification are modeled as an extension of relational algebra used to develop relational query languages such as SQL. Such relational concepts do not inherently support graph queries. There is a need to represent graph queries in terms on graph-based components to expedite query construction by non-database experts. We present a graph-based query approach QLiG (pronounced cleeg), to perform subgraph matching in Labeled Property Graph. We present the query specifications, salient features, and a use case to show functional examples.
- Research Organization:
- Pacific Northwest National Lab. (PNNL), Richland, WA (United States)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- AC05-76RL01830
- OSTI ID:
- 1856345
- Report Number(s):
- PNNL-SA-167142
- Resource Relation:
- Conference: IEEE Artificial Intelligence & Knowledge Engineering (AIKE 2021), December 1-3, 2021, Laguna Hills, CA
- Country of Publication:
- United States
- Language:
- English
Similar Records
Algorithms and architectures for high performance analysis of semantic graphs.
Large-Scale Continuous Subgraph Queries on Streams