Eventually-Consistent Replicated Relations and Updatable Views

  • Conference paper
  • First Online:
New Trends in Database and Information Systems (ADBIS 2023)

Abstract

Distributed systems have to live with weak consistency, such as eventual consistency, if high availability is the primary goal and network partitioning is unexceptional. Local-first applications are examples of such systems. There is currently work on local-first databases where the data are asynchronously replicated on multiple devices and the replicas can be locally updated even when the devices are offline. Sometimes, a user may want to maintain locally a copy of a view instead of the entire database. For the view to be fully useful, the user should be able to both query and update the local copy of the view. We present an approach to maintaining updatable views where both the source database and the views are asynchronously replicated. The approach is based on CRDTs (Conflict-free Replicated Data Types) and guarantees eventual consistency.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
EUR 29.95
Price includes VAT (Germany)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
EUR 85.59
Price includes VAT (Germany)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
EUR 106.99
Price includes VAT (Germany)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free ship** worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    To avoid being confused with the join \(\bowtie \) of relations, in the rest of the paper, we use the term merge for \(\sqcup \).

References

  1. Almeida, P.S., Shoker, A., Baquero, C.: Delta state replicated data types. J. Parallel Distrib. Comput. 111, 162–173 (2018)

    Article  Google Scholar 

  2. Bancilhon, F., Spyratos, N.: Update semantics of relational views. ACM Trans. Database Syst. 6(4), 557–575 (1981)

    Article  MATH  Google Scholar 

  3. Bohannon, A., Pierce, B.C., Vaughan, J.A.: Relational lenses: a language for updatable views. In: Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), pp. 338–347. ACM (2006)

    Google Scholar 

  4. Dayal, U., Bernstein, P.A.: On the correct translation of update operations on relational views. ACM Trans. Database Syst. 7(3), 381–416 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  5. Enes, V., Almeida, P. S., Baquero, C., Leitão, J.: Efficient Synchronization of State-Based CRDTs. In: IEEE 35th International Conference on Data Engineering (ICDE), April 2019

    Google Scholar 

  6. Garg, V.K.: Introduction to Lattice Theory with Computer Science Applications. Wiley, Hoboken (2015)

    Google Scholar 

  7. Gottlob, G., Paolini, P., Zicari, R.V.: Properties and update semantics of consistent views. ACM Trans. Database Syst. 13(4), 486–524 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  8. Horn, R., Perera, R., and Cheney, J. Incremental relational lenses. Proc. ACM Program. Lang. 2, 74:1–74:30. ICFP (2018)

    Google Scholar 

  9. Johnson, P., Thomas, R.: The maintamance of duplicated databases. Internet Request Comments RFC 677, January 1976

    Google Scholar 

  10. Keller, A.M.: Algorithms for translating view updates to database updates for views involving selections, projections, and joins. In: Proceedings of the Fourth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 25–27 March 1985, Portland, Oregon, USA, pp. 154–163. ACM (1985)

    Google Scholar 

  11. Kleppmann, M., Wiggins, A., van Hardenberg, P., McGranaghan, M.: Local-first software: you own your data, in spite of the cloud. In: Proceedings of the 2019 ACM SIGPLAN International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software, (Onward! 2019), pp. 154–178 (2019)

    Google Scholar 

  12. Shapiro, M., Preguiça, N.M., Baquero, C., Zawirski, M.: A comprehensive study of convergent and commutative replicated data types. Rapport de recherche 7506, January 2011

    Google Scholar 

  13. Shapiro, M., Preguiça, N.M., Baquero, C., Zawirski, M.: Conflict-free replicated data types. In: 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems, (SSS 2011), pp. 386–400 (2011)

    Google Scholar 

  14. Yu, W., Ignat, C.-L.: Conflict-free replicated relations for multi-synchronous database management at edge. In: IEEE International Conference on Smart Data Services (SMDS), pp. 113–121, October 2020

    Google Scholar 

  15. Yu, W., Rostad, S.: A low-cost set CRDT based on causal lengths. In: Proceedings of the 7th Workshop on the Principles and Practice of Consistency for Distributed Data (PaPoC), pp. 5:1–5:6 (2020)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Weihai Yu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Thomassen, J., Yu, W. (2023). Eventually-Consistent Replicated Relations and Updatable Views. In: Abelló, A., et al. New Trends in Database and Information Systems. ADBIS 2023. Communications in Computer and Information Science, vol 1850. Springer, Cham. https://doi.org/10.1007/978-3-031-42941-5_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-42941-5_17

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-42940-8

  • Online ISBN: 978-3-031-42941-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Navigation