Skip to main content

Semantic Bijectivity and the Uniqueness of Constant-Complement Updates in the Relational Context

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4925))

Abstract

Within the context of the relational model, a general technique for establishing that the translation of a view update defined by constant complement is independent of the choice of complement is presented. In contrast to previous results, the uniqueness is not limited to order-based updates (those constructed from insertions and deletions), nor is it limited to those well-behaved complements which define closed update strategies. Rather, the approach is based upon optimizing the change of information in the main schema which the view update entails. The only requirement is that the view and its complement together possess a property called semantic bijectivity relative to the information measure. It is furthermore established that a very wide range of views have this property. This results formalizes the intuition, long observed in examples, that it is difficult to find different complements which define distinct but reasonable update strategies.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Article  MATH  Google Scholar 

  2. Lechtenbörger, J.: The impact of the constant complement approach towards view updating. In: Proceedings of the Twenty-Second ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, San Diego, California, June 09-11, 2003, pp. 49–55 (2003)

    Google Scholar 

  3. Hegner, S.J.: An order-based theory of updates for database views. Ann. Math. Art. Intell. 40, 63–125 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  4. Foster, J.N., Greenwald, M.B., Moore, J.T., Pierce, B.C., Schmitt, A.: Combinators for bidirectional tree transformations: A linguistic approach to the view-update problem. ACM Trans. Programming Languages and Systems 29 (2007)

    Google Scholar 

  5. Hegner, S.J.: Information-optimal reflections of view updates on relational database schemata. In: Hartmann, S., Kern-Isberner, G. (eds.) FoIKS 2008. LNCS, vol. 4932, pp. 112–131. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  6. Paredaens, J., De Bra, P., Gyssens, M., Van Gucht, D.: The Structure of the Relational Database Model. Springer, Heidelberg (1989)

    Book  MATH  Google Scholar 

  7. Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)

    MATH  Google Scholar 

  8. Genesereth, M.R., Nilsson, N.J.: Logical Foundations of Artificial Intelligence. Morgan Kaufmann, San Francisco (1987)

    MATH  Google Scholar 

  9. Ceri, S., Gottlob, G., Tanca, L.: Logic Programming and Databases. Springer, Heidelberg (1990)

    Book  Google Scholar 

  10. Jacobs, B.E., Aronson, A.R., Klug, A.C.: On interpretations of relational languages and solutions to the implied constraint problem. ACM Trans. Database Systems 7, 291–315 (1982)

    Article  MATH  Google Scholar 

  11. Herrlich, H., Strecker, G.E.: Category Theory. Allyn and Bacon (1973)

    Google Scholar 

  12. Monk, J.D.: Mathematical Logic. Springer, Heidelberg (1976)

    Book  MATH  Google Scholar 

  13. Fagin, R.: Horn clauses and database dependencies. J. Assoc. Comp. Mach. 29, 952–985 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  14. Dowling, W.F., Gallier, J.H.: Linear-time algorithms for testing the satisfiability of propositional Horn clauses. J. Logic Programming 3, 267–284 (1984)

    Article  MATH  Google Scholar 

  15. Fagin, R., Kolaitis, P.G., Miller, R.J., Popa, L.: Data exchange: Semantics and query answering. Theoret. Comput. Sci. 336, 89–124 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  16. Beeri, C., Vardi, M.Y.: A proof procedure for data dependencies. J. Assoc. Comp. Mach. 31, 718–741 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  17. Hegner, S.J.: Unique complements and decompositions of database schemata. J. Comput. System Sci. 48, 9–57 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  18. Thalheim, B.: Entity-Relationship Modeling. Springer, Heidelberg (2000)

    Book  MATH  Google Scholar 

  19. Hegner, S.J.: The complexity of embedded axiomatization for a class of closed database views. Ann. Math. Art. Intell. 46, 38–97 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  20. Fagin, R.: Inverting schema mappings. ACM Trans. Database Systems 32 (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hegner, S.J. (2008). Semantic Bijectivity and the Uniqueness of Constant-Complement Updates in the Relational Context. In: Schewe, KD., Thalheim, B. (eds) Semantics in Data and Knowledge Bases. SDKB 2008. Lecture Notes in Computer Science, vol 4925. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88594-8_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-88594-8_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-88593-1

  • Online ISBN: 978-3-540-88594-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics