Spec-QP: Speculative Query Planning for Joins over Knowledge Graphs

by   Madhulika Mohanty, et al.

Organisations store huge amounts of data from multiple heterogeneous sources in the form of Knowledge Graphs (KGs). One of the ways to query these KGs is to use SPARQL queries over a database engine. Since SPARQL follows exact match semantics, the queries may return too few or no results. Recent works have proposed query relaxation where the query engine judiciously replaces a query predicate with similar predicates using weighted relaxation rules mined from the KG. The space of possible relaxations is potentially too large to fully explore and users are typically interested in only top-k results, so such query engines use top-k algorithms for query processing. However, they may still process all the relaxations, many of whose answers do not contribute towards top-k answers. This leads to computation overheads and delayed response times. We propose Spec-QP, a query planning framework that speculatively determines which relaxations will have their results in the top-k answers. Only these relaxations are processed using the top-k operators. We, therefore, reduce the computation overheads and achieve faster response times without adversely affecting the quality of results. We tested Spec-QP over two datasets - XKG and Twitter, to demonstrate the efficiency of our planning framework at reducing runtimes with reasonable accuracy for query engines supporting relaxations.


page 14

page 16

page 17


Semantic Guided and Response Times Bounded Top-k Similarity Search over Knowledge Graphs

Recently, graph query is widely adopted for querying knowledge graphs. G...

Efficient Semantic Summary Graphs for Querying Large Knowledge Graphs

Knowledge Graphs (KGs) integrate heterogeneous data, but one challenge i...

Efficient SPARQL Autocompletion via SPARQL

We show how to achieve fast autocompletion for SPARQL queries on very la...

A Survey of RDF Stores SPARQL Engines for Querying Knowledge Graphs

Recent years have seen the growing adoption of non-relational data model...

Arc-Flags Meet Trip-Based Public Transit Routing

We present Arc-Flag TB, a journey planning algorithm for public transit ...

How and Why is An Answer (Still) Correct? Maintaining Provenance in Dynamic Knowledge Graphs

Knowledge graphs (KGs) have increasingly become the backbone of many cri...

Learning to Speed Up Query Planning in Graph Databases

Querying graph structured data is a fundamental operation that enables i...

Please sign up or login with your details

Forgot password? Click here to reset