Skip to main content
SpringerLink
Log in

Memory-Adaptative Dynamic Spatial Approximation Trees

  • Conference paper
String Processing and Information Retrieval (SPIRE 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2857))

Included in the following conference series:

Abstract

Dynamic spatial approximation trees (dsa–trees) are efficient data structures for searching metric spaces. However, using enough storage, pivoting schemes beat dsa–trees in any metric space. In this paper we combine both concepts in a data structure that enjoys the features of dsa–trees and that improves query time by making the best use of the available memory. We show experimentally that our data structure is competitive for searching metric spaces.

Supported in part by CYTED VII.19 RIBIDI Project and, the third author, Millenium Nucleus Center for Web Research, Grant P01-029-F, Mideplan, Chile.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chávez, E., Navarro, G., Baeza-Yates, R., Marroquín, J.: Proximity searching in metric spaces. ACM Computing Surveys 33(3), 273–321 (2001)

    Article  Google Scholar 

  2. Navarro, G., Reyes, N.: Fully dynamic spatial approximation trees. In: Laender, A.H.F., Oliveira, A.L. (eds.) SPIRE 2002. LNCS, vol. 2476, pp. 254–270. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  3. Traina, C., Traina, A., Santos Filho, R., Faloutsos, C.: How to improve the pruning ability of dynamic metric access methods. In: Proc. CIKM 2002, pp. 219–226 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Depto. de Informática, Univ. Nac. de San Luis, Argentina

    Diego Arroyuelo & Nora Reyes

  2. Center for Web Research, Dept. of Computer Science, Univ. of Chile,  

    Francisca Muñoz & Gonzalo Navarro

Authors
  1. Diego Arroyuelo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Francisca Muñoz
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gonzalo Navarro
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Nora Reyes
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computing Science, University of Alberta, Canada

    Mario A. Nascimento

  2. Universidade Federal do Amazonas, Manaus, AM, Brasil

    Edleno S. de Moura

  3. INESC-ID/IST, R. Alves Redol 9, 1000, Lisboa, Portugal

    Arlindo L. Oliveira

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Arroyuelo, D., Muñoz, F., Navarro, G., Reyes, N. (2003). Memory-Adaptative Dynamic Spatial Approximation Trees. In: Nascimento, M.A., de Moura, E.S., Oliveira, A.L. (eds) String Processing and Information Retrieval. SPIRE 2003. Lecture Notes in Computer Science, vol 2857. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39984-1_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39984-1_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20177-9

  • Online ISBN: 978-3-540-39984-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation