Cubing Algorithms for XML Data

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.