Skip to main content

Query Optimization Issues

  • Chapter
R-Trees: Theory and Applications

Abstract

Determining the best execution plan for a spatial query requires tools for measuring (more precisely, estimating) the number of (spatial) data items that are retrieved by a query as well as its cost, in terms of I/O and CPU effort. As in traditional databases, spatial query optimization tools include cost-based models, exploiting analytical formulae for selectivity and cost of a query, and histogram-based techniques.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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). Query Optimization Issues. In: R-Trees: Theory and Applications. Advanced Information and Knowledge Processing. Springer, London. https://doi.org/10.1007/978-1-84628-293-5_8

Download citation

  • DOI: https://doi.org/10.1007/978-1-84628-293-5_8

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-85233-977-7

  • Online ISBN: 978-1-84628-293-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics