Skip to main content

Reachability Problems in Entity-Relationship Schema Instances

  • Conference paper
Conceptual Modeling – ER 2004 (ER 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3288))

Included in the following conference series:

Abstract

Recent developments in reification of ER schemata include automatic generation of web-based database administration systems [1,2]. These systems enforce the schema cardinality constraints, but, beyond unsatisfiable schemata, this feature may create unreachable instances. We prove sound and complete characterisations of schemata whose instances satisfy suitable reachability properties; these theorems translate into linear algorithms that can be used to prevent the administrator from reifying schemata with unreachable instances.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ceri, S., Fraternali, P., Bongio, A.: Web Modeling Language (WebML): a modeling language for designing web sites. In: Proc. Ninth World Wide Web Conference (2000)

    Google Scholar 

  2. Vigna, S.: Multirelational semantics for extended entity-relationship schemata with applications. In: Spaccapietra, S., March, S.T., Kambayashi, Y. (eds.) ER 2002. LNCS, vol. 2503, pp. 35–49. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  3. Chen, P.P.S.: The entity-relationship model: Toward a unified view of data. ACM Transactions on Database Systems 1, 9–36 (1976)

    Article  Google Scholar 

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

    MATH  Google Scholar 

  5. Lenzerini, M., Nobili, P.: On the satisfiability of dependency constraints in entityrelationship schemata. Information Systems 15, 453–461 (1990)

    Article  Google Scholar 

  6. Calvanese, D., Lenzerini, M.: On the interaction between ISA and cardinality constraints. In: Elmagarmid, A.K., Neuhold, E. (eds.) Proceedings of the 10th International Conference on Data Engineering, Houston, TX, pp. 204–213. IEEE Computer Society Press, Los Alamitos (1994)

    Chapter  Google Scholar 

  7. Gogolla, M., Hohenstein, U.: Towards a semantic view of an extended entityrelationship model. ACM Transactions on Database Systems (TODS) 16, 369–416 (1991)

    Article  MathSciNet  Google Scholar 

  8. Bénabou, J.: Introduction to bicategories. In: Reports of the Midwest Category Seminar. Lecture Notes in Mathematics, vol. 47, pp. 1–77. Springer, Heidelberg (1967)

    Chapter  Google Scholar 

  9. Bruni, R., Gadducci, F.: Some algebraic laws for spans (and their connections with multirelations). In: Kahl, W., Parnas, D., Schmidt, G. (eds.) Relational Methods in Software. Electronic Notes in Theoretical Computer Science, vol. 44(3), p. 3. Elsevier, Amsterdam (2001)

    Google Scholar 

  10. Borceux, F.: Handbook of Categorical Algebra 1. Encyclopedia of Mathematics and Its Applications, vol. 50. Cambridge University Press, Cambridge (1994)

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vigna, S. (2004). Reachability Problems in Entity-Relationship Schema Instances. In: Atzeni, P., Chu, W., Lu, H., Zhou, S., Ling, TW. (eds) Conceptual Modeling – ER 2004. ER 2004. Lecture Notes in Computer Science, vol 3288. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30464-7_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30464-7_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23723-5

  • Online ISBN: 978-3-540-30464-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics