The Basic Principles of Metric Indexing

[1]  Wojciech Rytter,et al.  Extracting Powers and Periods in a String from Its Runs Structure , 2010, SPIRE.

[2]  Marcos R. Vieira,et al.  DBM-Tree: A Dynamic Metric Access Method Sensitive to Local Density Data , 2010, J. Inf. Data Manag..

[3]  Mauricio Marín,et al.  Hybrid Index for Metric Space Databases , 2008, ICCS.

[4]  Nieves R. Brisaboa,et al.  Clustering-Based Similarity Search in Metric Spaces with Sparse Spatial Centers , 2008, SOFSEM.

[5]  Israel Spiegler,et al.  CM-tree: A dynamic clustered index for similarity search in metric databases , 2007, Data Knowl. Eng..

[6]  Tomás Skopal,et al.  Unified framework for fast exact and approximate search in dissimilarity spaces , 2007, TODS.

[7]  Tomás Skopal,et al.  Improving the Performance of M-Tree Family by Nearest-Neighbor Graphs , 2007, ADBIS.

[8]  R. J. Barrientos,et al.  Searching and Updating Metric Space Databases Using the Parallel EGNAT , 2007, International Conference on Computational Science.

[9]  Pavel Zezula,et al.  Nearest neighbor search in metric spaces through Content-Addressable Networks , 2007, Inf. Process. Manag..

[10]  Nieves R. Brisaboa,et al.  Spatial Selection of Sparse Pivots for Similarity Search in Metric Spaces , 2007, SOFSEM.

[11]  Benjamin Bustos,et al.  Dynamic similarity search in multi-metric spaces , 2006, MIR '06.

[12]  Hanan Samet,et al.  Foundations of multidimensional and metric data structures , 2006, Morgan Kaufmann series in data management systems.

[13]  Bing Liu,et al.  A Bottom-up Distance-based index Tree for Metric Space , 2006, 2006 2nd International Conference on Information & Communication Technologies.

[14]  David Novak,et al.  M-Chord: a scalable distributed similarity search structure , 2006, InfoScale '06.

[15]  Gonzalo Navarro,et al.  An Index Data Structure for Searching in Metric Space Databases , 2006, International Conference on Computational Science.

[16]  Stephen Gilmore,et al.  Combining Measurement and Stochastic Modelling to Enhance Scheduling Decisions for a Parallel Mean Value Analysis Algorithm , 2006, International Conference on Computational Science.

[17]  Gonzalo Navarro,et al.  On the Least Cost for Proximity Searching in Metric Spaces , 2006, WEA.

[18]  Tomás Skopal,et al.  On Fast Non-metric Similarity Search by Metric Access Methods , 2006, EDBT.

[19]  William Fahle,et al.  Review of "Graphs, Networks, and Algorithms (second edition) by Dieter Jungnickel", Springer-Verlag 2005 , 2005, SIGA.

[20]  Pavel Zezula,et al.  Similarity Search - The Metric Space Approach , 2005, Advances in Database Systems.

[21]  Gonzalo Navarro,et al.  Proximity Searching in High Dimensional Spaces with a Proximity Preserving Order , 2005, MICAI.

[22]  Marcos R. Vieira,et al.  DBM-Tree: Trading height-balancing for performance in metric access methods , 2005, Journal of the Brazilian Computer Society.

[23]  Kaizhong Zhang,et al.  MetricMap: an embedding technique for processing distance-based queries in metric spaces , 2005, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[24]  Yannis Manolopoulos,et al.  R-Trees: Theory and Applications (Advanced Information and Knowledge Processing) , 2005 .

[25]  Kimmo Fredriksson,et al.  Exploiting distance coherence to speed up range queries in metric indexes , 2005, Inf. Process. Lett..

[26]  Gonzalo Navarro,et al.  A compact space decomposition for effective metric indexing , 2005, Pattern Recognit. Lett..

[27]  Bjørn Olstad,et al.  Retrieving Musical Information Based on Rhythm and Pitch Correlations , 2005 .

[28]  Ge Yu,et al.  BM+-Tree: A Hyperplane-Based Index Method for High-Dimensional Metric Spaces , 2005, DASFAA.

[29]  Jun Sakuma,et al.  Fast approximate similarity search in extremely high-dimensional data sets , 2005, 21st International Conference on Data Engineering (ICDE'05).

[30]  Diego Reforgiato Recupero,et al.  Antipole tree indexing to support range search and k-nearest neighbor search in metric spaces , 2005, IEEE Transactions on Knowledge and Data Engineering.

[31]  Edgar Chávez,et al.  Improving efficiency of implicit Markov chain state classification , 2004 .

[32]  Abraham Kandel,et al.  Data Mining in Time Series Database , 2004 .

[33]  Vlastislav Dohnal,et al.  An Access Structure for Similarity Search in Metric Spaces , 2004, EDBT Workshops.

[34]  Hanan Samet,et al.  Index-driven similarity search in metric spaces (Survey Article) , 2003, TODS.

[35]  Gonzalo Navarro,et al.  Improved deletions in dynamic spatial approximation trees , 2003, 23rd International Conference of the Chilean Computer Science Society, 2003. SCCC 2003. Proceedings..

[36]  Gonzalo Navarro,et al.  Memory-Adaptive Dynamic Spatial Approximation Trees , 2003, SPIRE.

[37]  G. Navarro,et al.  Fully dynamic and memory-adaptative spatial approximation trees , 2003 .

[38]  Václav Snásel,et al.  Revisiting M-Tree Building Principles , 2003, ADBIS.

[39]  Pavel Zezula,et al.  D-Index: Distance Searching Index for Metric Data Sets , 2003, Multimedia Tools and Applications.

[40]  Pavel Zezula,et al.  Similarity Join in Metric Spaces Using eD-Index , 2003, DEXA.

[41]  Juan Ramón Rico-Juan,et al.  Comparison of AESA and LAESA search algorithms using string and tree-edit-distances , 2003, Pattern Recognit. Lett..

[42]  Pavel Zezula,et al.  Region proximity in metric spaces and its use for approximate similarity search , 2003, TOIS.

[43]  Marco Patella,et al.  Searching in metric spaces with user-defined and approximate distances , 2002, TODS.

[44]  Vladimir Pestov,et al.  Indexing Schemes for Similarity Search: an Illustrated Paradigm , 2002, Fundam. Informaticae.

[45]  Christos Faloutsos,et al.  How to improve the pruning ability of dynamic metric access methods , 2002, CIKM '02.

[46]  Gonzalo Navarro,et al.  Fully Dynamic Spatial Approximation Trees , 2002, SPIRE.

[47]  Giuseppe Amato,et al.  Approximate similarity search in metric spaces , 2002 .

[48]  Chun Zhang,et al.  Storing and querying ordered XML using a relational database system , 2002, SIGMOD '02.

[49]  David R. Karger,et al.  Finding nearest neighbors in growth-restricted metrics , 2002, STOC '02.

[50]  E. Chavez,et al.  Pivot selection techniques for proximity searching in metric spaces , 2001, SCCC 2001. 21st International Conference of the Chilean Computer Science Society.

[51]  Gonzalo Navarro,et al.  Dynamic spatial approximation trees , 2001, SCCC 2001. 21st International Conference of the Chilean Computer Science Society.

[52]  Pavel Zezula,et al.  Similarity search in metric databases through hashing , 2001, MULTIMEDIA '01.

[53]  Beng Chin Ooi,et al.  Indexing the Distance: An Efficient Method to KNN Processing , 2001, VLDB.

[54]  Wenfei Fan,et al.  Keys with Upward Wildcards for XML , 2001, DEXA.

[55]  Ricardo A. Baeza-Yates,et al.  Searching in metric spaces , 2001, CSUR.

[56]  Adil Alpkocak,et al.  A Parallel Similarity Search in High Dimensional Metric Space Using M-Tree , 2001, IWCC.

[57]  Christos Faloutsos,et al.  Similarity search without tears: the OMNI-family of all-purpose access methods , 2001, Proceedings 17th International Conference on Data Engineering.

[58]  Gonzalo Navarro,et al.  An effective clustering algorithm to index high dimensional metric spaces , 2000, Proceedings Seventh International Symposium on String Processing and Information Retrieval. SPIRE 2000.

[59]  Ada Wai-Chee Fu,et al.  Dynamic vp-tree indexing for n-nearest neighbor search given pair-wise distances , 2000, The VLDB Journal.

[60]  Masahiro Ishikawa,et al.  MB+Tree: A Dynamically Updatable Metric Index for Similarity Searches , 2000, Web-Age Information Management.

[61]  Christos Faloutsos,et al.  Slim-Trees: High Performance Metric Trees Minimizing Overlap Between Nodes , 2000, EDBT.

[62]  Marco Patella,et al.  PAC nearest neighbor queries: Approximate and controlled search in high-dimensional and metric spaces , 2000, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073).

[63]  Christos Faloutsos,et al.  Distance Exponent: A New Concept for Selectivity Estimation in Metric Trees , 2000, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073).

[64]  Danilo Montesi,et al.  Imprecision and User Preferences in Multimedia Queries: A Generic Algebraic Approach , 2000, FoIKS.

[65]  Ricardo A. Baeza-Yates,et al.  Spaghettis: an array based algorithm for similarity queries in metric spaces , 1999, 6th International Symposium on String Processing and Information Retrieval. 5th International Workshop on Groupware (Cat. No.PR00268).

[66]  Gonzalo Navarro,et al.  Searching in metric spaces by spatial approximation , 1999, 6th International Symposium on String Processing and Information Retrieval. 5th International Workshop on Groupware (Cat. No.PR00268).

[67]  Z. Meral Özsoyoglu,et al.  Indexing large metric spaces for similarity search queries , 1999, TODS.

[68]  Jonathan Goldstein,et al.  When Is ''Nearest Neighbor'' Meaningful? , 1999, ICDT.

[69]  Malcolm P. Atkinson,et al.  Issues Raised by Three Years of Developing PJama: An Orthogonally Persistent Platform for Java , 1999, ICDT.

[70]  Pavel Zezula,et al.  Approximate similarity retrieval with M-trees , 1998, The VLDB Journal.

[71]  Pavel Zezula,et al.  A cost model for similarity queries in metric spaces , 1998, PODS '98.

[72]  Ronald Fagin,et al.  Fuzzy queries in multimedia database systems , 1998, PODS '98.

[73]  Pavel Zezula,et al.  Processing Complex Similarity Queries with Distance-Based Access Methods , 1998, EDBT.

[74]  Pavel Zezula,et al.  Processing M-trees with parallel resources , 1998, Proceedings Eighth International Workshop on Research Issues in Data Engineering. Continuous-Media Databases and Applications.

[75]  Pavel Zezula,et al.  M-tree: An Efficient Access Method for Similarity Search in Metric Spaces , 1997, VLDB.

[76]  Z. Meral Özsoyoglu,et al.  Distance-based indexing for high-dimensional metric spaces , 1997, SIGMOD '97.

[77]  BozkayaTolga,et al.  Distance-based indexing for high-dimensional metric spaces , 1997 .

[78]  Luisa Micó,et al.  A fast branch & bound nearest neighbour classifier in metric spaces , 1996, Pattern Recognit. Lett..

[79]  Juan Miguel Vilar,et al.  Reducing the Overhead of the AESA Metric-Space Nearest Neighbour Searching Algorithm , 1995, Inf. Process. Lett..

[80]  Sergey Brin,et al.  Near Neighbor Search in Large Metric Spaces , 1995, VLDB.

[81]  Christos Faloutsos,et al.  Estimating the Selectivity of Spatial Queries Using the 'Correlation' Fractal Dimension , 1995, VLDB.

[82]  Christos Faloutsos,et al.  FastMap: a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets , 1995, SIGMOD '95.

[83]  Tzi-cker Chiueh,et al.  Content-Based Image Indexing , 1994, VLDB.

[84]  Enrique Vidal,et al.  New formulation and improvements of the nearest-neighbour approximating and eliminating search algorithm (AESA) , 1994, Pattern Recognit. Lett..

[85]  Luisa Micó,et al.  A new version of the nearest-neighbour approximating and eliminating search algorithm (AESA) with linear preprocessing time and memory requirements , 1994, Pattern Recognit. Lett..

[86]  Hartmut Noltemeier,et al.  A Data Structure for Representing and Efficient Querying Large Scenes of Geometric Objects: MB* Trees , 1993, Geometric Modelling.

[87]  Jeffrey K. Uhlmann,et al.  Satisfying General Proximity/Similarity Queries with Metric Trees , 1991, Inf. Process. Lett..

[88]  Noltemeier Hartmut,et al.  Voronoi Trees and Applications , 1989 .

[89]  F. DEHNE,et al.  Voronoi trees and clustering problems , 1987, Inf. Syst..

[90]  Iraj Kalantari,et al.  A Data Structure and an Algorithm for the Nearest Point Problem , 1983, IEEE Transactions on Software Engineering.

[91]  Dieter Jungnickel,et al.  Graphs, Networks, and Algorithms , 1980 .

[92]  Eamonn J. Keogh.  Nearest Neighbor , 2010, Encyclopedia of Machine Learning.

[93]  P. Zezula,et al.  Metric Space , 2009, Encyclopedia of Database Systems.

[94]  Mária Bieliková,et al.  SOFSEM 2008: Theory and Practice of Computer Science, 34th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 19-25, 2008, Proceedings , 2008, SOFSEM.

[95]  Kimmo Fredriksson,et al.  Engineering efficient metric indexes , 2007, Pattern Recognit. Lett..

[96]  Wiebe van der Hoek,et al.  SOFSEM 2007: Theory and Practice of Computer Science , 2007 .

[97]  Jack Dongarra,et al.  Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27 - 30, 2007, Proceedings, Part III , 2007, ICCS.

[98]  Sumio Masuda,et al.  Improvements of TLAESA nearest neighbour search algorithm and extension to approximation search , 2006, ACSC.

[99]  Elena Deza,et al.  Dictionary of distances , 2006 .

[100]  Torsten Grust,et al.  Advances in database technology - EDBT 2006 : 10th International Conference on Extending Database Technology, Munich, Germany, March 2006; proceedings , 2006 .

[101]  A. Nanopoulos,et al.  R-Trees: Theory and Applications , 2005, Advanced Information and Knowledge Processing.

[102]  Gonzalo Navarro,et al.  Metric Databases , 2005, Encyclopedia of Database Technologies and Applications.

[103]  Jorge Horacio Doorn,et al.  Encyclopedia of Database Technologies and Applications , 2005 .

[104]  Alexander Gelbukh,et al.  MICAI 2005: Advances in Artificial Intelligence, 4th Mexican International Conference on Artificial Intelligence, Monterrey, Mexico, November 14-18, 2005, Proceedings , 2005, MICAI.

[105]  Pavel Zezula,et al.  Scalable Similarity Search in Metric Spaces , 2004, DELOS.

[106]  Nora Reyes,et al.  Spatial approximation + sequential scan = efficient metric indexing , 2004, XXIV International Conference of the Chilean Computer Science Society.

[107]  Tomás Skopal,et al.  Pivoting M-tree: A Metric Access Method for Efficient Similarity Search , 2004, DATESO.

[108]  Vlastislav Dohnal.  Indexing Structures for Searching in Metric Spaces , 2004 .

[109]  Wolfgang Lindner,et al.  Current Trends in Database Technology - EDBT 2004 Workshops, EDBT 2004 Workshops PhD, DataX, PIM, P2P&DB, and ClustWeb, Heraklion, Crete, Greece, March 14-18, 2004, Revised Selected Papers , 2004, EDBT Workshops.

[110]  Ge Yu,et al.  M+-tree : A New Dynamical Multidimensional Index for Metric Spaces , 2003, ADC.

[111]  B. Olstad.  Methods for retrieving musical information based on rythm and pitch correlations , 2003 .

[112]  Bertil Folliot,et al.  Advanced Environments, Tools, and Applications for Cluster Computing , 2002, Lecture Notes in Computer Science.

[113]  Pavel Zezula,et al.  Separable Splits of Metric Data Sets , 2001, SEBD.

[114]  Magnus Lie Hetland.  A Survey of Recent Methods for Efficient Retrieval of Similar Time Sequences , 2001 .

[115]  H. Samet,et al.  Incremental Similarity Search in Multimedia Databases , 2000 .

[116]  Peter C. Lockemann,et al.  Advances in Database Technology — EDBT 2000 , 2000, Lecture Notes in Computer Science.

[117]  Peter Yianilos,et al.  Excluded middle vantage point forests for nearest neighbor search , 1998 .

[118]  Isidro Ramos,et al.  Advances in Database Technology — EDBT'98 , 1998, Lecture Notes in Computer Science.

[119]  Hartmut Noltemeier,et al.  Geometric Modelling , 1998, Computing Supplement.

[120]  Pavel Zezula,et al.  Indexing Metric Spaces with M-Tree , 1997, SEBD.

[121]  Peter N. Yianilos,et al.  Data structures and algorithms for nearest neighbor search in general metric spaces , 1993, SODA '93.

[122]  Hartmut Noltemeier,et al.  Monotonous Bisector* Trees - A Tool for Efficient Partitioning of Complex Scenes of Geometric Objects , 1992, Data Structures and Efficient Algorithms.

[123]  B. Monien,et al.  Data structures and efficient algorithms , 1992, Lecture Notes in Computer Science.

[124]  Natashia Boland,et al.  An algorithm for solving quadratic network flow problems | NOVA. The University of Newcastle's Digital Repository , 1991 .

[125]  Enrique Vidal-Ruiz,et al.  An algorithm for finding nearest neighbours in (approximately) constant average time , 1986, Pattern Recognit. Lett..

[126]  Bernard M. E. Moret,et al.  DIMACS Series in Discrete Mathematics and Theoretical Computer Science Towards a Discipline of Experimental Algorithmics , 2022 .