Skip to main content
SpringerLink
Log in

Generalized Search Tree

  • Reference work entry
  • First Online:
Encyclopedia of Database Systems

  • 72 Accesses

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 4,499.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 6,499.99
Price excludes VAT (USA)
  • Durable hardcover 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

Recommended Reading

  1. Aoki PM. Generalizing “search” in generalized search trees. In: Proceedings of the 14th International Conference on Data Engineering; 1998.

    Google Scholar 

  2. Aoki PM. How to avoid building dataBlades that know the value of everything and the cost of nothing. In: Proceedings of the 11th International Conference on Scientific and Statistical Database Management; 1999. p. 122–33.

    Google Scholar 

  3. Aref WG, Ilyas IF. SP-GiST: an extensible database index for supporting space partitioning trees. J Intell Inf Syst. 2001;17(2/3):215–40.

    Article  MATH  Google Scholar 

  4. Hellerstein JM, Koutsoupias E, Miranker D, Papadimitriou C, Samoladas V. On a model of indexability and its bounds for range queries. J ACM. 2002;49(1):35–55.

    Article  MathSciNet  MATH  Google Scholar 

  5. Hellerstein JM, Naughton JF, Pfeffer A. Generalized search trees for database systems. In: Proceedings of the 21st International Conference on Very Large Data Bases; 1995. p. 562–73.

    Google Scholar 

  6. Hellerstein JM, Pfeffer A. The RD-tree: an index structure for sets. Madison: University of Wisconsin Technical Report #1252; 1994.

    Google Scholar 

  7. Kornacker M. High-performance generalized search trees. In: Proceedings of the 25th International Conference on Very Large Data Bases; 1999.

    Google Scholar 

  8. Kornacker M, Mohan C, Hellerstein JM. Concurrency and recovery in generalized search trees. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1997. p. 62–72.

    Article  Google Scholar 

  9. Kornacker M, Shah MA, Hellerstein JM. Amdb: a design tool for access methods. Data Eng Bull. 2003;26(2):3–11.

    Google Scholar 

  10. Thomas MC, Hellerstein JM. Boolean bounding predicates for spatial access methods. In: Proceedings of the International Conference on Database and Expert Systems Applications; 2002. p. 925–34.

    Google Scholar 

  11. Stonebraker M. Inclusion of new types in relational data base systems. In: Proceedings of the 2nd International Conference on Data Engineering; 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of California-Berkeley, Berkeley, CA, USA

    Joseph M. Hellerstein

Authors
  1. Joseph M. Hellerstein
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Joseph M. Hellerstein .

Editor information

Editors and Affiliations

  1. Georgia Institute of Technology College of Computing, Atlanta, GA, USA

    Ling Liu

  2. University of Waterloo School of Computer Science, Waterloo, ON, Canada

    M. Tamer Özsu

Section Editor information

  1. University of California-Riverside, Riverside, CA, USA

    Vassilis J. Tsotras

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Science+Business Media, LLC, part of Springer Nature

About this entry

Check for updates. Verify currency and authenticity via CrossMark

Cite this entry

Hellerstein, J.M. (2018). Generalized Search Tree. In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_743

Download citation

Publish with us

Policies and ethics

Search

Navigation