skip to main content
10.1145/1559845.1559866acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
research-article

Asynchronous view maintenance for VLSD databases

Published:29 June 2009Publication History

ABSTRACT

The query models of the recent generation of very large scale distributed (VLSD) shared-nothing data storage systems, including our own PNUTS and others (e.g. BigTable, Dynamo, Cassandra, etc.) are intentionally simple, focusing on simple lookups and scans and trading query expressiveness for massive scale. Indexes and views can expand the query expressiveness of such systems by materializing more complex access paths and query results. In this paper, we examine mechanisms to implement indexes and views in a massive scale distributed database. For web applications, minimizing update latencies is critical, so we advocate deferring the work of maintaining views and indexes as much as possible. We examine the design space, and conclude that two types of view implementations, called remote view tables (RVTs) and local view tables (LVTs), provide good tradeoff between system throughput and minimizing view staleness. We describe how to construct and maintain such view tables, and how they can be used to implement indexes, group-by-aggregate views, equijoin views and selection views. We also introduce and analyze a consistency model that makes it easier for application developers to cope with the impact of deferred view maintenance. An empirical evaluation quantifies the maintenance costs of our views, and shows that they can significantly improve the cost of evaluating complex queries.

References

  1. CouchDB. http://couchdb.apache.org/.Google ScholarGoogle Scholar
  2. D. Agrawal, A. E. Abbadi, A. K. Singh, and T. Yurek. Efficient view maintenance at data warehouses. In SIGMOD, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. J. A. Blakeley, P.-A. Larson, and F. W. Tompa. Efficiently updating materialized views. In SIGMOD, 1986. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. M. Cafarella et al. Data management projects at Google. SIGMOD Record, 34--38(1), March 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. S. Ceri and J. Widom. Deriving production rules for incremental view maintenance. In VLDB, 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. F. Chang et al. Bigtable: A distributed storage system for structured data. In OSDI, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. S. Chen, B. Liu, and E. A. Rundensteiner. Multiversion-based view maintenance over distributed data sources. ACM Transactions on Database Systems, 29:675--709, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. S. Chen and E. A. Rundensteiner. Gpivot: Efficient incremental maintenance of complex rolap views. In ICDE, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. L. S. Colby et al. Algorithms for deferred view maintenance. In SIGMOD, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. B. F. Cooper et al. PNUTS: Yahoo!'s hosted data serving platform. In VLDB, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. G. DeCandia et al. Dynamo: Amazon's highly available key-value store. In SOSP, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. G. Graefe. B-tree indexes for high update rates. SIGMOD Record, 35(1):39--44, March 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. A. Gupta, I. S. Mumick, and V. S. Subrahmanian. Maintaining views incrementally. In SIGMOD, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. H. He, J. Xie, J. Yang, and H. Yu. Asymmetric batch incremental view maintenance. In ICDE, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. A. Lakshman, P. Malik, and K. Ranganathan. Cassandra: A structured storage system on a P2P network. In SIGMOD, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. G. Luo, J. F. Naughton, C. J. Ellmann, and M. Watzke. A comparison of three methods for join view maintenance in parallel RDBMS. In ICDE, 2003.Google ScholarGoogle ScholarCross RefCross Ref
  17. C. Mohan and I. Narang. Algorithms for creating indexes for very large tables without quiescing updates. In SIGMOD, 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. D. Quass, A. Gupta, I. S. Mumick, and J. Widom. Making views self-maintainable for data warehousing. In Conf. on Parallel and Distributed Information Systems, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. D. Quass and J. Widom. On-line warehouse view maintenance. In SIGMOD, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. K. Salem, K. Beyer, B. Lindsay, and R. Cochrane. How to roll a join: Asynchronous incremental view maintenance. In SIGMOD, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. J. Zhou, P.-A. Larson, and H. G. Elmongui. Lazy maintenance of materialized views. In VLDB, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Y. Zhuge, H. Garcia-Molina, J. Hammer, and J. Widom. View maintenance in a warehousing environment. In SIGMOD, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Y. Zhuge, H. Garcia-Molina, and J. L. Wiener. The strobe algorithms for multi-source warehouse consistency. In Proc. Conf. on Parallel and Distributed Information Systems, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Asynchronous view maintenance for VLSD databases

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      SIGMOD '09: Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
      June 2009
      1168 pages
      ISBN:9781605585512
      DOI:10.1145/1559845

      Copyright © 2009 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 29 June 2009

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      Overall Acceptance Rate785of4,003submissions,20%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader