ACM SIGMOD Anthology ACM SIGMOD dblp.uni-trier.de

The LSDh-Tree: An Access Structure for Feature Vectors.

Andreas Henrich: The LSDh-Tree: An Access Structure for Feature Vectors. ICDE 1998: 362-369
@inproceedings{DBLP:conf/icde/Henrich98,
  author    = {Andreas Henrich},
  title     = {The LSD$^{\mbox{h}}$-Tree: An Access Structure for Feature Vectors},
  booktitle = {Proceedings of the Fourteenth International Conference on Data
               Engineering, February 23-27, 1998, Orlando, Florida, USA},
  publisher = {IEEE Computer Society},
  year      = {1998},
  isbn      = {0-8186-8289-2},
  pages     = {362-369},
  ee        = {db/conf/icde/Henrich98.html},
  crossref  = {DBLP:conf/icde/98},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 1998 by The Institute of Electrical and Electronic Engineers, Inc. (IEEE). Abstract used with permission.


ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 2 Issue 7, ICDE 1996-1998, PDIS, Hypertext, ACL DL" and ... DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...

Printed Edition

Proceedings of the Fourteenth International Conference on Data Engineering, February 23-27, 1998, Orlando, Florida, USA. IEEE Computer Society 1998, ISBN 0-8186-8289-2
Contents CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML

References

[1]
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 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[2]
Jon Louis Bentley: Multidimensional Binary Search Trees Used for Associative Searching. Commun. ACM 18(9): 509-517(1975) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[3]
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 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[4]
Stefan Berchtold, Christian Böhm, Hans-Peter Kriegel: Improving the Query Performance of High-Dimensional Index Structures by Bulk-Load Operations. EDBT 1998: 216-230 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[5]
Stefan Berchtold, Daniel A. Keim, Hans-Peter Kriegel: The X-tree : An Index Structure for High-Dimensional Data. VLDB 1996: 28-39 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[6]
Michael Freeston: The BANG File: A New Kind of Grid File. SIGMOD Conference 1987: 260-269 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[7]
Jerome H. Friedman, Jon Louis Bentley, Raphael A. Finkel: An Algorithm for Finding Best Matches in Logarithmic Expected Time. ACM Trans. Math. Softw. 3(3): 209-226(1977) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[8]
Antonin Guttman: R-Trees: A Dynamic Index Structure for Spatial Searching. SIGMOD Conference 1984: 47-57 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[9]
Andreas Henrich: A Distance Scan Algorithm for Spatial Access Structures. ACM-GIS 1994: 136-143 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[10]
Andreas Henrich: Adapting a Spatial Access Structure for Document Representations in Vector Space. CIKM 1996: 19-26 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[11]
Andreas Henrich: Improving the Performance of Multi-Dimensional Access Structures Based on k-d-Trees. ICDE 1996: 68-75 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[12]
...
[13]
Andreas Henrich, Hans-Werner Six, Peter Widmayer: The LSD tree: Spatial Access to Multidimensional Point and Nonpoint Objects. VLDB 1989: 45-53 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[14]
Gísli R. Hjaltason, Hanan Samet: Ranking in Spatial Databases. SSD 1995: 83-95 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[15]
Norio Katayama, Shin'ichi Satoh: The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries. SIGMOD Conference 1997: 369-380 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[16]
Marc J. van Kreveld, Mark H. Overmars: Divided k-d Trees. Algorithmica 6(6): 840-858(1991) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[17]
King-Ip Lin, H. V. Jagadish, Christos Faloutsos: The TV-Tree: An Index Structure for High-Dimensional Data. VLDB J. 3(4): 517-542(1994) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[18]
David B. Lomet, Betty Salzberg: A Robust Multi-Attribute Search Structure. ICDE 1989: 296-304 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[19]
Jürg Nievergelt, Hans Hinterberger, Kenneth C. Sevcik: The Grid File: An Adaptable, Symmetric Multikey File Structure. ACM Trans. Database Syst. 9(1): 38-71(1984) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[20]
...
[21]
Mireille Régnier: Analysis of Grid File Algorithms. BIT 25(2): 335-357(1985) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[22]
John T. Robinson: The K-D-B-Tree: A Search Structure For Large Multidimensional Dynamic Indexes. SIGMOD Conference 1981: 10-18 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[23]
Nick Roussopoulos, Stephen Kelley, Frédéic Vincent: Nearest Neighbor Queries. SIGMOD Conference 1995: 71-79 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[24]
Gerard Salton, A. Wong, C. S. Yang: A Vector Space Model for Automatic Indexing. Commun. ACM 18(11): 613-620(1975) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[25]
Bernhard Seeger, Hans-Peter Kriegel: The Buddy-Tree: An Efficient and Robust Access Method for Spatial Data Base Systems. VLDB 1990: 590-601 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[26]
Timos K. Sellis, Nick Roussopoulos, Christos Faloutsos: The R+-Tree: A Dynamic Index for Multi-Dimensional Objects. VLDB 1987: 507-518 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[27]
V. S. Subrahmanian, Sushil Jajodia (Eds.): Multimedia Database System: Issues and Research Direction. Springer 1996, ISBN 3-540-58710-1
Contents CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[28]
David A. White, Ramesh Jain: Similarity Indexing: Algorithms and Performance. Storage and Retrieval for Image and Video Databases (SPIE) 1996: 62-73 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[29]
David A. White, Ramesh Jain: Similarity Indexing with the SS-tree. ICDE 1996: 516-523 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML

Referenced by

  1. Christian Böhm, Hans-Peter Kriegel: Dynamically Optimizing High-Dimensional Index Structures. EDBT 2000: 36-50
  2. Gísli R. Hjaltason, Hanan Samet: Distance Browsing in Spatial Databases. ACM Trans. Database Syst. 24(2): 265-318(1999)
  3. Kaushik Chakrabarti, Sharad Mehrotra: The Hybrid Tree: An Index Structure for High Dimensional Feature Spaces. ICDE 1999: 440-447
  4. Gunter Saake, Andreas Heuer: Datenbanken: Implementierungstechniken. MITP-Verlag 1999, ISBN 3-8266-0513-6
    Contents

Copyright © Mon Nov 2 20:43:59 2009 by Michael Ley (ley@uni-trier.de)