Abstract
Data warehouses maintain historical information to enable the discovery of trends and developments over time. Hence data items usually contain time-related attributes like the time of a sales transaction or the order and shipping date of a product. Furthermore the values of these time-related attributes have a tendency to increase over time. We refer to this as the Multi-Append-Only-Trend (MAOT) property. In this paper we formalize the notion of MAOT and show how taking advantage of this property can improve query performance considerably. We focus on range aggregate queries which are essential for summarizing large data sets. Compared to MOLAP data cubes the amount of pre-computation and hence additional storage in the proposed technique is dramatically reduced.
This research was supported by the NSF under IIS98-17432, EIA99-86057, EIA00- 80134, and IIS02-09112.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Böhm, C., Kriegel, H.-P.: Dynamically Optimizing High-Dimensional Index Structures. In: Zaniolo, C., Grust, T., Scholl, M.H., Lockemann, P.C. (eds.) EDBT 2000. LNCS, vol. 1777, pp. 36–50. Springer, Heidelberg (2000)
Chan, C.-Y., Ioannidis, Y.E.: An Efficient Bitmap Encoding scheme for selection Queries. In: Proc. Int. Conf. on Management of Data (SIGMOD), pp. 215–216 (1999)
Chan, C.-Y., Ioannidis, Y.E.: Hierarchical Cubes for Range-Sum Queries. In: Proc. Int. Conf. on Very Large Data Bases (VLDB), pp. 675–686 (1999)
Chaudhuri, S., Dayal, U.: An Overview of Data Warehousing and OLAP Technology. SIGMOD Record 26(1), 65–74 (1997)
Chazelle, B.: A Functional Approach to Data Structures and its Use in Multidimensional Searching. SIAM Journal on Computing 17(3), 427–462 (1988)
de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry, vol. 2. Springer, Heidelberg (2000)
Driscoll, J.R., Sarnak, N., Sleator, D.D., Tarjan, R.E.: Making Data Structures Persistent. Journal of Computer and System Sciences (JCSS) 38(1), 86–124 (1989)
Ester, M., Kohlhammer, J., Kriegel, H.-P.: The DC-Tree: A Fully Dynamic Index Structure for Data Warehouses. In: Proc. Int. Conf. on Data Engineering (ICDE), pp. 379–388 (2000)
Guttman, A.: R-Trees: A Dynamic Index Structure for Spatial Searching. In: Proc. ACM SIGMOD Int. Conf. on Management of Data, pp. 47–57 (1984)
Geffner, S., Agrawal, D., El Abbadi, A.: The Dynamic Data Cube. In: Zaniolo, C., Grust, T., Scholl, M.H., Lockemann, P.C. (eds.) EDBT 2000. LNCS, vol. 1777, pp. 237–253. Springer, Heidelberg (2000)
Gaede, V., Günther, O.: Multidimensional access methods. ACM Computing Surveys 30(2), 170–231 (1998)
Ho, C., Agrawal, R., Megiddo, N., Srikant, R.: Range Queries in OLAP Data Cubes. In: Proc. Int. Conf. on Management of Data (SIMGMOD), pp. 73–88 (1997)
Jensen, C.S., et al.: Temporal Databases - Research and Practice. In: Etzion, O., Jajodia, S., Sripada, S. (eds.) Dagstuhl Seminar 1997. LNCS, vol. 1399, pp. 367–405. Springer, Heidelberg (1998)
Lazaridis, I., Mehrotra, S.: Progressive Approximate Aggregate Queries with a Multi-Resolution Tree Structure. In: Proc. ACM SIGMOD Int. Conf. on Management of Data, pp. 401–412 (2001)
Li, H.-G., Agrawal, D., El Abbadi, A., Riedewald, M.: Exploiting the Multi-Append-Only-Trend Property of Historical Data in DataWarehouses. Technical Report, Computer Science Department. University of California, Santa Barbara (2003), http://www.cs.ucsb.edu/research/trcs/docs/2003-09.ps
Markl, V., Ramsak, F., Bayer, R.: Improving OLAP Performance by Multidimensional Hierarchical clustering. In: Proc. Int. Conf. on Database Engineering and Applications Symp. (IDEAS), pp. 165–177 (1999)
O’Neil, P.E., Quass, D.: Improved Query Performance with Variant Indexes. In: Proc. Int. Conf. on Management of Data (SIGMOD), pp. 38–49 (1997)
Riedewald, M., Agrawal, D., El Abbadi, A.: Flexible Data Cubes for Online Aggregation. In: Van den Bussche, J., Vianu, V. (eds.) ICDT 2001. LNCS, vol. 1973, pp. 159–173. Springer, Heidelberg (2001)
Riedewald, M., Agrawal, D., El Abbadi, A.: pCube: Update-Efficient Online Aggregation with Progressive Feedback and Error Bounds. In: Proc. Int. Conf. on Scientific and Statistical Database Management (SSDBM), pp. 95–108 (2000)
Riedewald, M., Agrawal, D., El Abbadi, A.: Efficient Integration and Aggregation of Historical Information. In: Proc. ACM SIGMOD Int. Conf. on Management of Data, pp. 13–24 (2002)
White, D.A., Jain, R.: Similarity Indexing with the SS-tree. In: Proc. Int. Conf. on Data Engineering (ICDE), pp. 516–523 (1996)
Willard, D.E., Lueker, G.S.: Adding Range Restriction Capability to Dynamic Data Structures. Journal of the ACM 32(3), 597–617 (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, HG., Agrawal, D., El Abbadi, A., Riedewald, M. (2003). Exploiting the Multi-Append-Only-Trend Property of Historical Data in Data Warehouses. In: Hadzilacos, T., Manolopoulos, Y., Roddick, J., Theodoridis, Y. (eds) Advances in Spatial and Temporal Databases. SSTD 2003. Lecture Notes in Computer Science, vol 2750. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45072-6_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-45072-6_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40535-1
Online ISBN: 978-3-540-45072-6
eBook Packages: Springer Book Archive