Sciweavers

96 search results - page 16 / 20
» Load Shedding for Aggregation Queries over Data Streams
Sort
View
ICDE
2007
IEEE
174views Database» more  ICDE 2007»
15 years 3 months ago
Adapting Partitioned Continuous Query Processing in Distributed Systems
Partitioned query processing is an effective method to process continuous queries with large stateful operators in a distributed systems. This method typically partitions input da...
Yali Zhu, Elke A. Rundensteiner
DEBS
2009
ACM
14 years 10 months ago
Towards efficient event aggregation in a decentralized publish-subscribe system
Recently, decentralized publish-subscribe (pub-sub) systems have gained popularity as a scalable asynchronous messaging paradigm over wide-area networks. Most existing pub-sub sys...
Jianxia Chen, Lakshmish Ramaswamy, David Lowenthal
SSDBM
2003
IEEE
196views Database» more  SSDBM 2003»
15 years 2 months ago
Stream Window Join: Tracking Moving Objects in Sensor-Network Databases
The widespread use of sensor networks presents revolutionary opportunities for life and environmental science applications. Many of these applications involve continuous queries t...
Moustafa A. Hammad, Walid G. Aref, Ahmed K. Elmaga...
VLDB
2004
ACM
128views Database» more  VLDB 2004»
15 years 9 months ago
Operator scheduling in data stream systems
In many applications involving continuous data streams, data arrival is bursty and data rate fluctuates over time. Systems that seek to give rapid or realtime query responses in su...
Brian Babcock, Shivnath Babu, Mayur Datar, Rajeev ...
SSD
2007
Springer
243views Database» more  SSD 2007»
15 years 3 months ago
Continuous Medoid Queries over Moving Objects
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...