709 search results - page 86 / 142 » Efficient Evaluation of All-Nearest-Neighbor Queries |
173
click to vote
CIKM
2006
Springer
15 years 9 months ago
2006
Springer
The wide adoption of XML has increased the interest of the database community on tree-structured data management techniques. Querying capabilities are provided through tree-patter...
167
click to vote
SIGMOD
2002
ACM
16 years 6 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...
184
click to vote
CIKM
2004
Springer
15 years 11 months ago
2004
Springer
Modern corporations operate in an extremely complex environment and strongly depend on all kinds of information resources across the enterprise. Unfortunately, with the growth of ...
304
click to vote
ICDE
2001
IEEE
16 years 7 months ago
2001
IEEE
In this paper, we develop a general framework for approximate nearest neighbor queries. We categorize the current approaches for nearest neighbor query processing based on either ...
171
click to vote
EDBTW
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. Algorithms for processing Structural Joins embody essential building blocks for XML query evaluation. Their design is a difficult task, because they have to satisfy many ...