Sciweavers

13 search results - page 2 / 3
» On the Value of Multiple Read Write Streams for Data Compres...
Sort
View
IPPS
2007
IEEE
14 years 17 days ago
Storage Optimization for Large-Scale Distributed Stream Processing Systems
We consider storage in an extremely large-scale distributed computer system designed for stream processing applications. In such systems, incoming data and intermediate results ma...
Kirsten Hildrum, Fred Douglis, Joel L. Wolf, Phili...
STOC
2007
ACM
142views Algorithms» more  STOC 2007»
14 years 6 months ago
Lower bounds for randomized read/write stream algorithms
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
Paul Beame, T. S. Jayram, Atri Rudra
SIGMOD
2004
ACM
154views Database» more  SIGMOD 2004»
14 years 6 months ago
Compressing Historical Information in Sensor Networks
We are inevitably moving into a realm where small and inexpensive wireless devices would be seamlessly embedded in the physical world and form a wireless sensor network in order t...
Antonios Deligiannakis, Yannis Kotidis, Nick Rouss...
PODC
1990
ACM
13 years 10 months ago
Composite Registers
We introduce a shared data object, called a composite register, that generalizes the notion of an atomic register. A composite register is an array-like shared data object that is...
James H. Anderson
DBKDA
2010
IEEE
169views Database» more  DBKDA 2010»
13 years 11 months ago
XLeaf: Twig Evaluation with Skipping Loop Joins and Virtual Nodes
Abstract—XML indexing and search has become an important topic, and twig joins are key building blocks in XML search systems. This paper describes a novel approach using a nested...
Nils Grimsmo, Truls Amundsen Bjørklund, &Os...