Sciweavers

540 search results - page 28 / 108
» Continuous Queries over Data Streams
Sort
View
ICDE
2005
IEEE
173views Database» more  ICDE 2005»
14 years 10 months ago
Stabbing the Sky: Efficient Skyline Computation over Sliding Windows
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...
Xuemin Lin, Yidong Yuan, Wei Wang 0011, Hongjun Lu
PODS
2002
ACM
136views Database» more  PODS 2002»
14 years 9 months ago
Models and Issues in Data Stream Systems
In this overview paper we motivate the need for and research issues arising from a new model of data processing. In this model, data does not take the form of persistent relations...
Brian Babcock, Shivnath Babu, Mayur Datar, Rajeev ...
ICDE
2006
IEEE
179views Database» more  ICDE 2006»
14 years 10 months ago
Distributed Evaluation of Continuous Equi-join Queries over Large Structured Overlay Networks
We study the problem of continuous relational query processing in Internet-scale overlay networks realized by distributed hash tables. We concentrate on the case of continuous two...
Stratos Idreos, Christos Tryfonopoulos, Manolis Ko...
ICDE
2011
IEEE
262views Database» more  ICDE 2011»
13 years 7 days ago
Memory-constrained aggregate computation over data streams
— In this paper, we study the problem of efficiently computing multiple aggregation queries over a data stream. In order to share computation, prior proposals have suggested ins...
K. V. M. Naidu, Rajeev Rastogi, Scott Satkin, Anan...
SIGMOD
2007
ACM
164views Database» more  SIGMOD 2007»
14 years 9 months ago
Fast data stream algorithms using associative memories
The primary goal of data stream research is to develop space and time efficient solutions for answering continuous online summarization queries. Research efforts over the last dec...
Nagender Bandi, Ahmed Metwally, Divyakant Agrawal,...