Singularities make spatial join scheduling hard

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1350, Issue , 1997, Pages 293-302

  Neyer, Gabriele ^a   Widmayer, Peter ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

SCHEDULING; STRUCTURAL OPTIMIZATION;

JOIN OPERATION; MAIN MEMORY; NP-HARD; OPTIMUM SCHEDULE; SPATIAL CLUSTERING; SPATIAL DATA STRUCTURE; SPATIAL JOIN;

OPTIMIZATION;

EID: 84958037021     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63890-3_32     Document Type: Conference Paper

References (7)

1. N. Chiba and T. Nishizeki. The Hamiltonian Cycle Problem is Linear-Time Solvable for 4-Connected Planar Graphs. Journal of Algorithms, 10(2):187-211, June 1989.
2. J. Czyzowicz, E. Rivera-Campo, N. Santoro, J. Urrutia, and J. Zaks. Guarding Rectangular Art Galleries. DAMATH: Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science, 50:149-157, 1994.
3. D. J. DeWitt and J. M. Patel. Partition Based Spatial-Merge Join. In Proceedings of the 1996 ACM SIGMOD, Montreal, pages 259-270, June 1996.
4. M.R. Garey, D.S. Johnson, and R.E. Tarjan. The Planar Hamiltonian Circuit Problem is NP Complete. SIAM Journal on Computing, 5:704-714, 1976.
5. Y. Kambayashi, T. H. Merrett, and H. Yasura. Scheduling of Page-Fetches in Join Operations. In Proceedings of the 7th Conference on Very Large Databases, Morgan Kaufman, September 1981. E. Kranakis. private communication, 1997.
6. K. Mehlhorn, F.P. Preparata, and M. Sarrafzadeh. Channel Routing in Knock-Knee Mode: Simplified Algorithms and Proofs. Algorithmica 1, pages 213-221, 1986.
7. W. Tutte. A Theorem on Planar Graphs. Trans. American Math. Soc., 82:99-116, 1956.