Algorithms for efficient structure-based grouping in XML-OLAP

Authors:
Chantola Kit;Toshiyuki Amagasa;Hiroyuki Kitagawa
Affiliations:
University of Tsukuba, Japan;University of Tsukuba, Japan;University of Tsukuba, Japan
Venue:
Proceedings of the 10th International Conference on Information Integration and Web-based Applications & Services
Year:
2008

Citing 7
Cited 0

XRel: a path-based approach to storage and retrieval of XML documents using relational databases

ACM Transactions on Internet Technology (TOIT)
Structured information retrieval in XML documents

Proceedings of the 2002 ACM symposium on Applied computing
XML-Extended OLAP Querying

SSDBM '02 Proceedings of the 14th International Conference on Scientific and Statistical Database Management
Structural Joins: A Primitive for Efficient XML Query Pattern Matching

ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Specifying OLAP Cubes on XML Data

SSDBM '01 Proceedings of the 13th International Conference on Scientific and Statistical Database Management
Analytical processing of XML documents: opportunities and challenges

ACM SIGMOD Record
OLAP Query Processing for XML Data in RDBMS

SWOD '07 Proceedings of the 2007 IEEE International Workshop on Databases for Next Generation Researchers

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper discusses algorithms that efficiently compute structural grouping over XML data, which is a core operation in the interactive analysis of XML data, called "XML-OLAP". XML-OLAP allows interactive analysis over XML data to discover important information, and aggregation computation according to XML's tree hierarchy or TOPOLOGICAL ROLLUP, which plays a key role in XML structure-based grouping. We propose several variations of algorithms for efficient TOPOLOGICAL ROLLUP computation. Initially, these are basic algorithms: Top-Down and Bottom-Up, which are based on well-known Structural Join algorithms. We then propose a modified Bottom-Up algorithm to improve applicability, and the Single-Scan algorithms that make use of dedicated data structures. We finally perform comparative experimental analysis over the proposed algorithms, and demonstrate efficiency.