See this document in CiteSeerX!

Generalizing "Search" in Generalized SearchTrees (1997)  (Make Corrections)  
Paul M. Aoki
Proc. 14th IEEE Conf. Data Engineering, ICDE



  Home/Search   Context   Related

 
View or download:
berkeley.edu/~aoki/pap...csd97950.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  berkeley.edu/~aoki/ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: The generalized search tree, or GiST, defines the basic interfaces required to construct a hierarchical access method for database systems. As originally specified, GiSTs only support record selection. In this paper, we show how a small number of additional interfaces enable GiSTs to support a much larger class of search and computation operations. (Update)

Similar documents (at the sentence level):
31.0%:   Generalizing "Search" in Generalized Search Trees (Extended.. - Aoki   (Correct)

Active bibliography (related documents):   More   All
1.5:   Algorithms for Index-Assisted Selectivity Estimation - Aoki (1998)   (Correct)
1.2:   How to Avoid Building DataBlades That Know the Value of Everything .. - Aoki (1999)   (Correct)
0.6:   Random Sampling from Databases - Olken (1993)   (Correct)

Similar documents based on text:   More   All
0.4:   High-Performance Extensible Indexing - Kornacker (1999)   (Correct)
0.4:   Efficient Concurrency Control in Multidimensional Access.. - Chakrabarti, Mehrotra (1998)   (Correct)
0.4:   Access Methods for Next-Generation Database Systems - Kornacker   (Correct)

BibTeX entry:   (Update)

@inproceedings{ aoki98generalizing,
    author = "Paul M. Aoki",
    title = "Generalizing ``Search'' in Generalized Search Trees",
    booktitle = "Proc. 14th {IEEE} Conf. Data Engineering, {ICDE}",
    month = "23--27~",
    publisher = "IEEE Computer Society",
    isbn = "0-8186-8289-2",
    pages = "380--389",
    year = "1998",
    url = "citeseer.ist.psu.edu/aoki97generalizing.html" }
Citations (may not include all citations):
3972   Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
901   Transaction Processing: Concepts and Techniques (context) - Gray, Reuter - 1993
389   Access Path Selection in a Relational Database Management Sy.. (context) - Selinger, Astrahan et al.
330   Query Evaluation Techniques for Large Databases (context) - Graefe - 1993
247   An Algorithm for Finding the Best Matches in Logarithmic Exp.. (context) - Friedman, Bentley et al. - 1977
200   R-Trees: A Dynamic Index Structure for Spatial Searching (context) - Guttman
193   Nearest Neighbor Queries - Roussopoulos, Kelley et al.
171   The POSTGRES Next-Generation Database Management System (context) - Stonebraker, Kemnitz - 1991
165   The SR-tree: An Index Structure for High-Dimensional Nearest.. - Katayama, Satoh
162   Similarity Indexing with the SS-tree (context) - White, Jain - 1996
117   Generalized Search Trees for Database Systems - Hellerstein, Naughton et al. - 1995
109   Replica Control in Distributed Systems: An Asynchronous Appr.. - Pu, Leff
104   Equi-depth Histograms for Estimating Selectivity Factors for.. (context) - Muralikrishna, DeWitt
103   Ranking in Spatial Databases - Hjaltason, Samet
80   Efficient Locking for Concurrent Operations on B-trees (context) - Lehman, Yao - 1981
78   The X-tree: An Index Structure for High-Dimensional Data - Berchtold, Keim et al. - 1996
72   GENESIS: An Extensible Database Management System (context) - Batory, Barnett et al. - 1988
68   The Ubiquitous B-tree (context) - Comer - 1979
64   Inclusion of New Types in Relational Data Base Systems - Stonebraker - 1986
53   Volume III: Sorting and Searching (context) - Knuth, of et al. - 1973
36   Algorithms for Fast Vector Quantization - Arya, Mount - 1993
32   Extended User-Defined Indexing with Application to Textual D.. (context) - Lynch, Stonebraker - 1988
31   Estimating the Selectivity of Spatial Queries Using the `Cor.. - Belussi, Faloutsos - 1995
30   System R: Relational Approach to Database Management (context) - Astrahan, Blasgen et al. - 1976
29   Dynamic Query Optimization in Rdb/VMS (context) - Antoshenkov - 1993
25   Algorithms and Strategies for Similarity Retrieval (context) - White, Jain - 1996
19   Access Method Concurrency with Recovery (context) - Lomet, Salzberg
18   A Data Management Extension Architecture (context) - Lindsay, McPherson et al.
17   A Distance-Scan Algorithm for Spatial Access Structures - Henrich - 1994
16   Random Sampling from B + Trees (context) - Olken, Rotem - 1989
15   Concurrency and Recovery in Generalized Search Trees - Kornacker, Mohan et al.
15   Dynamic Maintenance of Data Distribution for Selectivity Est.. - Whang, Kim et al. - 1994
15   Illustra Information Technologies (context) - Guide, Release et al. - 1995
14   Random Sampling from Pseudo-Ranked B + Trees (context) - Antoshenkov - 1992
11   Sampling from Spatial Databases (context) - Olken, Rotem - 1993
10   Random Sampling from Databases: A Survey - Olken, Rotem - 1995
9   Modeling the Storage Architectures of Commercial Database Sy.. (context) - Batory - 1985
9   An Efficient Method for Weighted Sampling Without Replacemen.. (context) - Wong, Easton - 1980
8   SIAM: Statistics Information Access Method (context) - Ghosh
6   An Introduction to Spatial Database Systems (context) - Gu - 1994
4   A Cost Model for Nearest Neighbor Search (context) - Berchtold, Bo et al. - 1997
4   Oracle Rdb: What's New (context) - Smith - 1996
4   A Tree Based Access Method (TBSAM) for Fast Processing of Ag.. (context) - Srivastava, Lum - 1988
4   Generation and Search of Clustered Files (context) - Salton, Wong - 1978
3   Index Key Range Estimator (context) - Anderson, Cole et al.
2   Part Number (context) - the, Interface - 1997
1   Improved Query Performance with Variant Indexes (context) - O'Neil, Quass
1   The Infinite Distance in the Determination of the Nearest Eu.. (context) - Santana, Rodriguez et al. - 1989
1   Informix-OnLine Extended Parallel Server Version (context) - OnLine, Server et al. - 1997
1   Query Optimization at the Crossroads (panel session (context) - Chaudhuri

Documents on the same site (http://db.cs.berkeley.edu/~aoki/):   More
Algorithms for Index-Assisted Selectivity Estimation - Paul Aoki (1998)   (Correct)
How to Avoid Building DataBlades That Know the Value of Everything .. - Aoki (1999)   (Correct)
Mariposa: A Wide-Area Distributed Database System - Stonebraker, Aoki, Litwin.. (1996)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC