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.
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Neyer, G., Widmayer, P. (1997). Singularities make spatial join scheduling hard. In: Leong, H.W., Imai, H., Jain, S. (eds) Algorithms and Computation. ISAAC 1997. Lecture Notes in Computer Science, vol 1350. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63890-3_32
Download citation
DOI: https://doi.org/10.1007/3-540-63890-3_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63890-2
Online ISBN: 978-3-540-69662-9
eBook Packages: Springer Book Archive