Sciweavers

429 search results - page 70 / 86
» Query Planning for Continuous Aggregation Queries over a Net...
Sort
View
SSD
2007
Springer
150views Database» more  SSD 2007»
14 years 1 months ago
Online Amnesic Summarization of Streaming Locations
Abstract. Massive data streams of positional updates become increasingly difficult to manage under limited memory resources, especially in terms of providing near real-time respons...
Michalis Potamias, Kostas Patroumpas, Timos K. Sel...
EWSN
2004
Springer
14 years 7 months ago
ACE: An Emergent Algorithm for Highly Uniform Cluster Formation
The efficient subdivision of a sensor network into uniform, mostly non-overlapping clusters of physically close nodes is an important building block in the design of efficient uppe...
Haowen Chan, Adrian Perrig
SIGMOD
2005
ACM
100views Database» more  SIGMOD 2005»
14 years 7 months ago
A Disk-Based Join With Probabilistic Guarantees
One of the most common operations in analytic query processing is the application of an aggregate function to the result of a relational join. We describe an algorithm for computi...
Chris Jermaine, Alin Dobra, Subramanian Arumugam, ...
ICDE
2009
IEEE
139views Database» more  ICDE 2009»
14 years 9 months ago
Minimizing Communication Cost in Distributed Multi-query Processing
Increasing prevalence of large-scale distributed monitoring and computing environments such as sensor networks, scientific federations, Grids etc., has led to a renewed interest in...
Jian Li, Amol Deshpande, Samir Khuller
ICDE
2006
IEEE
201views Database» more  ICDE 2006»
14 years 9 months ago
Approximate Data Collection in Sensor Networks using Probabilistic Models
Wireless sensor networks are proving to be useful in a variety of settings. A core challenge in these networks is to minimize energy consumption. Prior database research has propo...
David Chu, Amol Deshpande, Joseph M. Hellerstein, ...