• Corpus ID: 231772932

Space-Time Tradeoffs for Answering Boolean Conjunctive Queries

  title={Space-Time Tradeoffs for Answering Boolean Conjunctive Queries},
  author={Shaleen Deep and Xiao Hu and Paraschos Koutris},
In this paper, we investigate space-time tradeoffs for answering boolean conjunctive queries. The goal is to create a data structure in an initial preprocessing phase and use it for answering (multiple) queries. Previous work has developed data structures that trade off space usage for answering time and has proved conditional space lower bounds for queries of practical interest such as the path and triangle query. However, most of these results cater to only those queries, lack a comprehensive… 
1 Citations

Figures from this paper

Strengthening Order Preserving Encryption with Differential Privacy
Ciphertexts of an order-preserving encryption (OPE) scheme preserve the order of their corresponding plaintexts. However, OPEs are vulnerable to inference attacks that exploit this preserved order.


Answering Conjunctive Queries under Updates
A new notion of q-hierarchical conjunctive queries is exhibited and it is shown that these can be maintained efficiently in the following sense: during a linear time pre-processing phase, a data structure is built that enables constant delay enumeration of the query results; and when the database is updated, the data structure can be updated and restart the enumeration phase within constant time.
Compressed Representations of Conjunctive Query Results
This work studies the construction of space-efficient compressed representations of the output of conjunctive queries, with the goal of supporting the efficient access of the intermediate compressed result for a given access pattern.
Processing Unions of Conjunctive Queries with Negation under Limited Access Patterns
For query answering at runtime, an algorithm is devised which may report complete answers even in the case of infeasible plans and which can indicate to the user the degree of completeness for certain incomplete answers.
Size Bounds and Query Plans for Relational Joins
This work studies relational joins from a theoretical perspective and shows that there exist queries for which the join-project plan suggested by the fractional edge cover approach may be substantially better than any join plan that does not use intermediate projections.
Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries
The main result of this work defines the preprocessing time, the update time, and the enumeration delay as functions of the light/heavy threshold, which recovers a number of prior results when restricted to hierarchical queries.
Residual Sensitivity for Differentially Private Multi-Way Joins
This paper presents the first differentially private mechanism for multi-way joins that satisfies all three desiderata while supporting any number of private relations, moving us one step closer to a full-featured query engine for private relational data.
Containment of Conjunctive Queries with Safe Negation
The algorithm proposed in this paper exploits the containment mappings of their positive counterparts, and terminates once the specified test succeeds, and it is shown that in the worst case the algorithm has the same performance as the one proposed in previous work.
Skew strikes back: new developments in the theory of join algorithms
A survey of recent work on join algorithms that have provable worst-case optimality runtime guarantees is described and a simpler and unified description of these algorithms is provided that is useful for theory-minded readers, algorithm designers, and systems implementors.
The Space-Stretch-Time Tradeoff in Distance Oracles
New distance oracles for computing distances of stretch less than 2 on general weighted undirected graphs and for any integer k are presented, which significantly improves the state-of-the-art for each point in the space-stretch-time tradeoff space.
Conditional Lower Bounds for Space/Time Tradeoffs
It is shown that surprisingly many of the well-studied hard problems that are known to have conditional polynomial time lower bounds are also hard when concerning space and this hardness is shown as a tradeoff between the space consumed by the data structure and the time needed to answer queries.