Sciweavers

1552 search results - page 238 / 311
» Efficient Aggregate Computation over Data Streams
Sort
View
SIGMOD
2002
ACM
236views Database» more  SIGMOD 2002»
14 years 11 months ago
The Cougar Approach to In-Network Query Processing in Sensor Networks
The widespread distribution and availability of smallscale sensors, actuators, and embedded processors is transforming the physical world into a computing platform. One such examp...
Yong Yao, Johannes Gehrke
SIGMOD
2007
ACM
145views Database» more  SIGMOD 2007»
14 years 11 months ago
Why off-the-shelf RDBMSs are better at XPath than you might expect
To compensate for the inherent impedance mismatch between the relational data model (tables of tuples) and XML (ordered, unranked trees), tree join algorithms have become the prev...
Torsten Grust, Jan Rittinger, Jens Teubner
COLCOM
2007
IEEE
14 years 5 months ago
Cooperative security in distributed sensor networks
— Distributed sensor network protocols, such as routing, time synchronization or data aggregation protocols make use of collaborative techniques to minimize the consumption of sc...
Oscar García Morchon, Heribert Baldus, Tobi...
SIGMOD
2010
ACM
132views Database» more  SIGMOD 2010»
13 years 6 months ago
Durable top-k search in document archives
We propose and study a new ranking problem in versioned databases. Consider a database of versioned objects which have different valid instances along a history (e.g., documents i...
Leong Hou U, Nikos Mamoulis, Klaus Berberich, Srik...
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
14 years 3 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve