Trading Quality for Time with Nearest Neighbor Search Roger Weber and Klemens Böhm   View Paper (PDF)   Return to Indexing & Searching References Note: References link to DBLP on the Web. [1] Sunil Arya , David M. Mount , Nathan S. Netanyahu , Ruth Silverman , Angela Y. Wu : An Optimal Algorithm for Approximate Nearest Neighbor Searching Fixed Dimensions. JACM 45(6) : 891-923(1998) [2] Daniel Barbará , William DuMouchel , Christos Faloutsos , Peter J. Haas , Joseph M. Hellerstein , Yannis E. Ioannidis , H. V. Jagadish , Theodore Johnson , Raymond T. Ng , Viswanath Poosala , Kenneth A. Ross , Kenneth C. Sevcik : The New Jersey Data Reduction Report. Data Engineering Bulletin 20(4) : 3-45(1997) [3] 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 [4] Stefan Berchtold , Christian Böhm , Bernhard Braunmüller , Daniel A. Keim , Hans-Peter Kriegel : Fast Parallel Similarity Search in Multimedia Databases. SIGMOD Conference 1997 : 1-12 [5] Stefan Berchtold , Daniel A. Keim , Hans-Peter Kriegel : The X-tree : An Index Structure for High-Dimensional Data. VLDB 1996 : 28-39 [6] Kevin S. Beyer , Jonathan Goldstein , Raghu Ramakrishnan , Uri Shaft : When Is ''Nearest Neighbor'' Meaningful? ICDT 1999 : 217-235 [7] Paolo Ciaccia , Marco Patella , Pavel Zezula : M-tree: An Efficient Access Method for Similarity Search in Metric Spaces. VLDB 1997 : 426-435 [8] Paolo Ciaccia , Marco Patella , Pavel Zezula : A Cost Model for Similarity Queries in Metric Spaces. PODS 1998 : 59-68 [9] Alexander Dimai : Spatial Encoding Using Differences of Global Features. Storage and Retrieval for Image and Video Databases (SPIE) 1997 : 352-360 [10] Ronald Fagin : Combining Fuzzy Information from Multiple Systems. PODS 1996 : 216-226 [11] Aristides Gionis , Piotr Indyk , Rajeev Motwani : Similarity Search in High Dimensions via Hashing. VLDB 1999 : 518-529 [12] Antonin Guttman : R-Trees: A Dynamic Index Structure for Spatial Searching. SIGMOD Conference 1984 : 47-57 [13] Kothuri Venkata Ravi Kanth , Divyakant Agrawal , Ambuj K. Singh : Dimensionality Reduction for Similarity Searching in Dynamic Databases. SIGMOD Conference 1998 : 166-176 [14] Norio Katayama , Shin'ichi Satoh : The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries. SIGMOD Conference 1997 : 369-380 [15] Roger Weber , Hans-Jörg Schek , Stephen Blott : A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces. VLDB 1998 : 194-205 [16] ... BIBTEX @inproceedings{DBLP:conf/edbt/WeberB00,   author    = {Roger Weber and                 Klemens B{\"o}hm},    editor    = {Carlo Zaniolo and                 Peter C. Lockemann and                 Marc H. Scholl and                 Torsten Grust},    title     = {Trading Quality for Time with Nearest Neighbor Search},    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     = {21-35},    crossref  = {DBLP:conf/edbt/2000},    bibsource = {DBLP, http://dblp.uni-trier.de} } }, DiSC'01 Copyright ©2002 ACM Inc.