Structural XML Query Processing

被引:7
作者
Baca, Radim [1 ]
Kratky, Michal [1 ]
Holubova, Irena [2 ]
Necasky, Martin [2 ]
Skopal, Tomas [2 ]
Svoboda, Martin [2 ]
Sakr, Sherif [3 ,4 ]
机构
[1] VSB Tech Univ Ostrava, Dept Comp Sci, Fac Elect Engn & Comp Sci, 17 Listopadu 15, Ostrava 70833, Czech Republic
[2] Charles Univ Prague, Fac Math & Phys, Dept Software Engn, Malostranske Nam 25, Prague 11800 1, Czech Republic
[3] Saudi Arabia Univ New South Wales, King Saud bin Abdulaziz Univ Hlth Sci, Sydney, NSW, Australia
[4] Natl ICT Australia NICTA, ATP Lab Sydney, Software Syst Res Grp, Sydney, NSW, Australia
关键词
XML; structural XML query processing; HOLISTIC TWIG JOINS; LABELING SCHEME; TREE;
D O I
10.1145/3095798
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Since the boom in new proposals on techniques for efficient querying of XML data is now over and the research world has shifted its attention toward new types of data formats, we believe that it is crucial to review what has been done in the area to help users choose an appropriate strategy and scientists exploit the contributions in new areas of data processing. The aim of this work is to provide a comprehensive study of the state-of-the-art of approaches for the structural querying of XML data. In particular, we start with a description of labeling schemas to capture the structure of the data and the respective storage strategies. Then we deal with the key part of every XML query processing: a twig query join, XML query algebras, optimizations of query plans, and selectivity estimation of XML queries. To the best of our knowledge, this is the first work that provides such a detailed description of XML query processing techniques that are related to structural aspects and that contains information about their theoretical and practical features as well as about their mutual compatibility and general usability.
引用
收藏
页数:41
相关论文
共 166 条
[61]  
Fisher D., 2007, ICDE, V2007, P626, DOI DOI 10.1109/ICDE.2007.367908
[62]  
Florescu D., 1999, B TECHNICAL COMMITTE, V22, P27
[63]  
Fontoura M., 2005, P 14 ACM INT C INF K, P784
[64]  
Freire Juliana., 2002, P 2002 ACM SIGMOD IN, P181
[65]  
Georgiadis H., 2010, P 13 INT C EXT DAT T, P171
[66]  
Goldman R, 1997, PROCEEDINGS OF THE TWENTY-THIRD INTERNATIONAL CONFERENCE ON VERY LARGE DATABASES, P436
[67]  
Grimsmo Nils, 2010, P 36 INT C VER LARG
[68]  
Grust T., 2003, VLDB, P524
[69]  
Grust Torsten., 2004, VLDB, P252
[70]  
Grust Torsten, 2005, P 2 INT WORKSH XQUER