Hongfei Guo
Per-Åke Larson
ABSTRACT
Despite the widespread and growing use of asynchronous copies to improve scalability, performance and availability, this practice still lacks a firm semantic foundation. Applications are written with some understanding of which queries can use data that is not entirely current and which copies are "good enough"; however, there are neither explicit requirements nor guarantees. We propose to make this knowledge available to the DBMS through explicit currency and consistency (C&C) constraints in queries and develop techniques so the DBMS can guarantee that the constraints are satisfied. In this paper we describe our model for expressing C&C constraints, define their semantics, and propose SQL syntax. We explain how C&C constraints are enforced in MTCache, our prototype mid-tier database cache, including how constraints and replica update policies are elegantly integrated into the cost-based query optimizer. Consistency constraints are enforced at compile time while currency constraints are enforced at run time by dynamic plans that check the currency of each local replica before use and select sub-plans accordingly. This approach makes optimal use of the cache DBMS while at the same time guaranteeing that applications always get data that is "good enough" for their purpose.
- {ABG88} R. Alonso, D. Barbará, H. Garcia-Molina, and S. Abad. Quasi-copies: Efficient Data Sharing for Information Retrieval Systems. In EDBT, 1988. Google Scholar
Digital Library
- {ABK+03} M. Altinel, C. Bornhövd, S. Krishnamurthy, C. Mohan, H. Pirahesh, and B. Reinwald. Cache Tables: Paving The Way For An Adaptive Database Cache. In VLDB, 2003.Google ScholarDigital Library
- {BAK+03} C. Bornhövd, M. Altinel, S. Krishnamurthy, C. Mohan, H. Pirahesh, and B. Reinwald. DBCache: Middle-Tier Database Caching For Highly Scalable E-Business Architectures. In SIGMOD, 2003. Google ScholarDigital Library
- {BGM92} D. Barbará and H. Garcia-Molina. The Demarcation Protocol: A Technique For Maintaining Linear Arithmetic Constraints In Distributed Database Systems. In EDBT, 1992. Google ScholarDigital Library
- {BR02} L. Bright and L. Raschid. Using Latency-Recency Profiles for Data Delivery on the Web. In Proc. In VLDB, 2002.Google ScholarCross Ref
- {CHS99} F. Chu, J. Halpern, and P. Seshadri. Least Expected Cost Query Optimization: An Exercise In Utility. In PODS, 1999. Google ScholarDigital Library
- {DR99} D. Donjerkovic and R. Ramakrishnan. Probabilistic Optimization Of Top N Queries. In VLDB, 1999. Google ScholarDigital Library
- {Gal99} A. Gal. Obsolescent Materialized Views in Query Processing of Enterprise Information Systems. In CIKM, 1999. Google ScholarDigital Library
- {GMW82} H. Garcia-Molina and G. Wiederhold. Read-Only Transactions In A Distributed Database. In TODS, 1982. Google ScholarDigital Library
- {GN95} R. Gallersdörfer and M. Nicola. Improving Performance in Replicated Databases Through Relaxed Coherency. In VLDB, 1995. Google ScholarDigital Library
- {GL01} J. Goldstein and P. Larson. Optimizing Queries Using Materialized Views: A Practical, Scalable Solution. In SIGMOD, 2001. Google ScholarDigital Library
- {HSW94} Y. Huang, R. Solan, and O. Wolfson. Divergence Caching in Client Server Architectures. In PDIS, 1994. Google ScholarDigital Library
- {KKST98} A. Kermarrec, I. Kuz, M. Steen, and A. Tanenbaum. A Framework For Consistent, Replicated Web Objects. In ICDCS, 1998. Google ScholarDigital Library
- {LC02} S. Weissman L. and P. Chrysanthis. Personalizing Information Gathering For Mobile Database Clients. In SAC, 2002.Google Scholar
- {LGZ04} P. Larson, J. Goldstein, and J. Zhou. MTCache: Transparent Mid-Tier Database Caching In Sql Server. In ICDE, 2004. Google ScholarDigital Library
- {LR03} A. Labrinidis and N. Roussopoulos. Balancing Performance And Data Freshness In Web Database Servers. In VLDB, 2003. Google ScholarDigital Library
- {OLW01} C. Olston, B. Loo, and J. Widom. Adaptive Precision Setting for Cached Approximate Values. In SIGMOD, 2001. Google ScholarDigital Library
- {OW00} C. Olston and J. Widom. Offering A Precision-Performance Tradeoff For Aggregation Queries Over Replicated Data. In VLDB, 2000. Google ScholarDigital Library
- {PL91} C. Pu and A. Leff. Replica Control In Distributed Systems: An Asynchronous Approach. In SIGMOD, 1991. Google ScholarDigital Library
- {RBSS02} U. Röhm, K. Böhm, H. Schek, and H. Schuldt. FAS - a Freshness-Sensitive Coordination Middleware for a Cluster of OLAP Components. In VLDB, 2002. Google ScholarDigital Library
- {SF90} A. Segev and W. Fang. Currency-based Updates To Distributed Materialized Views. In ICDE, 1990. Google ScholarDigital Library
- {SK97} L. Seligman and L. Kerschberg. A Mediator For Approximate Consistency: Supporting "Good Enough" Materialized Views. In JIIS, 8(3):203--225, 1997. Google ScholarDigital Library
- {SR90} A. Sheth and M. Rusinkiewicz. Management Of Interdependent Data: Specifying Dependency And Consistency Requirements. In Workshop on the Management of ReplicatedData, pages 133--136, 1990.Google Scholar
- {WQ87} G. Wiederhold and X. Qian. Modeling Asynchrony In Distributed Databases. In ICDE, 1987. Google ScholarDigital Library
- {WXCJ98} O. Wolfson, B. Xu, S. Chamberlain, and L. Jiang. Moving Objects Databases: Issues And Solutions. In Statistical And Scientific Database Management, pages 111--122, 1998. Google ScholarDigital Library
- {YV00} H. Yu and A. Vahdat. Efficient Numerical Error Bounding For Replicated Network Services. In VLDB, 2000. Google ScholarDigital Library
- Relaxed currency and consistency: how to say "good enough" in SQL
Recommendations
Managing consistency anomalies in distributed integrated databases with relaxed ACID properties
ICUIMC '14: Proceedings of the 8th International Conference on Ubiquitous Information Management and CommunicationIn central databases the consistency of data is normally implemented by using the ACID (Atomicity, Consistency, Isolation and Durability) properties of a DBMS (Data Base Management System). This is not possible if distributed and/or mobile databases are ...
Relaxed Data Consistency with CONStanza
CCGRID '06: Proceedings of the Sixth IEEE International Symposium on Cluster Computing and the GridData replication is an important aspect in a Data Grid for increasing fault tolerance and availability. Many Grid replication tools or middleware systems deal with read-only files which implies that replicated data items are always consistent. However, ...
Hiding Relaxed Memory Consistency with Compilers
PACT '00: Proceedings of the 2000 International Conference on Parallel Architectures and Compilation TechniquesWe present a compiler technique, which is based on Shasha and Snir's delay set analysis, to hide the underlying relaxed memory consistency model for an optimizing compiler for explicitly parallel programs. The compiler presents programmers with a ...
Comments