Spatial query processing in an object-oriented database system
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Optimization, approximation, and complexity classes
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Query evaluation techniques for large databases
ACM Computing Surveys (CSUR)
The traveling salesman problem with distances one and two
Mathematics of Operations Research
Partition based spatial-merge join
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Object Relational DBMSs: The Next Great Wave
Object Relational DBMSs: The Next Great Wave
Efficient Computation of Spatial Joins
Proceedings of the Ninth International Conference on Data Engineering
Set Containment Joins: The Good, The Bad and The Ugly
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Evaluation of Main Memory Join Algorithms for Joins with Set Comparison Join Predicates
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Singularities Make Spatial Join Scheduling Hard
ISAAC '97 Proceedings of the 8th International Symposium on Algorithms and Computation
Divide-and-Conquer Algorithm for Computing Set Containment Joins
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Adaptive algorithms for set containment joins
ACM Transactions on Database Systems (TODS)
Weighted hypertree decompositions and optimal query plans
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Uniform Constraint Satisfaction Problems and Database Theory
Complexity of Constraints
Efficient answering of set containment queries for skewed item distributions
Proceedings of the 14th International Conference on Extending Database Technology
Using prefix-trees for efficiently computing set joins
DASFAA'05 Proceedings of the 10th international conference on Database Systems for Advanced Applications
Efficient processing of containment queries on nested sets
Proceedings of the 16th International Conference on Extending Database Technology
Hi-index | 0.00 |
We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins combinatorially, by the length of their optimal pebbling strategies and computationally, by the complexity of discovering these strategies. Our results show that equijoins are the easiest of all joins, with optimal pebbling strategies that meet the lower bound over all join problems and that can be found in linear time. By contrast, spatial-overlap and set-containment joins are the hardest joins, with instances where optimal pebbling strategies reach the upper bound over all join problems and with the problem of discovering optimal pebbling strategies being NP-complete. For set-containment joins, we show that discovering the optimal pebbling is also MAX-SNP-Complete. As a consequence, we show that unless NP = P, there is a constant ∈o, such that this problem cannot be approximated within a factor of 1 + ∈&Ogr; in polynomial time. Our results shed some light on the difficulty the applied community has had in finding “good” algorithms for spatial-overlap and set-containment joins.