242 search results - page 25 / 49 » Fast Indexes and Algorithms for Set Similarity Selection Que... |
ICDE
2007
IEEE
14 years 1 months ago
2007
IEEE
Similarity search usually encounters a serious problem in the high dimensional space, known as the “curse of dimensionality”. In order to speed up the retrieval efficiency, p...
SAC
2006
ACM
14 years 1 months ago
2006
ACM
A fundamental problem in peer-to-peer networks is how to locate appropriate peers efficiently to answer a specific query request. This paper proposes a model in which semantically...
ICDE
2003
IEEE
14 years 8 months ago
2003
IEEE
XKeyword provides efficient keyword proximity queries on large XML graph databases. A query is simply a list of keywords and does not require any schema or query language knowledg...
SIGMOD
2012
ACM
11 years 10 months ago
2012
ACM
A relational database often yields a large set of tuples as the result of a query. Users browse this result set to find the information they require. If the result set is large, ...
EDBT
2000
ACM
13 years 11 months ago
2000
ACM
In high-dimensional query processing, the optimization of the logical page-size of index structures is an important research issue. Even very simple query processing techniques suc...