Cubing Algorithms for XML Data

Authors:
Alfredo Cuzzocrea
Affiliations:
-
Venue:
DEXA '09 Proceedings of the 2009 20th International Workshop on Database and Expert Systems Application
Year:
2009

Citing 0
Cited 2

A secure multiparty computation privacy preserving OLAP framework over distributed XML data

Proceedings of the 2010 ACM Symposium on Applied Computing
Privacy Preserving OLAP over Distributed XML Data: A Theoretically-Sound Secure-Multiparty-Computation Approach

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of effectively and efficiently building OLAP data cubes over XML data sources is prominent in next-generation Enterprise Information Systems. The latter is the goal of so-called cubing algorithms, which have attracted a great deal of attention from the Database and Data Warehousing research community. On the basis of this breaking evidence, in this paper we provide a comprehensive survey on cubing algorithms for XML data, along with a critical analysis of these algorithms, and discussion on open issues and future research trends in XML-OLAP research.