Browse > Article

Shredding XML Documents into Relations using Structural Redundancy  

Kim Jaehoon (서강대학교 컴퓨터학과)
Park Seog (서강대학교 컴퓨터학과)
Publication Information
Journal of KIISE:Databases / v.32, no.2, 2005 , pp. 177-192 More about this Journal
Abstract
In this paper, we introduce a structural redundancy method. It reduces the query processing cost incurred when reconfiguring an XML document from divided XML data in shredding XML documents into relations. The fundamental idea is that query performance can be enhanced by analyzing query patterns and replicating data essential for the query performance. For the practical and effective structural redundancy, we analyzed three types of ID, VALUE, and SUBTREE replication. In addition, if given XML data and queries are very large and complex, it can be very difficult to search optimal redundancy set. Therefore, a heuristic search method is introduced in this paper. Finally, XML query processing cost arising by employing the structural redundancy, and the efficiency of proposed search method arc analyzed experimentally It is manifest that XML read query is performed more quick]y but XML update query is performed more slowly due to the additional update consistency cost for replicas. However, experimental results showed that in-place ID replication is useful even in having excessive update cost. It was also observed that multiple-place SUBTREE replication can enhance read query performance remarkably if only update cost is not excessive.
Keywords
XMI; relation; structural redundancy; search;
Citations & Related Records
연도 인용수 순위
  • Reference
1 A. Deutsch, V. Tannen, 'MARS: A system for publishing XML from mixed and redundant storage,' Proceedings of VLDB, Berlin, Germany, pp. 201-212, 2003
2 L. Popa, 'Object/Relational Query Optimization with Chase and Backchase,' PhD thesis, Univ. of Pennsylvania, 2000
3 P. Selinger, M. Astrahan, D. Chamberlin, R. Lorie, T. Price, 'Access Path Selection in a Relational Database Management System,' Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 23-34, 1979   DOI
4 A. Kemper, G. Moerkotte, 'Access support in object bases,' Proceedings of the ACM SIGMOD conference, pp. 364-374, 1990   DOI
5 E. Shekita, M. Carey, 'Performance Enhancement through Replication in an Object-Oriented DBMS,' Proceedings of the ACM SIGMOD conference, pp. 325-336, 1989   DOI
6 J. Shanmugasundaram, E. Shekita, R. Barr, M. Carey, B. Lindsay, H. Pirahesh, B. Reinwald, 'Efficiently publishing relational data as XML documents,' Proceedings of VLDB, Cairo, Egypt, pp. 65-76, 2000
7 Extensible Markup Language (XML) 1.0 (Second Edition), http://www.w3.org/TR/REC-xml#dt-doctype, October 2000
8 XML Schema Part 0: Primer, http://www.w3.org/TR/xmlschema-0/, May 2001
9 P. Bohannon, J Freire, P. Roy, J. Simeon, 'From XML Schema to Relations: A Cost-Based Approach to XML Storage,' Proceedings of International Conference on DATA ENGINEERING, San Jose, California, pp. 64-75, 2002   DOI
10 J. Bosak, 셰익스피어 연극 XML 데이타, http://www.oasis-open.org/cover/bosakShakespeare200.html
11 H. I. Kang, B. Y. Lee, J. S. Yoo, 'Design and Implementation of a XML Repository System Using DBMS and IRS,' The Seventh Annual Conference for XML, SGML and markup technologies, XML Asia Pacific 2000, Sydney, 2000
12 B. F. Cooper, N. Sample, M. J. Franklin, G. R. Hjaltason, M. Shadmon, 'A Fast Index for Semistructured Data,' Proceedings of VLDB, pp. 341-350, 2001
13 C.C Kanne, G. Moerkotte, 'Efficient Storage of XML Data,' Proceedings of International Conference on DATA ENGINEERING, California, USA, p. 198, 2000   DOI
14 A. Deutsch, M. Fernandez, D. Suciu, 'Storing semistructured data with STORED,' Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 431-442, 1999   DOI
15 J. Shanmugasundaram, K. Tufte, G. He, C. Zhang, D. De-Witt, J. Naughton, 'Relational databases for querying XML documents: limitations and opportunities,' Proceedings of VLDB, Edinburgh, UK, pp. 302-314, 1999
16 M. Fernandez, Y. Kadiyska, D. Suciu, A. Morishima, W. Tan, 'SilkRoute: A framework for publishing relational data in XML,' ACM TODS, 27(4): pp. 438-493, 2002   DOI   ScienceOn
17 D. Florescu, D. Kossmann, 'Storing and Querying XML document using an RDBMS,' IEEE Data Engineering Bulletin, 22(3), 1999
18 I. Tatarinov, Z. G. Ives, A. Y. Halevy, D. S. Weld, 'Updating XML,' Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 413-424, 2001   DOI
19 H. Gupta, 'Selection of Views to Materialize in a Data Warehouse,' ICDT 1997, pp. 98-112, 1997
20 R. Kaushik, P. Bohannon, J. F Naughton, H. F Korth, 'Covering Indexes for Branching Path Queries,' Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 133-144, 2002   DOI
21 A. R. Schmidt, F. Waas, M. L. Kersten, M. J. Carey, I. Manolescu, R. Busse, 'XMark: A Benchmark for XML Data Management,' Proceedings of VLDB, Hong Kong, China, pp. 974-985, 2002
22 J. Freire, J. R. Haritsa, M. Ramanath, P. Roy, J. Simeon, 'StatiX: Making XML count,' Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 181-191, 2002