Abstract
The query processing techniques studied in the previous chapter can be considered fundamental. In recent research, however, several more complex extensions have been proposed, which consider additional aspects. In this chapter, we consider such extensions and present them in the same order as in the previous chapter. Therefore, we first describe extensions to range queries, next we consider extensions to nearest-neighbor queries, and finally we present extensions to spatial join queries. These queries require significant I/O and CPU cost, and therefore sophisticated methods have be applied to reduce processing cost. Finally, approximate query processing techniques are presented that sacrifice accuracy for better performance.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag London Limited
About this chapter
Cite this chapter
Manolopoulos, Y., Nanopoulos, A., Papadopoulos, A.N., Theodoridis, Y. (2006). Processing More Complex Queries. In: R-Trees: Theory and Applications. Advanced Information and Knowledge Processing. Springer, London. https://doi.org/10.1007/978-1-84628-293-5_5
Download citation
DOI: https://doi.org/10.1007/978-1-84628-293-5_5
Publisher Name: Springer, London
Print ISBN: 978-1-85233-977-7
Online ISBN: 978-1-84628-293-5
eBook Packages: Computer ScienceComputer Science (R0)