486 search results - page 60 / 98 » Evaluating Top-k Queries over Web-Accessible Databases |
SIGMOD
2003
ACM
16 years 1 months ago
2003
ACM
We discuss the design of an acquisitional query processor for data collection in sensor networks. Acquisitional issues are those that pertain to where, when, and how often data is...
102
click to vote
PVLDB
2010
14 years 12 months ago
2010
We consider the problem of efficiently finding the top-k answers for join queries over web-accessible databases. Classical algorithms for finding top-k answers use branch-and-b...
133
click to vote
ICDT
2010
ACM
15 years 11 months ago
2010
ACM
The work reported here lays the foundations of data exchange in the presence of probabilistic data. This requires rethinking the very basic concepts of traditional data exchange, ...
117
Voted
DEXA
2005
Springer
15 years 7 months ago
2005
Springer
Finding all the occurrences of a twig pattern in an XML database is a core operation for efficient evaluation of XML queries. Holistic twig join algorithm has showed its superiorit...
117
click to vote
DASFAA
2008
IEEE
15 years 8 months ago
2008
IEEE
State-of-the-art Peer-to-Peer Information Retrieval (P2P IR) systems suffer from their lack of response time guarantee especially with scale. To address this issue, a number of tec...