96 search results - page 10 / 20 » A Cost Model and Index Architecture for the Similarity Join |
EDBT
2000
ACM
13 years 12 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...
SIGMOD
2002
ACM
14 years 7 months ago
2002
ACM
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
BROADNETS
2005
IEEE
14 years 1 months ago
2005
IEEE
—The peer-to-peer technology offers many advantages, but at the same time, it poses many novel challenges for the research community. Modern peer-to-peer systems are characterize...
WMPI
2004
ACM
14 years 1 months ago
2004
ACM
Abstract. The large and growing impact of memory hierarchies on overall system performance compels designers to investigate innovative techniques to improve memory-system efficienc...
KDD
2001
ACM
14 years 8 months ago
2001
ACM
The similarity join is an important operation for mining high-dimensional feature spaces. Given two data sets, the similarity join computes all tuples (x, y) that are within a dis...