Slim-Trees: High Performance Metric Trees Minimizing Overlap Between Nodes.

@inproceedings{DBLP:conf/edbt/TrainaTSF00,
  author    = {Caetano Traina Jr. and
               Agma J. M. Traina and
               Bernhard Seeger and
               Christos Faloutsos},
  editor    = {Carlo Zaniolo and
               Peter C. Lockemann and
               Marc H. Scholl and
               Torsten Grust},
  title     = {Slim-Trees: High Performance Metric Trees Minimizing Overlap
               Between Nodes},
  booktitle = {Advances in Database Technology - EDBT 2000, 7th International
               Conference on Extending Database Technology, Konstanz, Germany,
               March 27-31, 2000, Proceedings},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1777},
  year      = {2000},
  isbn      = {3-540-67227-3},
  pages     = {51-65},
  ee        = {db/conf/edbt/TrainaTSF00.html, http://link.springer.de/link/service/series/0558/bibs/1777/17770051.htm},
  crossref  = {DBLP:conf/edbt/2000},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Online Edition: Springer LINK

References

[1]

Volker Gaede, Oliver Günther: Multidimensional Access Methods. ACM Comput. Surv. 30(2): 170-231(1998) BibTeX

[2]

Paolo Ciaccia, Marco Patella, Pavel Zezula: M-tree: An Efficient Access Method for Similarity Search in Metric Spaces. VLDB 1997: 426-435 BibTeX

[3]

Walter A. Burkhard, Robert M. Keller: Some Approaches to Best-Match File Searching. Commun. ACM 16(4): 230-236(1973) BibTeX

[4]

Jeffrey K. Uhlmann: Satisfying General Proximity/Similarity Queries with Metric Trees. Inf. Process. Lett. 40(4): 175-179(1991) BibTeX

[5]

Peter N. Yianilos: Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces. SODA 1993: 311-321 BibTeX

[6]

Ricardo A. Baeza-Yates, Walter Cunto, Udi Manber, Sun Wu: Proximity Matching Using Fixed-Queries Trees. CPM 1994: 198-212 BibTeX

[7]

Tolga Bozkaya, Z. Meral Özsoyoglu: Distance-Based Indexing for High-Dimensional Metric Spaces. SIGMOD Conference 1997: 357-368 BibTeX

[8]

Sergey Brin: Near Neighbor Search in Large Metric Spaces. VLDB 1995: 574-584 BibTeX

[9]

Antonin Guttman: R-Trees: A Dynamic Index Structure for Spatial Searching. SIGMOD Conference 1984: 47-57 BibTeX

[10]

...

[11]

...

[12]

Paolo Ciaccia, Marco Patella, Fausto Rabitti, Pavel Zezula: Indexing Metric Spaces with M-Tree. SEBD 1997: 67-86 BibTeX

[13]

Christos Faloutsos, Ibrahim Kamel: Beyond Uniformity and Independence: Analysis of R-trees Using the Concept of Fractal Dimension. PODS 1994: 4-13 BibTeX

[14]

Caetano Traina Jr., Agma J. M. Traina, Christos Faloutsos: Distance Exponent: A New Concept for Selectivity Estimation in Metric Trees. ICDE 2000: 195 BibTeX

[15]

Timos K. Sellis, Nick Roussopoulos, Christos Faloutsos: The R+-Tree: A Dynamic Index for Multi-Dimensional Objects. VLDB 1987: 507-518 BibTeX

[16]

Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider, Bernhard Seeger: The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles. SIGMOD Conference 1990: 322-331 BibTeX

[17]

Stefan Berchtold, Christian Böhm, Daniel A. Keim, Hans-Peter Kriegel: A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space. PODS 1997: 78-86 BibTeX

[18]

Howard D. Wactlar, Takeo Kanade, Michael A. Smith, Scott M. Stevens: Intelligent Access to Digital Video: Informedia Project. IEEE Computer 29(5): 46-52(1996) BibTeX

[19]

...