50,211 Hits in 4.2 sec

Indexing large metric spaces for similarity search queries

Tolga Bozkaya, Meral Ozsoyoglu
1999 ACM Transactions on Database Systems  
In this paper we consider using distance-based index structures for similarity queries on large metric spaces.  ...  For example, given an image database, one may want to retrieve all images that are similar to a given query image.  ...  Because of (8), Y cannot be in the query result, which means that we do not have to check any object in the left branch.  ... 
doi:10.1145/328939.328959 fatcat:k2xqxbkqbrcl7kofz6taps7n6a

Affinity Hybrid Tree: An Indexing Technique for Content-Based Image Retrieval in Multimedia Databases

Kasturi Chatterjee, Shu-ching Chen
2006 Eighth IEEE International Symposium on Multimedia (ISM'06)  
Algorithms for similarity (range and k-nearest neighbor) queries are implemented.  ...  AH-Tree combines Space-Based and Distance-Based indexing techniques to form a hybrid structure which is efficient in terms of computational overhead and fairly accurate in producing query results close  ...  Acknowledgment For Shu-Ching Chen, this research was supported in part by NSF EIA-0220562 and HRD-0317692. We would like to thank Dr.  ... 
doi:10.1109/ism.2006.21 dblp:conf/ism/ChatterjeeC06 fatcat:dna6ncuakvfffpndwbw5o4obie

Metric Trees for Efficient Similarity Search in Large Process Model Repositories [chapter]

Matthias Kunze, Mathias Weske
2011 Lecture Notes in Business Information Processing  
This paper presents an indexing approach based on metric trees, a hierarchical search structure that saves comparison operations during search with nothing but a distance function at hand.  ...  However, due to performance reasons, an exhaustive similarity search by pairwise comparison is not feasible in large process model repositories.  ...  compare a given query model with a model from the repository is applicable if it yields a metric, cf. Definition 1. Other aspects of process model search, cf.  ... 
doi:10.1007/978-3-642-20511-8_49 fatcat:phkwehtfa5gfxi7ade4sic3pyi

A Landmark-based Index Architecture for General Similarity Search in Peer-to-Peer Networks

Xiaoyu Yang, Yiming Hu
2007 2007 IEEE International Parallel and Distributed Processing Symposium  
In this paper, we propose a scalable index architecture built on top of distributed hash tables (DHT), to support similarity search in the general metric space.  ...  The indexing of complex data and similarity search plays an important role in many application areas.  ...  For instance, the following six examples satisfy the model of searching near neighbors in the metric space: (1) searching similar DNA or protein sequences in a large genetics database; (2) searching similar  ... 
doi:10.1109/ipdps.2007.370230 dblp:conf/ipps/YangH07 fatcat:bwpdau5cfvfltnxuzunvzgja6i

Em-K Indexing for Approximate Query Matching in Large-scale ER [article]

Samudra Herath, Matthew Roughan, Gary Glonek
2021 arXiv   pre-print
Indexing or blocking techniques reduce the search space and execution time in the ER process. However, approximate indexing techniques that scale to very large-scale datasets remain open to research.  ...  In this paper, we investigate the query matching problem in ER to propose an indexing method suitable for approximate and efficient query matching.  ...  We can apply several k-NN search methods for indexing arbitrary metric spaces; for more details, refer to the surveys [5, 15] .  ... 
arXiv:2111.04070v1 fatcat:4ci3l6tczfdn5j32cv42lba2ai

Non-metric similarity search problems in very large collections

Benjamin Bustos, Tomas Skopal
2011 2011 IEEE 27th International Conference on Data Engineering  
Thank you for your attention! … questions? ICDE 2011, Hannover, Germany  ...  ) Proteins to compare ICDE 2011, Hannover, Germany Indexing non-metric spaces -framework Need to search efficiently (fast query processing) Access methods / indexes for similarity search Framework  ...  ICDE 2011, Hannover, Germany Indexing non-metric spaces -specific NAMExample -inverted file and cosine similarity Efficient query processing Visit only lists of terms having nonzero weights in query  ... 
doi:10.1109/icde.2011.5767955 dblp:conf/icde/BustosS11 fatcat:rllzyyp6hfgcrjho3slo76tewm

Indexing Dense Nested Metric Spaces for Efficient Similarity Search [chapter]

Nieves R. Brisaboa, Miguel R. Luaces, Oscar Pedreira, Ángeles S. Places, Diego Seco
2010 Lecture Notes in Computer Science  
Searching in metric spaces is a very active field since it offers methods for indexing and searching by similarity in collections of unstructured data.  ...  It has been shown that the way the references are selected affects the search performance, and several algorithms for good reference selection have been proposed.  ...  Similarity search can be formalized through the concept of metric space.  ... 
doi:10.1007/978-3-642-11486-1_9 fatcat:jhgvcyv5izc6nohmcxort5l7t4

Distinct nearest neighbors queries for similarity search in very large multimedia databases

Tomáš Skopal, Vlastislav Dohnal, Michal Batko, Pavel Zezula
2009 Proceeding of the eleventh international workshop on Web information and data management - WIDM '09  
The most popular retrieval concept is the k nearest neighbor (kNN) search. For a long time, the kNN queries provided an effective retrieval in multimedia databases.  ...  As the volume of multimedia data available on internet is tremendously increasing, the content-based similarity search becomes a popular approach to multimedia retrieval.  ...  METRIC SPACE MODEL OF SIMILAR-ITY SEARCH In the past two decades, the metric space model of similarity has been established as a suitable framework for efficient similarity search in complex and unstructured  ... 
doi:10.1145/1651587.1651592 dblp:conf/widm/SkopalDBZ09 fatcat:fibysdzszvbqjlyvypyneslqzu

A geometric framework for modelling similarity search

V. Pestov
1999 Proceedings. Tenth International Workshop on Database and Expert Systems Applications. DEXA 99  
The aim of this paper is to propose a geometric framework for modelling similarity search in large and multidimensional data spaces of general nature, which seems to be flexible enough to address such  ...  Such a framework is provided by the concept of the so-called similarity workload, which is a probability metric space Ω (query domain) with a distinguished finite subspace X (dataset), together with an  ...  This could well be the case with the technique of metric transform as applied to histogram indexing for image search by colour content.  ... 
doi:10.1109/dexa.1999.795158 dblp:conf/dexaw/Pestov99 fatcat:ldwfkc7l4zddpmfabgl7dztxyq

Applying metric space and pivot-based indexing on combined features of bio-images for fast execution of composite queries

Meenakshi Srivastava, S.K. Singh, S.Q. Abbas
2018 International Journal of Engineering & Technology  
Results have demonstrated that pivot based ordering/ indexing on Combined Index Metric can undoubtedly execute composite content construct queries with respect to bio images in time effective way.  ...  In present manuscript, visual highlights of 3D protein structures and their content highlights have been implemented in isolated metric space, rather than vector space which advances the similarity recovery  ...  The Combined Index Metric space which is created via element based product metric of feature metric and content metric can retrieve the result easily for the queries which involve feature and content based  ... 
doi:10.14419/ijet.v7i1.9009 fatcat:rlciuspvbnhcdemp6lkngci6cm

Fundamentals of the problem

Edgar Chávez, Gonzalo Navarro
2010 SIGSPATIAL Special  
In a metric space coordinates are not necessarily present, thus most of the algorithms designed for coordinate spaces do not apply directly.  ...  The most basic ones are (a) range query (q, r), for q ∈ X and r ∈ R + , returns {u ∈ U, d(q, u) ≤ r}, the dataset objects at distance within r of q; and (b) k-nearest neighbor query nn(q, k), for k ∈ N  ...  Then it refers to the nested loop, where each element of a set is searched for in the other set using an index, as the basic technique, which misses opportunities for optimization due to similar queries  ... 
doi:10.1145/1862413.1862415 fatcat:m76assblozac7afs64r62avaca

Maximal metric margin partitioning for similarity search indexes

Hisashi Kurasawa, Daiji Fukagawa, Atsuhiro Takasu, Jun Adachi
2009 Proceeding of the 18th ACM conference on Information and knowledge management - CIKM '09  
We propose a partitioning scheme for similarity search indexes that is called Maximal Metric Margin Partitioning (MMMP).  ...  MMMP is the first similarity search index approach to focus on partitioning surfaces and data distribution patterns.  ...  INTRODUCTION A similarity search efficiently finds objects that are similar to a query from a large dataset [10] .  ... 
doi:10.1145/1645953.1646256 dblp:conf/cikm/KurasawaFTA09 fatcat:gzzqvfk2vvfhbgzfyta7xtw6hq

Speeding Up Permutation Based Indexing with Indexing

Karina Figueroa, Kimmo Frediksson
2009 2009 Second International Workshop on Similarity Search and Applications  
A recent probabilistic approach for searching in high dimensional metric spaces is based on predicting the distances between database elements according to how they order their distances towards some set  ...  When a query is given, its corresponding permutation is computed, and -as similar elements will (probably) have a similar permutation -the database is compared in the order induced by the similarity between  ...  ACKNOWLEDGMENT We wish to thank the anonymous reviewers for many helpful comments This work was partially supported by CONACyT (Mexico).  ... 
doi:10.1109/sisap.2009.12 dblp:conf/sisap/FigueroaF09 fatcat:ym7bbxzmfvhldmkoxuulumbuwu

A Learned Index for Exact Similarity Search in Metric Spaces [article]

Yao Tian, Tingyun Yan, Xi Zhao, Kai Huang, Xiaofang Zhou
2022 arXiv   pre-print
However, accurate and efficient similarity query processing in high-dimensional metric spaces remains to be an open challenge.  ...  in metric spaces.  ...  The learned Fig. 1 : LIMS index structure index for exact similarity search in metric spaces is to learn an index structure for P so that point query, range query and kNN query can be processed efficiently  ... 
arXiv:2204.10028v1 fatcat:yvfrjifgh5ajhmuzufysabh6l4

Approximate Similarity Search in Genomic Sequence Databases Using Landmark-Guided Embedding

Ahmet Sacan, I. Hakki Toroslu
2008 First International Workshop on Similarity Search and Applications (sisap 2008)  
In this study, we present a metric-preserving, landmark-guided embedding approach to represent sequences in the vector domain in order to allow efficient indexing and similarity search.  ...  As the size of the genomic databases increases, similarity search of proteins in these databases becomes a bottle-neck in large-scale studies, calling for more efficient methods of content-based retrieval  ...  We would also like thank the anonymous reviewers for their critical analysis of and corrections to the manuscript.  ... 
doi:10.1109/sisap.2008.7 dblp:conf/sisap/SacanT08 fatcat:7ugcpjegojg3rh4irqgmxuy22q
« Previous Showing results 1 — 15 out of 50,211 results