Database Theory in Action: Direct Access to Query Answers
By: Jiayin Hu, Nikolaos Tziavelis
Potential Business Impact:
Finds answers in lists faster than before.
Direct access asks for the retrieval of query answers by their ranked position, given a query and a desired order. While the time complexity of data structures supporting such accesses has been studied in depth, and efficient algorithms for many queries and common orders are known, their practical performance has received little attention. We provide an implementation covering a wide range of queries and orders; it allows us to investigate intriguing practical aspects, including the comparative performance of database systems and the relationship between direct access and its single-access counterpart.
Similar Papers
Efficient Direct-Access Ranked Retrieval
Data Structures and Algorithms
Finds data fast without checking everything.
Fine-Grained Dichotomies for Conjunctive Queries with Minimum or Maximum
Databases
Finds specific data in databases much faster.
Database Theory in Action: From Inexpressibility to Efficiency in GQL's Order-Constrained Paths
Databases
Finds patterns faster by changing how data is stored.