PCI 2001: Advances in Informatics pp 64-81 | Cite as

The Opsis Project: Materialized Views for Data Warehouses and the Web

  • Nick Roussopoulos
  • Yannis Kotidis
  • Alexandros Labrinidis
  • Yannis Sismanis
Conference paper
First Online:
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2563)

Abstract

The real world we live in is mostly perceived through an incredibly large collection of views generated by humans, machines, and other systems. This is the view reality. The Opsis project concentrates its efforts on dealing with the multifaceted form and complexity of data views including data projection views, aggregate views, summary views (synopses) and finally web views. In particular, Opsis deals with the generation, the storage organization (Cubetrees), the efficient run-time management (Dynamat) of materialized views for Data Warehouse systems and for web servers with dynamic content (WebViews).

Keywords

Data Warehouse Data Cube Query Response Time Materialization Policy Base Table 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [2]
    S. Agrawal, R. Agrawal, P. Deshpande, A. Gupta, J. Naughton, R. Ramakrishnan, and S. Sarawagi. On the Computation of Multidimensional Aggregates. In Proceedings 22nd VLDB Conference, pages 506–521, Bombay, India, August 1996. 70Google Scholar
  2. [3]
    Martin F. Arlitt and Carey Williamson. “Internet Web Servers: Workload Characterization and Performance Implications”. IEEE/ACM Transactions on Networking, 5(5), October 1997. 76Google Scholar
  3. [4]
    M.M. Astrahan et al. System R: Relational Approach to Database Management. ACM Transactions on Database Systems, 1(2):97–137, June 1976. 65CrossRefGoogle Scholar
  4. [5]
    Lars Baekgraard and Nick Roussopoulos. “Efficient Refreshment of Data Warehouse Views”. Technical Report CS-TR-3642, Dept. of Computer Science, Univ of Maryland, College Park, MD, May 1996. 65Google Scholar
  5. [6]
    E. Baralis, S. Paraboschi, and E. Teniente. Materialized View Selection in a Multidimensional Database. In Proceedings 23rd VLDB Conference, pages 156–165, Athens, Greece, August 1997. 71Google Scholar
  6. [7]
    R. Bayer and E. McCreight. Organization and Maintenance of Large Ordered Indexes. Acta Informatica, 1(3):173–189, 1972. 67CrossRefGoogle Scholar
  7. [8]
    Phil Bernstein, Michael Brodie, Stefano Ceri, David DeWitt, Mike Franklin, Hector Garcia-Molina, Jim Gray, Jerry Held, Joe Hellerstein, H. V. Jagadish, Michael Lesk, Dave Maier, Je. Naughton, Hamid Pirahesh, Mike Stonebraker, and Je. Ullman. “The Asilomar Report on Database Research”. ACM SIGMOD Record, 27(4), December 1998. 74Google Scholar
  8. [9]
    José A. Blakeley, Per Ake Larson, and Frank Wm. Tompa. “Efficiently Updating Materialized Views”. In Proceedings ACM SIGMOD Conference, pages 61–71, Washington, DC, May 1986. 64Google Scholar
  9. [10]
    Lee Breslau, Pei Cao, Li Fan, Graham Phillips, and Scott Shenker. “Web Caching and Zipf-like Distributions: Evidence and Implications”. In Proceedings IEEE INFOCOM’99, New York, NY, March 1999. 77Google Scholar
  10. [11]
    P.M. Deshpande, S. Agrawal, J.F. Naughton, and R. Ramakrishnan. Computation of Multidimensional Aggregates. Technical report, 1314, University of Wisconsin, Madison, 1996. 70Google Scholar
  11. [12]
    J. Gray, A. Bosworth, A. Layman, and H. Piramish. Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals. In Proceedings 12th IEEE ICDE Conference, pages 152–159, New Orleans, February 1996. 65, 67, 72Google Scholar
  12. [13]
    Ashish Gupta and Inderpal Singh Mumick. “Maintenance of Materialized Views: Problems, Techniques, and Applications”. IEEE Data Engineering Bulletin, 18(2):3–18, June 1995. 76Google Scholar
  13. [14]
    H. Gupta, V. Harinarayan, A. Rajaraman, and J. Ullman. Index Selection for OLAP. In Proceedings IEEE ICDE Conference, pages 208–219, Burmingham, UK, April 1997. 65, 71Google Scholar
  14. [15]
    Himanshu Gupta. “Selection of Views to Materialize in a Data Warehouse”. In Proceedings 6th ICDT Conference, pages 98–112, Delphi, Greece, January 1997. 71, 76Google Scholar
  15. [16]
    A. Guttman. R-Trees: A Dynamic Index Structure for Spatial Searching. In Proceedings ACM SIGMOD Conference, pages 47–57, Boston, MA, June 1984. 67Google Scholar
  16. [17]
    V. Harinarayan, A. Rajaraman, and J. Ullman. Implementing Data Cubes Efficiently. In Proceedings ACM SIGMOD Conference, pages 205–216, Montreal, Canada, June 1996. 71Google Scholar
  17. [18]
    H. J. Karlo. and M. Mihail. On the Complexity of the View-Selection Problem. In Proceedings 18th ACM PODS Symposium, pages 167–173, Philadelphia, PA, May 1999. 71Google Scholar
  18. [19]
    R. Kimball. The Data Warehouse Toolkit. John Wiley & Sons, 1996. 70Google Scholar
  19. [20]
    Y. Kotidis and N. Roussopoulos. An Alternative Storage Organization for ROLAP Aggregate Views Based on Cubetrees. In Proceedings ACM SIGMOD Conference, pages 249–258, Seattle, WA, June 1998. 65Google Scholar
  20. [21]
    Y. Kotidis and N. Roussopoulos. A case for Dynamic View Management. ACM Transaction on Database Systems 26(4), pages 388–423, 2001. 72CrossRefMATHGoogle Scholar
  21. [22]
    Yannis Kotidis and Nick Roussopoulos. DynaMat: A Dynamic View Management System for Data Warehouses. In Proceedings ACM SIGMOD Conference, pages 371–382, Philadelphia, PA, June 1999. 72Google Scholar
  22. [23]
    Alexandros Labrinidis and Nick Roussopoulos. “On the Materialization of Web-Views”. In Proceedings ACM SIGMOD Workshop on the Web and Databases (WebDB’99), Philadelphia, PA, June 1999. 66, 78Google Scholar
  23. [24]
    Alexandros Labrinidis and Nick Roussopoulos. “WebView Materialization”. In Proceedings ACM SIGMOD Conference, Dallas, TX, May 2000. 66, 76, 78Google Scholar
  24. [25]
    I. S. Mumick, D. Quass, and B. S. Mumick. Maintenance of Data Cubes and Summary Tables in a Warehouse. In Proceedings ACM SIGMOD Conference, pages 100–111, Tucson, AZ, May 1997. 68Google Scholar
  25. [26]
    Y. Papakonstantinou. Computing a Query as a Union of Disjoint Horizontal Fragments. Technical report, University of Maryland, College Park, MD, 1994. Working Paper, Department of Computer Science. 65Google Scholar
  26. [27]
    K.A. Ross and D. Srivastava. Fast Computation of Sparse Datacubes. In Proceedings 23rd VLDB Conference, pages 116–125, Athens, Greece, Augoust 1997. 70Google Scholar
  27. [28]
    N. Roussopoulos and Y. Kang. Preliminary Design of ADMS±: A Workstation-Mainframe Integrated Architecture. In Proceedings 12th VLDB Conference, August 1986. 64Google Scholar
  28. [29]
    N. Roussopoulos, Y. Kotidis, and M. Roussopoulos. Cubetree: Organization of and Bulk Incremental Updates on the Data Cube. In Proceedings ACM SIGMOD Conference, pages 89–99, Tucson, AZ, May 1997. 65Google Scholar
  29. [30]
    N. Roussopoulos and D. Leifker. Direct Spatial Search on Pictorial Databases Using Packed R-trees. In Proceedings 1985 ACM SIGMOD Conference, pages 17–31, Austin, 1985. 66, 68Google Scholar
  30. [31]
    Nick Roussopoulos. “The Logical Access Path Schema of a Database”. IEEE Transactions on Software Engineering, 8(6):563–573, November 1982. 64MathSciNetCrossRefGoogle Scholar
  31. [32]
    Nick Roussopoulos. “View Indexing in Relational Databases”. ACM Transactions on Database Systems, 7(2):258–290, June 1982. 64, 65, 71MATHCrossRefGoogle Scholar
  32. [33]
    Nick Roussopoulos. “An Incremental Access Method for ViewCache: Concept, Algorithms, and Cost Analysis”. ACM Transactions on Database Systems, 16(3):535–563, September 1991. 65CrossRefGoogle Scholar
  33. [34]
    Nick Roussopoulos. “Materialized Views and Data Warehouses”. ACM SIGMOD Record, 27(1), March 1998. 76Google Scholar
  34. [35]
    Nick Roussopoulos and Hyunchul Kang. “Principles and Techniques in the Design of ADMS ±”. IEEE Computer, pages 19–25, December 1986. 65Google Scholar
  35. [36]
    S. Sarawagi, R. Agrawal, and A. Gupta. On Computing the Data Cube. Technical report, RJ10026, IBM Almaden Research Center, San Jose, CA, 1996. 70Google Scholar
  36. [37]
    A. Segev and J. Park. Maintaining Materialized Views in Distributed Databases. In Proceedings 5th IEEE ICDE Conference, pages 262–270, Los Angeles, CA, 1989. IEEE. 65Google Scholar
  37. [38]
    Timos Sellis. “Intelligent caching and indexing techniques for relational database systems”. Information Systems, 13(2), 1988. 65Google Scholar
  38. [39]
    A. Shukla, P.M. Deshpande, and J.F. Naughton. Materialized View Selection for Multidimensional Datasets. In Proceedings 24th VLDB Conference, pages 488–499, New York, NY, August 1998. 71Google Scholar
  39. [40]
    J. R. Smith, C. Li, V. Castelli, and A. Jhingran. Dynamic Assembly of Views in Data Cubes. In Proceedings ACM PODS Symposium, pages 274–283, Seattle, WA, June 1998. 71Google Scholar
  40. [41]
    Michael Stonebraker. “Implementation of Integrity Constraints and Views by Query Modification”. In Proceedings ACM SIGMOD Conference, pages 65–78, San Jose, CA, May 1975. 65Google Scholar
  41. [42]
    Red Brick Systems. “Star Schemas and STARjoin Technology”. White Paper, 1996. 65, 66Google Scholar
  42. [43]
    D. Theodoratos, S. Ligoudiastianos, and T.K. Sellis. View Selection for Designing the Global Data Warehouse. In Data and Knowledge Engineering 39(3), pages 219–240, 2001. 71MATHCrossRefGoogle Scholar
  43. [44]
    F. Tompa and J. Blakeley. Maintaining Materialized Views Without Accessing Base Data. Information Systems, 13(4):393–406, 1988. 65MATHCrossRefGoogle Scholar
  44. [45]
    Patrick Valduriez. “Join Indices”. ACM Transactions on Database Systems, 12(2):218–246, June 1987. 65CrossRefGoogle Scholar
  45. [46]
    Khaled Yagoub, Daniela Florescu, Valerie Issarny, and Patrick Valduriez. “Caching Strategies for Data-Intensive Web Sites”. In Proceedings 26th VLDB Conference, Cairo, Egypt, September 2000. 78Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Nick Roussopoulos
    • 1
  • Yannis Kotidis
    • 2
  • Alexandros Labrinidis
    • 3
  • Yannis Sismanis
    • 1
  1. 1.Department of Computer ScienceUniversity of MarylandMarylandUSA
  2. 2.AT &T Labs ResearchFlorham ParkUSA
  3. 3.Department of Computer ScienceUniversity of PittsburghPittsburghUSA

Personalised recommendations