Data structures and algorithms for nearest neighbor search in general metric spaces
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Indexing large metric spaces for similarity search queries
ACM Transactions on Database Systems (TODS)
Similarity search in metric databases through hashing
MULTIMEDIA '01 Proceedings of the 2001 ACM workshops on Multimedia: multimedia information retrieval
ACM Computing Surveys (CSUR)
Fixed Queries Array: A Fast and Economical Data Structure for Proximity Searching
Multimedia Tools and Applications
Similarity Search without Tears: The OMNI Family of All-purpose Access Methods
Proceedings of the 17th International Conference on Data Engineering
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Indexing the Distance: An Efficient Method to KNN Processing
Proceedings of the 27th International Conference on Very Large Data Bases
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Generalized Search Trees for Database Systems
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
ACM Transactions on Database Systems (TODS)
M-Chord: a scalable distributed similarity search structure
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
On scalability of the similarity search in the world of peers
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
M-Grid: similarity searching in grid
P2PIR '06 Proceedings of the international workshop on Information retrieval in peer-to-peer networks
Nearest neighbor search in metric spaces through Content-Addressable Networks
Information Processing and Management: an International Journal
A digital rights aware similarity measure for multimedia documents
Workshop on multimedia information retrieval on The many faces of multimedia semantics
Unified framework for fast exact and approximate search in dissimilarity spaces
ACM Transactions on Database Systems (TODS)
Nearest neighbor search in metric spaces through Content-Addressable Networks
Information Processing and Management: an International Journal
Dynamic spatial approximation trees
Journal of Experimental Algorithmics (JEA)
Efficient online top-K retrieval with arbitrary similarity measures
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
ACM Transactions on Database Systems (TODS)
Scalability comparison of Peer-to-Peer similarity search structures
Future Generation Computer Systems
Using Genetic Algorithm to Balance the D-Index Algorithm for Metric Search
Neural Information Processing
Improving the space cost of k-NN search in metric spaces by using distance estimators
Multimedia Tools and Applications
Solving similarity joins and range queries in metric spaces with the list of twin clusters
Journal of Discrete Algorithms
A unified inverted index for an efficient image and text retrieval
Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval
Efficient Similarity Search by Reducing I/O with Compressed Sketches
SISAP '09 Proceedings of the 2009 Second International Workshop on Similarity Search and Applications
Metric Index: An Efficient and Scalable Solution for Similarity Search
SISAP '09 Proceedings of the 2009 Second International Workshop on Similarity Search and Applications
Dynamic Spatial Approximation Trees for Massive Data
SISAP '09 Proceedings of the 2009 Second International Workshop on Similarity Search and Applications
Maximal metric margin partitioning for similarity search indexes
Proceedings of the 18th ACM conference on Information and knowledge management
New prune rules for similarity search
ASC '07 Proceedings of The Eleventh IASTED International Conference on Artificial Intelligence and Soft Computing
AdaIndex: An Adaptive Index Structure for Fast Similarity Search in Metric Spaces
ICONIP '09 Proceedings of the 16th International Conference on Neural Information Processing: Part II
Effectiveness of NAQ-tree as index structure for similarity search in high-dimensional metric space
Knowledge and Information Systems
Similarity join in metric spaces
ECIR'03 Proceedings of the 25th European conference on IR research
Querying similarity in metric social networks
NBiS'07 Proceedings of the 1st international conference on Network-based information systems
MESSIF: metric similarity search implementation framework
DELOS'07 Proceedings of the 1st international conference on Digital libraries: research and development
A content-addressable network for similarity search in metric spaces
DBISP2P'05/06 Proceedings of the 2005/2006 international conference on Databases, information systems, and peer-to-peer computing
International Journal of Intelligent Systems Technologies and Applications
Real-life performance of metric searching
SIGSPATIAL Special
Pivot selection method for optimizing both pruning and balancing in metric space indexes
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part II
Finding the k-closest pairs in metric spaces
Proceedings of the 1st Workshop on New Trends in Similarity Search
Empirical evaluation of excluded middle vantage point forest on biological sequences workload
Proceedings of the 1st Workshop on New Trends in Similarity Search
On nonmetric similarity search problems in complex domains
ACM Computing Surveys (CSUR)
Recursive lists of clusters: a dynamic data structure for range queries in metric spaces
ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
On fast non-metric similarity search by metric access methods
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
On the configuration of the similarity search data structure d-index for high dimensional objects
ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part III
A scalable nearest neighbor search in p2p systems
DBISP2P'04 Proceedings of the Second international conference on Databases, Information Systems, and Peer-to-Peer Computing
An access structure for similarity search in metric spaces
EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology
Modified LSI model for efficient search by metric access methods
ECIR'05 Proceedings of the 27th European conference on Advances in Information Retrieval Research
Similarity grid for searching in metric spaces
DELOS'04 Proceedings of the 6th Thematic conference on Peer-to-Peer, Grid, and Service-Orientation in Digital Library Architectures
Multi feature indexing network MUFIN for similarity search applications
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Generalizing the k-Windows clustering algorithm in metric spaces
Mathematical and Computer Modelling: An International Journal
On Combining Sequence Alignment and Feature-Quantization for Sub-Image Searching
International Journal of Multimedia Data Engineering & Management
| Hi-index | 0.00 |
In order to speedup retrieval in large collections of data, index structures partition the data into subsets so that query requests can be evaluated without examining the entire collection. As the complexity of modern data types grows, metric spaces have become a popular paradigm for similarity retrieval. We propose a new index structure, called D-Index, that combines a novel clustering technique and the pivot-based distance searching strategy to speed up execution of similarity range and nearest neighbor queries for large files with objects stored in disk memories. We have qualitatively analyzed D-Index and verified its properties on actual implementation. We have also compared D-Index with other index structures and demonstrated its superiority on several real-life data sets. Contrary to tree organizations, the D-Index structure is suitable for dynamic environments with a high rate of delete/insert operations.