Generalized Search Trees for Database Systems

  title={Generalized Search Trees for Database Systems},
  author={Joseph M. Hellerstein and Jeffrey F. Naughton and Avi Pfeffer},
This paper introduces the Generalized Search Tree (GiST), an index structure supporting an extensible set of queries and data types. The GiST allows new data types to be indexed in a manner supporting queries natural to the types; this is in contrast to previous work on tree extensibility which only supported the traditional set of equality and range predicates. In a single data structure, the GiST provides all the basic search tree logic required by a database system, thereby unifying… CONTINUE READING
Highly Influential
This paper has highly influenced 38 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 565 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
319 Citations
29 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 319 extracted citations

566 Citations

Citations per Year
Semantic Scholar estimates that this publication has 566 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 29 references

Egenhofer . Topological Relations in the World of Minimum Bounding Rectangles : A Study with Rtrees

  • J. T. Robinson.
  • 1995

Generalized Search Trees for Database Systems

  • Joseph M. Hellerstein, Jeffrey F. Naughton, Avi Pfeffer
  • Technical Report #1274,
  • 1995

Hellerstein and Michael Stonebraker . Predicate Migration : Optimizing Queries With Expensive Predicates

  • M. Joseph
  • Illustra User ’ s Guide , Illustra Server Release…
  • 1994

Lomet and Betty Salzberg . The hB - Tree : A Multiattribute Indexing Method

  • B David
  • VLDB Journal
  • 1994

The RDTree: An Index Structure for Sets

  • Joseph M. Hellerstein, Avi Pfeffer
  • Technical Report #1252,
  • 1994

Similar Papers

Loading similar papers…