Sciweavers

41 search results - page 3 / 9
» Tight Lower Bounds for Query Processing on Streaming and Ext...
Sort
View
DEXA
2003
Springer
135views Database» more  DEXA 2003»
13 years 10 months ago
On the Optimality of Holistic Algorithms for Twig Queries
Streaming XML documents has many emerging applications. However, in this paper, we show that the restrictions imposed by data streaming are too restrictive for processing twig quer...
Byron Choi, Malika Mahoui, Derick Wood
SSDBM
2007
IEEE
105views Database» more  SSDBM 2007»
13 years 11 months ago
Window-Oblivious Join: A Data-Driven Memory Management Scheme for Stream Join
Memory management is a critical issue in stream processing involving stateful operators such as join. Traditionally, the memory requirement for a stream join is query-driven: a qu...
Ji Wu, Kian-Lee Tan, Yongluan Zhou
COCO
2009
Springer
131views Algorithms» more  COCO 2009»
13 years 11 months ago
A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
Joshua Brody, Amit Chakrabarti
WADS
2009
Springer
223views Algorithms» more  WADS 2009»
13 years 11 months ago
Fault Tolerant External Memory Algorithms
Abstract. Algorithms dealing with massive data sets are usually designed for I/O-efficiency, often captured by the I/O model by Aggarwal and Vitter. Another aspect of dealing with ...
Gerth Stølting Brodal, Allan Grønlun...
SIGMOD
2003
ACM
158views Database» more  SIGMOD 2003»
14 years 5 months ago
Processing Set Expressions over Continuous Update Streams
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In ...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...