Advertisement

Density-Based View Materialization

  • A. Das
  • D. K. Bhattacharyya
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3776)

Abstract

View materialization or pre-computation of aggregates(views) is a well known technique used in data warehouse design and Decision Support System(DSS) to reduce the query response time. Obviously, all the views cannot be materialized due to space-time constraint. So, one important decision in designing Data Warehouse and DSS is to select the views to be materialized, which will reduce the query response time to the minimum limit in a DSS . This paper presents a density-based view materialization algorithm with average runtime complexity O(nlogn), where n is the number of views. We have used data cube lattice, view size, access frequency of the views and support(frequency) of the views in selecting the views to be materialized. Our algorithm works much faster and selects better views than other existing algorithms.

References

  1. 1.
    Shukla, A., Despande, P.M., Naughton, J.F.: Materialized View Selection for Multidimensional Datasets. In: Proceedings of 24th VLDB Conference, New York (1998)Google Scholar
  2. 2.
    Shukla, A., Despande, P.M., Naughton, J.F., Ramasamy, K.: Storage Estimation for Multidimensional Aggregates in the Presence of Hierarchies. In: Proceedings of 22nd International VLDB Conference (1996)Google Scholar
  3. 3.
    Uchiyama, H., Runapongsa, K., Theorey, T.J.: A Progressive View Materialization Algorithm. In: Proceedings of 2nd International Data Warehousing and OLAP Workshop, Kansas City (November 1999)Google Scholar
  4. 4.
    Ester, M., Krigel, H.P., Sander, J., Xu, X.: A Density- based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. In: Proceedings of 2nd International Conference on Knowledge Discovery and Data Mining, Portland, pp. 226–231 (1996)Google Scholar
  5. 5.
    Das, A., Bhattacharyya, D.K.: Faster Algorithms for Association Rule Mining. In: Proceedings of 12th International Conference on Advanced Computing and Communication, Ahmedabad, India (December 2004)Google Scholar
  6. 6.
    Gang, G., Jeffrey, X., Chi-Hon, C., Hongjun, L.: An Efficient and Interactive A * Algorithm with Pruning Power: Materialized View Selection Revisited. In: Proceedings of 8th International Conference On Database Systems for Advanced Application(DASFAA) (2003)Google Scholar
  7. 7.
    Harinarayan, V., Rajaraman, A., Ullman, J.D.: Implementing Data Cubes Efficiently. In: Proceedings 1996 ACM-SIGMOD International Management of Data, Montreal,Canada (1996)Google Scholar
  8. 8.
    Harinarayan, V., Rajaraman, A., Ullman, J.D.: Index Selection for OLAP. In: Proceedings for 13th International Conference on Data Engineering, pp. 208–219 (1997)Google Scholar
  9. 9.
    Liang, W., Wang, H., Orlowska, M.E.: Materialized View Selection Under Time Constraint. Data and Knowledge Engineering, 203–216 (2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • A. Das
    • 1
  • D. K. Bhattacharyya
    • 1
  1. 1.Department of Information TechnologyTezpur UniversityNapaamIndia

Personalised recommendations