ACM Home Page
Please provide us with feedback. Feedback
Efficiently loading and processing XML streams
Full text PdfPdf (379 KB)
Source
ACM International Conference Proceeding Series; Vol. 299 archive
Proceedings of the 2008 international symposium on Database engineering & applications table of contents
Coimbra, Portugal
SESSION: Real-time database systems table of contents
Pages 59-67  
Year of Publication: 2008
ISBN:978-1-60558-188-0
Authors
Ming Li  Worcester Polytechnic Institute, Massachusetts
Murali Mani  Worcester Polytechnic Institute, Massachusetts
Elke A. Rundensteiner  Worcester Polytechnic Institute, Massachusetts
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 49,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1451940.1451950
What is a DOI?

ABSTRACT

XML stream applications bring the novel challenge of efficiently processing queries on sequentially accessible token-based input streams. Our Raindrop project is the first to accommodate token-based stream processing using an algebraic framework where both tokens and tuples are modeled in a uniform manner. In this paper, we illustrate how the stream loading model of our system on the fly conducts XML navigation over the input stream via concurrently constructing a minimized light-weight XML tree representation, which is called navigation-free data instance. These captured XML fragments are minimized in terms of buffer consumption. Based on the compact representation of the navigation-free data instances, we propose techniques for subsequent algebraic query evaluation, in particular, effective strategies for supporting multi-mode query operators and alternative data output semantics. The proposed stream loading model requires a much smaller buffer footprint, compared to alternative solutions in the literature such as Y-Filter. And the proposed algebra-based evaluation techniques offer effective ways to handle data recursion over XML streams, i.e., avoiding overhead from the structural join operators. Our stream loading and query evaluation techniques have been implemented as part of the Raindrop system. Experimental results based on the Raindrop system are also reported in this paper.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
M. Schemidt, S. Scherzinger and C. Koch. Combined Static and Dynamic Analysis for Effective Buffer Minimization in Streaming XQuery Evaluation. In Proceedings of ICDE, pages 236--245, 2007.
4
 
5
 
6
 
7
8
9
10
 
11
12
 
13
N. Bruno and L. Gravano. Navigation- vs. Index-Based XML Multi-Query Processing. In Proceedings of ICDE, pages 139--150, 2003.
 
14
Z. Guo, Z. Xu, S. Zhou, A. Zhou and M. Li. Index Selection for Efficient XML Path Expression. In Proceedings of ER Workshops, page 261--272, 2003.
 
15
J. Jian, H. Su and E. A. Rundensteiner. Automaton Meets Query Algebra: Towards a Unified Model for XQuery Evaluation over XML Data Streams. In Proceedings of ER, pages 172--185, 2003.
 
16
 
17
L. Fegaras. Efficient Processing of XML Update Streams. In Proceedings of ICDE, pages 616--625, 2008.

Collaborative Colleagues:
Ming Li: colleagues
Murali Mani: colleagues
Elke A. Rundensteiner: colleagues