406 search results - page 4 / 82 » A Cost Model for Similarity Queries in Metric Spaces |
SBBD
2004
13 years 8 months ago
2004
In order to index text fields in XML databases for similarity queries, M-Trees may be applied. However, some datasets experiments using M-Trees for this purpose resulted in low qu...
DEXAW
2008
IEEE
14 years 1 months ago
2008
IEEE
— One of the critical issues in search engines is the size of search indexes: as the number of documents handled by an engine increases, the search must preserve its efficiency,...
ICDE
2010
IEEE
14 years 7 months ago
2010
IEEE
1 We consider the problem of similarity search in applications where the cost of computing the similarity between two records is very expensive, and the similarity measure is not a...
VLDB
1997
ACM
13 years 11 months ago
1997
ACM
A new access method, called M-tree, is proposed to organize and search large data sets from a generic "metric space", i.e. where object proximity is only defined by a di...
EUROCAST
2005
Springer
2005
Springer
Similarity Queries in Data Bases Using Metric Distances - from Modeling Semantics to Its Maintenance
14 years 1 months ago
Similarity queries in traditional databases work directly on attribute values. But, often similar attribute values do not indicate similar meanings. Semantic background information...