Spec-QP: Speculative Query Planning for Joins over Knowledge Graphs
Madhulika Mohanty, Maya Ramanath, Mohamed Yahya, Gerhard Weikum

TL;DR
Spec-QP introduces a speculative query planning method for knowledge graph queries that efficiently identifies relevant relaxations, reducing computation and response times while maintaining result quality.
Contribution
The paper presents a novel speculative query planning framework for knowledge graph query relaxations, improving efficiency by focusing only on relaxations likely to impact top-k results.
Findings
Significantly reduces query processing time.
Maintains high accuracy in top-k results.
Effective on datasets like XKG and Twitter.
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Management and Algorithms · Data Quality and Management · Advanced Database Systems and Queries
