785 search results - page 94 / 157 » Efficient Processing of Top-k Queries in Uncertain Databases |
130
click to vote
ICDE
1993
IEEE
15 years 8 months ago
1993
IEEE
Emerging database application domains demand not only new functionality but also high performance. To satisfy these two requirements, the Volcano project provides efficient, exten...
234
click to vote
VLDB
2005
ACM
16 years 4 months ago
2005
ACM
With the recent advances in wireless networks, embedded systems and GPS technology, databases that manage the location of moving objects have received increased interest. In this ...
225
click to vote
SIGMOD
2007
ACM
16 years 4 months ago
2007
ACM
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
249
click to vote
ICDE
2006
IEEE
16 years 6 months ago
2006
IEEE
We consider the problem of creating a sample view of a database table. A sample view is an indexed, materialized view that permits efficient sampling from an arbitrary range query...
237
click to vote
ICDE
2005
IEEE
16 years 6 months ago
2005
IEEE
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...