Skip to main content
SpringerLink
Log in

Partial match queries in relaxed multidimensional search trees

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

Partial match queries arise frequently in the context of large databases, where each record contains a distinct multidimensional key, that is, the key of each record is aK-tuple of values. The components of a key are called thecoordinates orattributes of the key. In a partial match query we specify the value ofs attributes, 0<s<K, and leave the remainingK —s attributes unspecified. The goal is to retrieve all the records in the database that match the specified attributes. In this paper we present several results about the average performance and variance of partial matches in relaxedK-dimensional trees (search trees and digital tries). These data structures are variants of the well knownK d-trees andK d-tries. In relaxed trees the sequence of attributes used to guide a query is explicitly stored at the nodes of the tree and randomly generated and, in general, will be different for different search paths. In the standard variants, the sequence of attributes that guides a query examines the attributes in a cyclic fashion, fixed and identical for all search paths. We show that the probabilistic analysis of the relaxed multidimensional trees is very similar to that of standardK d-trees andK d-tries, and also to the analysis of quadtrees. In fact, besides the average cost and variance of partial match in relaxedK d-trees andK d-tries, we also obtain the variance of partial matches in two-dimensional quadtrees. We also compute the average cost of partial matches in other relaxed multidimensional digital tries, namely, relaxedK d-Patricia and relaxedK d-digital search trees.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J. L. Bentley. Multidimensional binary search trees used for associative retrieval.Communications of the ACM, 18(9):509–517, 1975.

    Article  MATH  MathSciNet  Google Scholar 

  2. W. A. Burkhard. Hashing and trie algorithms for partial match retrieval.ACM Transactions on Database Systems, 1(2):175–187, 1976.

    Article  Google Scholar 

  3. W. Cunto, G. Lau, and P. Flajolet. Analysis ofkdt-trees:kd-trees improved by local reorganisations. In F. Dehne, J.-R. Sack, and N. Santoro, editors,Algorithms and Data Structures (WADS ’89), volume 382 of LNCS, pages 24–38. Springer-Verlag, Berlin, 1989.

    Google Scholar 

  4. A. Duch, V. Estivill-Castro, and C. Martínez. Randomizedk-dimensional binary search trees. In K.-Y. Chwa and O. H. Ibarra, editors,Algorithms and Computation (ISAAC ’98), volume 1533 of LNCS, pages 199–208. Springer-Verlag, Berlin, 1998.

    Google Scholar 

  5. P. Flajolet, G. Gonnet, C. Puech, and J. M. Robson. Analytic variations on quadtrees.Algorithmica, 10:473–500, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  6. P. Flajolet and A. Odlyzko. Singularity analysis of generating functions.SIAM Journal on Discrete Mathematics, 3(1):216–240, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  7. P. Flajolet and C. Puech. Partial match retrieval of multidimensional data.Journal of the ACM, 33(2):371–407, 1986.

    Article  MathSciNet  Google Scholar 

  8. P. Flajolet and R. Sedgewick. Mellin transforms and asymptotics: finite differences and Rice’s integrals.Theoretical Computer Science, 144(1–2):101–124, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  9. J. H. Friedman, J. L. Bentley, and R. A. Finkel. An algorithm for finding best matches in logarithmic expected time.ACM Transactions on Mathematical Software, 3(3):209–226, 1977.

    Article  MATH  Google Scholar 

  10. R. L. Graham, D. E. Knuth, and O. Patashnik.Concrete Mathematics, 2nd edition. Addison-Wesley, Reading, MA, 1994.

    MATH  Google Scholar 

  11. P. Kirschenhofer and H. Prodinger. Multidimensional digital searching—alternative data structures.Random Structures & Algorithms, 5(1):123–134, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  12. P. Kirschenhofer, H. Prodinger, and W. Szpankowski. Multidimensional digital searching and some new parameters in tries.International Journal of Foundations of Computer Science, 4:69–84, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  13. D. E. Knuth.The Art of Computer Programming: Fundamental Algorithms, volume 1, 3rd edition. Addison-Wesley, Reading, MA, 1997.

    Google Scholar 

  14. D. E. Knuth.The Art of Computer Programming: Sorting and Searching, volume 3, 2nd edition. Addison-Wesley, Reading, MA, 1998.

    Google Scholar 

  15. R. L. Rivest. Partial-match retrieval algorithms.SIAM Journal on Computing, 5(1):19–50, 1976.

    Article  MATH  MathSciNet  Google Scholar 

  16. S. Roura. An improved master theorem for divide an conquer recurrences. In P. Degano, R. Gorrieri, and A. Marchetti-Spaccamela, editors,Automata, Languages and Programming (ICALP ’97), volume 1256 of LNCS, pages 449–459. Springer-Verlag, Berlin, 1997.

    Google Scholar 

  17. H. Samet.The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading, MA, 1990.

    Google Scholar 

  18. W. Schachinger. The variance of a partial match retrieval in a multidimensional symmetric trie.Random Structures & Algorithms, 7(1):81–95, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  19. R. Sedgewick.Algorithms in C, volume 1, 3rd edition. Addison-Wesley, Reading, MA, 1997.

    Google Scholar 

  20. R. Sedgewick and P. Flajolet.An Introduction to the Analysis of Algorithms. Addison-Wesley, Reading, MA, 1996.

    MATH  Google Scholar 

  21. E. T. Whittaker and G. N. Watson.A Course of Modern Analysis. Cambridge University Press, Cambridge, 1952.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departament de Llenguatges i Sistemes Informàtics, Polytechnic University of Catalonia, Jordi Girona 1–3, E-08034, Barcelona, Spain

    C. Martínez

  2. Institut für Algebra und Computermathematik, Technical University of Vienna, Wiedner Hauptstraße 8–10, A-1040, Vienna, Austria

    A. Panholzer

  3. Mathematics Department, University of Witwatersrand, P.O. Wits, 2050, Johannesburg, South Africa

    H. Prodinger

Authors
  1. C. Martínez
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Panholzer
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. H. Prodinger
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by H. Prodinger and W. Szpankowski.

This research was supported by Acciones Integradas Hispano-Austríacas HU1997-0016 (Austrian-Spanish Scientific Exchange Program). The first author was also supported by ESPRIT LTR 20244 (ALCOM IT), CICYT TIC97-1475-CE, DGES PB95-0787 (KOALA), and CIRIT 1997SGR-00366 (SGR). The second author was also supported by the Austrian Research Society (FWF) under Project P12599-MAT.

Online publication October 13, 2000.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Martínez, C., Panholzer, A. & Prodinger, H. Partial match queries in relaxed multidimensional search trees. Algorithmica 29, 181–204 (2001). https://doi.org/10.1007/BF02679618

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02679618

Key Words

Search

Navigation