Ranked Enumeration of Conjunctive Query Results

02/07/2019
by   Shaleen Deep, et al.
0

We investigate the enumeration of top-k answers for conjunctive queries against relational databases according to a given ranking function. The task is to design data structures and algorithms that allow for efficient enumeration after a preprocessing phase. Our main contribution is a novel priority queue based algorithm with near-optimal delay and non-trivial space guarantees that are output sensitive and depend on structure of the query. In particular, we exploit certain desirable properties of ranking functions that frequently occur in practice and degree information in the database instance, allowing for efficient enumeration. We introduce the notion of decomposable and compatible ranking functions in conjunction with query decomposition, a property that allows for partial aggregation of tuple scores in order to efficiently enumerate the ranked output. We complement the algorithmic results with lower bounds justifying why certain assumptions about properties of ranking functions are necessary and discuss popular conjectures providing evidence for optimality of enumeration delay guarantees. Our results extend and improve upon a long line of work that has studied ranked enumeration from both theoretical and practical perspective.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/15/2020

Ranked enumeration of MSO logic on words

In the last years, enumeration algorithms with bounded delay have attrac...
research
01/15/2021

Towards Approximate Query Enumeration with Sublinear Preprocessing Time

This paper aims at providing extremely efficient algorithms for approxim...
research
11/13/2019

Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries

We study ranked enumeration of the results to a join query in order of d...
research
01/11/2021

Enumeration Algorithms for Conjunctive Queries with Projection

We investigate the enumeration of query results for an important subset ...
research
05/11/2022

Any-k Algorithms for Enumerating Ranked Answers to Conjunctive Queries

We study ranked enumeration for Conjunctive Queries (CQs) where the answ...
research
01/28/2021

Beyond Equi-joins: Ranking, Enumeration and Factorization

We study full acyclic join queries with general join predicates that inv...
research
07/13/2018

QR2: A Third-party Query Reranking Service Over Web Databases

The ranked retrieval model has rapidly become the de-facto way for searc...

Please sign up or login with your details

Forgot password? Click here to reset