Sciweavers

34 search results - page 4 / 7
» Approximate counting of inversions in a data stream
Sort
View
JCST
2008
175views more  JCST 2008»
13 years 7 months ago
Improved Approximate Detection of Duplicates for Data Streams Over Sliding Windows
Detecting duplicates in data streams is an important problem that has a wide range of applications. In general, precisely detecting duplicates in an unbounded data stream is not fe...
Hong Shen, Yu Zhang
ICDE
2006
IEEE
178views Database» more  ICDE 2006»
14 years 9 months ago
Characterizing and Exploiting Reference Locality in Data Stream Applications
In this paper, we investigate a new approach to process queries in data stream applications. We show that reference locality characteristics of data streams could be exploited in ...
Feifei Li, Ching Chang, George Kollios, Azer Besta...
ICDE
2005
IEEE
135views Database» more  ICDE 2005»
14 years 9 months ago
Finding (Recently) Frequent Items in Distributed Data Streams
We consider the problem of maintaining frequency counts for items occurring frequently in the union of multiple distributed data streams. Na?ive methods of combining approximate f...
Amit Manjhi, Vladislav Shkapenyuk, Kedar Dhamdhere...
ICDE
2008
IEEE
139views Database» more  ICDE 2008»
14 years 9 months ago
Simultaneous Equation Systems for Query Processing on Continuous-Time Data Streams
We introduce Pulse, a framework for processing continuous queries over models of continuous-time data, which can compactly and accurately represent many real-world activities and p...
Jennie Rogers, Olga Papaemmanouil, Ugur Çet...
ICDT
2009
ACM
147views Database» more  ICDT 2009»
14 years 8 months ago
The average-case complexity of counting distinct elements
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
David P. Woodruff