Sciweavers

101 search results - page 2 / 21
» Processing Complex Similarity Queries with Distance-Based Ac...
Sort
View
DKE
2007
107views more  DKE 2007»
13 years 5 months ago
A clustering method based on path similarities of XML data
Current studies on the storage of XML data are focused on either the efficient mapping of XML data onto an existing RDBMS or the development of a native XML storage. Some native X...
Il-Hwan Choi, Bongki Moon, Hyoung-Joo Kim
PVLDB
2010
121views more  PVLDB 2010»
13 years 3 days ago
Efficient RkNN Retrieval with Arbitrary Non-Metric Similarity Measures
A RkNN query returns all objects whose nearest k neighbors contain the query object. In this paper, we consider RkNN query processing in the case where the distances between attri...
Deepak P, Prasad Deshpande
DASFAA
2008
IEEE
149views Database» more  DASFAA 2008»
13 years 11 months ago
Index-Supported Similarity Search Using Multiple Representations
Similarity search in complex databases is of utmost interest in a wide range of application domains. Often, complex objects are described by several representations. The combinatio...
Johannes Aßfalg, Michael Kats, Hans-Peter Kr...
PODS
1998
ACM
152views Database» more  PODS 1998»
13 years 9 months ago
A Cost Model for Similarity Queries in Metric Spaces
We consider the problem of estimating CPU (distance computations) and I/O costs for processing range and k-nearest neighbors queries over metric spaces. Unlike the specific case ...
Paolo Ciaccia, Marco Patella, Pavel Zezula
DEXA
2009
Springer
222views Database» more  DEXA 2009»
13 years 12 months ago
On Index-Free Similarity Search in Metric Spaces
Metric access methods (MAMs) serve as a tool for speeding similarity queries. However, all MAMs developed so far are index-based; they need to build an index on a given database. T...
Tomás Skopal, Benjamin Bustos