Evaluating Algorithms for TOPOLOGICAL ROLLUP in XML-OLAP

スポンサーリンク

概要

• 論文の詳細を見る

• The essence of XML data is the interchange of electronic data between data sources on the web. Therefore, XML is playing an important role in data storage and transmission. Whereas wide spectrum of data is represented in XML format, complex analysis on XML data becomes progressively important. To respond to the demand, we have proposed a system for XML data analysis adopting the features of OLAP system which we call XML-OLAP. Recently, we migrate our research to structure-based grouping for our XML-OLAP system that is TOPOLOGICAL ROLLUP. Based on the well-known algorithms of Structural Join, we proposed some algorithms for TOPOLOGICAL ROLLUP, namely Top-Down, Bottom-UP, and Single Scan by Preorder/Postorder number. In this paper, we will describe the algorithms, evaluation on the proposed algorithms, and show their performance with synthesized data varying by some features which enable us to make proper assessment.

• 社団法人電子情報通信学会の論文
• 2008-09-14

著者

• Kitagawa Hiroyuki

  Center for Computational Sciences, University of Tsukuba

• AMAGASA Toshiyuki

  Center for Computational Sciences, University of Tsukuba

• Kitagawa Hiroyuki

  Center For Computational Science University Of Tsukuba

• KIT Chantola

  Graduate School of Systems and Information Engineering University of Tsukuba

• Amagasa Toshiyuki

  Univ. Of Tsukuba Tsukuba‐shi Jpn

• AMAGASA Toshiyuki

  Center for Computational Science University of Tsukuba

関連論文

• 5A-1 Generating High Level Descriptions from Cluster Transitions
• 3B-3 XML Data Partitioning for Parallel Holistic Twig Join Processing
• Evaluating Algorithms for TOPOLOGICAL ROLLUP in XML-OLAP

スポンサーリンク