709 search results - page 97 / 142 » Efficient Evaluation of All-Nearest-Neighbor Queries |
206
click to vote
SIGMOD
2003
ACM
16 years 6 months ago
2003
ACM
We consider the problem of efficiently producing ranked results for keyword search queries over hyperlinked XML documents. Evaluating keyword search queries over hierarchical XML ...
271
click to vote
ICDE
2005
IEEE
16 years 7 months ago
2005
IEEE
Given a region qR and a future timestamp qT, a "range aggregate" query estimates the number of objects expected to appear in qR at time qT. Currently the only methods fo...
136
click to vote
ICPP
2007
IEEE
16 years 5 days ago
2007
IEEE
—By combining an unstructured protocol with a DHT-based global index, hybrid peer-to-peer (P2P) improves search efficiency in terms of query recall and response time. The major c...
162
click to vote
CIKM
2006
Springer
15 years 9 months ago
2006
Springer
Skyline queries compute the set of Pareto-optimal tuples in a relation, i.e., those tuples that are not dominated by any other tuple in the same relation. Although several algorit...
150
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
In recent years, the significant growth of RDF data used in numerous applications has made its efficient and scalable manipulation an important issue. In this paper, we present RD...