On the complexity of join predicates

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2001, Pages 207-214

  Cai, J Y ^a   Chakaravarthy, V T ^a   Kaushik, R ^a   Naughton, J F ^a  

^a University of Wisconsin Madison   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; GAME THEORY; MATHEMATICAL MODELS; POLYNOMIALS; STRATEGIC PLANNING;

OPTIMAL PEBBLING STRATEGIES;

RELATIONAL DATABASE SYSTEMS;

EID: 0034826252     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/375551.375592     Document Type: Conference Paper

References (15)

1. Proof verification and hardness of approximation problems
2. Query evaluation techniques for large databases
3. Efficient computation of spatial joins
4. Evaluation of main memory join algorithms for joins with set comparison join predicates
5. Scheduling of page-fetches in join operations
6. Singularities make spatial join scheduling hard
7. Spatial query processing in an object-oriented database system
8. Optimization, approximation, and complexity classes (extended abstract)
9. The travelling salesman problem with distances 1 and 2
10. Partition based spatial-merge join
11. Set containment joins: The good, the bad and the ugly