Abstract
The efficiency of database join operations depends crucially on how page fetches are scheduled. In general, finding an optimum schedule is.NP-hard. We show that for a class of popular spatial clustering techniques used for spatial data structures, an optimum page fetch schedule that holds two pages in main memory can be computed in time linear in the length of the schedule. In full generality, we prove spatial join scheduling to be NP-hard.
Cite
CITATION STYLE
Neyer, G., & Widmayer, P. (1997). Singularities make spatial join scheduling hard. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1350, pp. 293–302). Springer Verlag. https://doi.org/10.1007/3-540-63890-3_32
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
