Beyond Equi-joins: Ranking, Enumeration and Factorization

by   Nikolaos Tziavelis, et al.

We study full acyclic join queries with general join predicates that involve conjunctions and disjunctions of inequalities, focusing on ranked enumeration where the answers are returned incrementally in an order dictated by a given ranking function. Our approach offers strong time and space complexity guarantees in the standard RAM model of computation, getting surprisingly close to those of equi-joins. With n denoting the number of tuples in the database, we guarantee that for every value of k, the k top-ranked answers are returned in 𝒪(n polylog n + k log k) time and 𝒪(n polylog n + k) space. This is within a polylogarithmic factor of the best-known guarantee for equi-joins and even 𝒪(n + k), the time it takes to look at the input and output k answers. The key ingredient is an 𝒪(n polylog n)-size factorized representation of the query output, which is constructed on-the-fly for a given query and database. As a side benefit, our techniques are also applicable to unranked enumeration (where answers can be returned in any order) for joins with inequalities, returning k answers in 𝒪(n polylog n + k). This guarantee improves over the state of the art for large values of k. In an experimental study, we show that our ranked-enumeration approach is not only theoretically interesting, but also fast and memory-efficient in practice.



There are no comments yet.


page 1

page 5


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...

Ranked Enumeration of Join Queries with Projections

Join query evaluation with ordering is a fundamental data processing tas...

Optimal Join Algorithms Meet Top-k

Top-k queries have been studied intensively in the database community an...

Ranked Enumeration of Conjunctive Query Results

We investigate the enumeration of top-k answers for conjunctive queries ...

Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries

We study the question of when we can provide logarithmic-time direct acc...

Any-k: Anytime Top-k Tree Pattern Retrieval in Labeled Graphs

Many problems in areas as diverse as recommendation systems, social netw...

Ranked enumeration of MSO logic on words

In the last years, enumeration algorithms with bounded delay have attrac...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.