Sciweavers

1782 search results - page 175 / 357
» Processing Queries over Distributed XML Databases
Sort
View
PODS
2006
ACM
217views Database» more  PODS 2006»
14 years 10 months ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
Lap-Kei Lee, H. F. Ting
DMSN
2005
ACM
14 years 9 days ago
The threshold join algorithm for top-k queries in distributed sensor networks
In this paper we present the Threshold Join Algorithm (TJA), which is an efficient TOP-k query processing algorithm for distributed sensor networks. The objective of a top-k query...
Demetrios Zeinalipour-Yazti, Zografoula Vagena, Di...
ICDE
2008
IEEE
176views Database» more  ICDE 2008»
14 years 11 months ago
Automatic Result Verification for the Functional Testing of a Query Language
Functional testing of a query language is a challenging task in practice. In order to reveal errors in the query processing functionality, it is necessary to verify the actual res...
Carsten Binnig, Donald Kossmann, Eric Lo, Angel Sa...
VLDB
2004
ACM
113views Database» more  VLDB 2004»
14 years 3 months ago
Resource Sharing in Continuous Sliding-Window Aggregates
We consider the problem of resource sharing when processing large numbers of continuous queries. We specifically address sliding-window aggregates over data streams, an important...
Arvind Arasu, Jennifer Widom
VLDB
2004
ACM
180views Database» more  VLDB 2004»
14 years 3 months ago
Bloom Histogram: Path Selectivity Estimation for XML Data with Updates
Cost-based XML query optimization calls for accurate estimation of the selectivity of path expressions. Some other interactive and internet applications can also benefit from suc...
Wei Wang 0011, Haifeng Jiang, Hongjun Lu, Jeffrey ...