486 search results - page 4 / 98 » Evaluating Top-k Queries over Web-Accessible Databases |
EDBT
2009
ACM
15 years 1 months ago
2009
ACM
We propose efficient techniques for processing various TopK count queries on data with noisy duplicates. Our method differs from existing work on duplicate elimination in two sign...
87
Voted
ICDE
2011
IEEE
14 years 1 months ago
2011
IEEE
—Despite the proliferation of work on XML keyword query, it remains open to support keyword query over probabilistic XML data. Compared with traditional keyword search, it is far...
66
Voted
WAIM
2004
Springer
15 years 2 months ago
2004
Springer
A top-N selection query against a relation is to find the N tuples that satisfy the query condition the best but not necessarily completely. In this paper, we propose a new method ...
181
click to vote
ICDE
2003
IEEE
15 years 11 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...
114
click to vote
EDBT
2002
ACM
15 years 9 months ago
2002
ACM
Applying meta search systems is a suitable method to support the user if there are many different services. Due to information splitting strategies of literature services existing ...