86 search results - page 6 / 18 » Efficient querying of distributed provenance stores |
164
click to vote
ICDE
2005
IEEE
15 years 11 months ago
2005
IEEE
We consider the problem of efficiently computing the skyline against the most recent N elements in a data stream seen so far. Specifically, we study the n-of-N skyline queries; th...
104
click to vote
DGCI
2000
Springer
15 years 1 months ago
2000
Springer
We consider the problem of finding the best match for a given query shape among candidate shapes stored in a shape base. This is central to a wide range of applications, such as, d...
SIGMOD
2004
ACM
15 years 9 months ago
2004
ACM
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
177
click to vote
VLDB
2007
ACM
15 years 9 months ago
2007
ACM
This paper addresses the efficient processing of similarity queries in metric spaces, where data is horizontally distributed across a P2P network. The proposed approach does not r...
EDBT
2008
ACM
15 years 9 months ago
2008
ACM
Scientific data are available through an increasing number of heterogeneous, independently evolving, sources. Although the sources themselves are independently evolving, the data ...