The paradigmatic view of data in decision support consists of a set of dimensions (e.g., location, product, time period, ...), each encoding a hierarchy (e.g., location has hemisphere, country, state/province, ..., block). Typical queries consist of aggregates over a quantifiable attribute (e.g., sales) as a function of at most one attribute in each dimension of this ``data cube.'''' For example, find the sum of all sales of blue polo shirts in Palm Beach during the last quarter. In this paper, we introduce an index structure for storing and indexing aggregates, called ``cube forests,'''' to support such cube queries efficiently --- one index search is usually enough. In their most general form, cube forests require a lot of space. So, we present an optimized structure, called ``hierarchically split cube forests'''' that exploit the hierarchical nature of the data to save space. We then present a model and algorithms to arrive at designs that further reduce update time, but suffer an increase in query time. Our experiments bear out the model and show that the structure has promise for decision support applications in read-intensive environments.
Cited By
- Johnson T Data warehousing Handbook of massive data sets, (661-710)
- Geffner S, Agrawal D, Abbadi A and Smith T Browsing large digital library collections using classification hierarchies Proceedings of the eighth international conference on Information and knowledge management, (195-201)
- Korn F, Jagadish H and Faloutsos C (2019). Efficiently supporting ad hoc queries in large datasets of time sequences, ACM SIGMOD Record, 26:2, (289-300), Online publication date: 1-Jun-1997.
- Korn F, Jagadish H and Faloutsos C Efficiently supporting ad hoc queries in large datasets of time sequences Proceedings of the 1997 ACM SIGMOD international conference on Management of data, (289-300)
- Ho C, Bruck J and Agrawal R Partial-sum queries in OLAP data cubes using covering codes Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (228-237)
Recommendations
Convex cube: towards a unified structure for multidimensional databases
DEXA'07: Proceedings of the 18th international conference on Database and Expert Systems ApplicationsIn various approaches, data cubes are pre-computed in order to efficiently answer Olap queries. Such cubes are also successfully used for multidimensional analysis of data streams. The notion of data cube has been explored in various ways: iceberg cubes,...
Semi-closed cube: an effective approach to trading off data cube size and query response time
The results of data cube will occupy huge amount of disk space when the base table is of a large number of attributes. A new type of data cube, compact data cube like condensed cube and quotient cube, was proposed to solve the problem. It compresses ...
The design of AHPEC in web-based decision support system for making decision
AIC'10/BEBI'10: Proceedings of the 10th WSEAS international conference on applied informatics and communications, and 3rd WSEAS international conference on Biomedical electronics and biomedical informaticsThis paper presents the architecture of the WDSS using AHPEC for making decision. The WDSS-AHPEC involves client, user interface, server, web server, database, and DSS model. The DSS model in this study is using AHPEC method. In applying AHPEC, it ...