Mixed mode XML query processing
Alan Halverson,Josef Burger,Leonidas Galanis,Ameet Kini,Rajasekar Krishnamurthy,Ajith Nagaraja Rao,Feng Tian,Stratis D. Viglas,Yuan Wang,Jeffrey F. Naughton,David J. DeWitt +10 more
- 09 Sep 2003
- pp 225-236
TL;DR: This paper shows that for good performance, a native XML query processing system should support query plans that mix tree-based navigation and structural joins based on information retrieval-style inverted lists, and presents ways of transparently using both techniques in a single system.
read more
Abstract: Querying XML documents typically involves both tree-based navigation and pattern matching similar to that used in structured information retrieval domains. In this paper, we show that for good performance, a native XML query processing system should support query plans that mix these two processing paradigms. We describe our prototype native XML system, and report on experiments demonstrating that even for simple queries, there are a number of options for how to combine tree-based navigation and structural joins based on information retrieval-style inverted lists, and that these options can have widely varying performance. We present ways of transparently using both techniques in a single system, and provide a cost model for identifying efficient combinations of the techniques. Our preliminary experimental results prove the viability of our approach.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Efficiently Querying Large XML Data Repositories: A Survey
Gang Gou,Rada Chirkova +1 more
TL;DR: This survey considers two classes of major XML query processing techniques: the relational approach and the native approach, which could result in higher query processing performance and also significantly reduce system reengineering costs.
Efficient processing of XML twig queries with OR-predicates
Haifeng Jiang,Hongjun Lu,Wei Wang +2 more
- 13 Jun 2004
TL;DR: This paper proposes a novel path-partitioned encoding scheme, and presents a powerful XPattern extended from tree pattern with logic predicates, and develops a holistic twig join algorithm, called MPTwig, which is designed for efficient matching an XML twig pattern with compound and nested predicates.
97
•Proceedings Article
Statistical learning techniques for costing XML queries
Ning Zhang,Peter J. Haas,Vanja Josifovski,Guy M. Lohman,Chun Zhang +4 more
- 30 Aug 2005
TL;DR: This paper proposes a new approach to modeling the cost of XML operators, called COMET, which is the first method ever proposed for addressing the XML query costing problem and demonstrates COMET's feasibility by developing a cost model for the recently proposed XNAV navigational operator.
•Proceedings Article
Efficient processing of XML path queries using the disk-based F&B Index
Wei Wang,Haifeng Jiang,Hongzhi Wang,Xuemin Lin,Hongjun Lu,Jianzhong Li +5 more
- 30 Aug 2005
TL;DR: Experimental results verify that the disk-based F&B Index can scale up for large data size with good query performance compared with state-of-the-art XML query processing algorithms.
Efficient updates in dynamic XML data: from binary string to quaternary string
Changqing Li,Tok Wang Ling,Min Hu +2 more
- 01 May 2008
TL;DR: This paper improves CDBS to Compact Dynamic Quaternary String (CDQS) encoding which can completely avoid re-labeling in XML leaf node updates no matter what the labeling schemes are and reports the experimental results to show that the CDBS and CDQS are superior to previous approaches to process both leaf node and internal node updates.
References
On supporting containment queries in relational database management systems
Chun Zhang,Jeffrey F. Naughton,David J. DeWitt,Qiong Luo,Guy M. Lohman +4 more
- 01 May 2001
TL;DR: The results suggest that contrary to most expectations, with some modifications, a native implementations in an RDBMS can support this class of query much more efficiently.
Structural joins: a primitive for efficient XML query pattern matching
Shurug Al-Khalifa,H. V. Jagadish,Nick Koudas,Jignesh M. Patel,Divesh Srivastava,Yuqing Wu +5 more
- 07 Aug 2002
TL;DR: It is shown that, in some cases, tree-merge algorithms can have performance comparable to stack-tree algorithms, in many cases they are considerably worse, and this behavior is explained by analytical results that demonstrate that, on sorted inputs, the stack- tree algorithms have worst-case I/O and CPU complexities linear in the sum of the sizes of inputs and output, while the tree-MERge algorithms do not have the same guarantee.
•Proceedings Article
Indexing and Querying XML Data for Regular Path Expressions
Quanzhong Li,Bongki Moon +1 more
- 11 Sep 2001
TL;DR: Wang et al. as mentioned in this paper proposed a new system for indexing and storing XML data based on a numbering scheme for elements, which quickly determines the ancestor-descendant relationship between elements in the hierarchy of XML data.
Shoring up persistent applications
Michael J. Carey,David J. DeWitt,Michael J. Franklin,Nancy E. Hall,Mark L. McAuliffe,Jeffrey F. Naughton,Daniel T. Schuh,Marvin Solomon,C. K. Tan,Odysseas G. Tsatalos,Seth J. White,Michael J. Zwilling +11 more
- 24 May 1994
TL;DR: The goals and motivation for SHORE are given, and some novel aspects of the SHORE architecture are described, including a symmetric peer-to-peer server architecture, server customization through an extensible value-added server facility, and support for scalability on multiprocessor systems.
Related Papers (5)
Quanzhong Li,Bongki Moon +1 more
- 11 Sep 2001
Haifeng Jiang,Wei Wang,Hongjun Lu,Jeffrey Xu Yu +3 more
- 09 Sep 2003