Sciweavers

45 search results - page 5 / 9
» On the Memory Requirements of XPath Evaluation over XML Stre...
Sort
View
STOC
2007
ACM
142views Algorithms» more  STOC 2007»
14 years 8 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
SSDBM
2007
IEEE
104views Database» more  SSDBM 2007»
14 years 2 months ago
Reservoir Sampling over Memory-Limited Stream Joins
In stream join processing with limited memory, uniform random sampling is useful for approximate query evaluation. In this paper, we address the problem of reservoir sampling over...
Mohammed Al-Kateb, Byung Suk Lee, Xiaoyang Sean Wa...
ICDE
2006
IEEE
127views Database» more  ICDE 2006»
14 years 2 months ago
Processing Recursive XQuery over XML Streams: The Raindrop Approach
— XML stream applications bring the challenge of efficiently processing queries on sequentially accessible tokenbased data. For efficient processing of queries, we need to ensu...
Mingzhu Wei, Ming Li, Elke A. Rundensteiner, Mural...
ICDE
2008
IEEE
137views Database» more  ICDE 2008»
14 years 10 months ago
Efficient Processing of XML Update Streams
This paper introduces a framework for processing continuous, exact queries over continuous update XML streams. Instead of eagerly performing the updates on cached portions of the s...
Leonidas Fegaras
ICDE
2002
IEEE
181views Database» more  ICDE 2002»
14 years 1 months ago
YFilter: Efficient and Scalable Filtering of XML Documents
Soon, much of the data exchanged over the Internet will be encoded in XML, allowing for sophisticated filtering and content-based routing. We have built a filtering engine called ...
Yanlei Diao, Peter M. Fischer, Michael J. Franklin...