785 search results - page 126 / 157 » Efficient Processing of Top-k Queries in Uncertain Databases |
251
click to vote
VLDB
2008
ACM
16 years 5 months ago
2008
ACM
Abstract Existing spatiotemporal indexes suffer from either large update cost or poor query performance, except for the Bx -tree (the state-of-the-art), which consists of multiple ...
231
click to vote
SIGMOD
2009
ACM
16 years 5 months ago
2009
ACM
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
239
click to vote
SIGMOD
2006
ACM
16 years 5 months ago
2006
ACM
Exact computation for aggregate queries usually requires large amounts of memory ? constrained in data-streaming ? or communication ? constrained in distributed computation ? and ...
157
click to vote
FCSC
2008
15 years 5 months ago
2008
With the development of World Wide Web (WWW), storage and utilization of web data has become a big challenge for data management research community. Web data are essentially hetero...
254
click to vote
ICDE
2006
IEEE
16 years 7 months ago
2006
IEEE
Multi-dimensional data indexing has received much attention in a centralized database. However, not so much work has been done on this topic in the context of Peerto-Peer systems....