XQStream plus plus : Fast tuple extraction algorithm for streaming XML data
- Authors
- Ryu, Byung-Gul; Ha, JongWoo; Lee, SangKeun
- Issue Date
- 1-9월-2015
- Publisher
- ELSEVIER SCIENCE INC
- Keywords
- Streaming XML; Tuple extraction; Relational pointer; Pattern reuse
- Citation
- INFORMATION SCIENCES, v.314, pp.311 - 326
- Indexed
- SCIE
SCOPUS
- Journal Title
- INFORMATION SCIENCES
- Volume
- 314
- Start Page
- 311
- End Page
- 326
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/92513
- DOI
- 10.1016/j.ins.2014.06.041
- ISSN
- 0020-0255
- Abstract
- Tuple extraction from streaming XML should be cost effective for real-time query evaluation. Recently, StreamTX exhibits a good performance in terms of both running time and memory usage to support the tuple extraction queries for streaming XML. However, we empirically observe that StreamTX incurs computational overhead unnecessarily, since it builds on TwigStack, an XML query processing algorithm originally developed for stored XML. In this paper, we first design a non-recursive XQStream algorithm to handle inefficient recursive calls of StreamTX. Subsequently, we extend the basic XQStream by incorporating two novel schemes: (1) the relational pointer to efficiently and effectively evaluate the structural relationship of elements, and (2) the pattern reuse to reduce redundant path evaluations for pattern matching. The performance evaluation on various datasets provides new empirical findings. First, XQStream++, which incorporates the relational pointer and the pattern reuse scheme into XQStream, significantly outperforms the state-of-the-art algorithms in running time with a small, nearly constant memory usage. Second, the most recently released XQuery engines outperform StreamTX in running time. (C) 2014 Elsevier Inc. All rights reserved.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - Graduate School > Department of Artificial Intelligence > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.