242 search results - page 5 / 49 » Fast Indexes and Algorithms for Set Similarity Selection Que... |
ICDE
2011
IEEE
13 years 4 days ago
2011
IEEE
— An approximate string query is to find from a collection of strings those that are similar to a given query string. Answering such queries is important in many applications su...
EDBT
2006
ACM
14 years 8 months ago
2006
ACM
Abstract. Many different index structures have been proposed for spatial databases to support efficient query processing. However, most of these index structures suffer from an exp...
AAAI
2010
13 years 10 months ago
2010
Top-k approximate querying on string collections is an important data analysis tool for many applications, and it has been exhaustively studied. However, the scale of the problem ...
VLDB
2007
ACM
14 years 8 months ago
2007
ACM
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
WEBI
2009
Springer
14 years 3 months ago
2009
Springer
All pairs similarity search is the problem of finding all pairs of records that have a similarity score above the specified threshold. Many real-world systems like search engine...