Skip to main content
SpringerLink
Log in

Soft Constraints and Heuristic Constraint Correction in Entity-Relationship Modelling

  • Conference paper
  • First Online:
Semantics in Databases (SiD 2001)

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

Included in the following conference series:

Abstract

In entity-relationship modelling, cardinality constraints impose restrictions on the number of occurrences of objects in relationships. If violations may appear, cardinality constraints should be treated as soft constraints rather than as integrity constraints. Nevertheless one often expects them to be satisfied at least in average or up to a small number of exceptions. These expectations may compete each other and cause new kinds of inconsistencies. We discuss how these inconsistencies can be detected and repaired.

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

Access this chapter

Log in via an institution
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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Albrecht, E. Buchholz, A. Düsterhöft, and B. Thalheim. An informal and efficient approach for obtaining semantic constraints using sample data and natural language processing. LNCS, 1358:1–11, 1996.

    Google Scholar 

  2. D. Calvanese and M. Lenzerini. On the interaction between ISA and cardinality constraints. In Proc. of Tenth Int. Conf. on Data Engin., pp. 204–213, 1994.

    Google Scholar 

  3. B. V. Cherkassy and A. V. Goldberg. Negative cycle detection algorithms. Math. Programming, 85:277–311, 1998.

    Article  Google Scholar 

  4. B. V. Cherkassy, A. V. Goldberg, and T. Radzik. Shortest path algorithms: theory and experimental evaluation. Math. Programming, 73:129–174, 1996.

    MathSciNet  Google Scholar 

  5. E. Di Nitto and L. Tanca. Dealing with deviations in DBMSs: an approach to revise consistency constraints. Integrity in Databases, FMLDO96, pp. 11–24. 1996.

    Google Scholar 

  6. A. V. Goldberg and T. Radzik. A heuristic improvement of the Bellman-Ford algorithm. Appl. Math. Letters, 6:3–6, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  7. M. Gondran and M. Minoux. Graphs and algorithms. Wiley, Chichecter, 1990.

    Google Scholar 

  8. S. Hartmann. Graphtheoretic methods to construct entity-relationship databases. LNCS, 1017:131–145, 1995.

    Google Scholar 

  9. S. Hartmann. On the consistency of int-cardinality constraints. LNCS, 1507:150–163, 1998.

    Google Scholar 

  10. S. Hartmann. On the implication problem for cardinality constraints and functional dependencies. Annals Math. Artificial Intell., 33:253–307, 2001.

    Article  MathSciNet  Google Scholar 

  11. S. Hartmann. Coping with inconsistent constraint specifications. LNCS, 2224:241–255, 2001.

    Google Scholar 

  12. W. Kent. Consequences of assuming a universal relation. ACM Trans. Database Syst., 6:539–556, 1981.

    Article  Google Scholar 

  13. S. G. Kolliopoulos and C. Stein. Finding real-valued single source shortest paths in o(n 3) expected time. In Proc. 5th Int. Prog. Combin. Opt. Conf. 1996.

    Google Scholar 

  14. K. Kwast. A deontic approach to database integrity. Annals Math. Artificial Intell., 9:205–238, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  15. M. L Lee and T. W. Ling. Resolving constraint confiicts in the integration of entityrelationship schemas. LNCS, 1331:394–407, 1997.

    Google Scholar 

  16. M. Lenzerini and P. Nobili. On the satisfability of dependency constraints in entity-relationship schemata. Inform. Systems, 15:453–461, 1990.

    Article  Google Scholar 

  17. S. W. Liddle, D. W. Embley, and S. N. Woodfield. Cardinality constraints in semantic data models. Data Knowledge Engrg., 11:235–270, 1993.

    Article  MATH  Google Scholar 

  18. H. Mannila and K. Räihä. The design of relational databases. Addison-Wesley, Reading, 1992.

    MATH  Google Scholar 

  19. J.-J. Ch. Meyer, R. J. Wieringa, and F. P. M. Dignum. The role of deontic logic in the specification of information systems. In J. Chomicki and G. Saake, editors, Logics for databases and information systems, pages 71–116. Kluwer, Dordrecht, 1998.

    Google Scholar 

  20. R. E. Tarjan. Data structures and network algorithms. SIAM, Philadelphia, 1983.

    Google Scholar 

  21. B. Thalheim. Foundations of entity-relationship modeling. Annals Math. Artificial Intell., 6:197–256, 1992.

    MathSciNet  Google Scholar 

  22. B. Thalheim. Entity-relationship modeling. Springer, Berlin, 2000.

    MATH  Google Scholar 

  23. D. Theodorates. Deductive object oriented schemas. LNCS, 1157:58–72, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Information Systems & Information Science Research Centre, Massey University, Palmerston North, New Zealand

    Sven Hartmann

Authors
  1. Sven Hartmann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, Carleton University, Herzberg Building, 1125 Colonel By Drive, K1S 5B6, Ottawa, Canada

    Leopoldo Bertossi

  2. Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences, P.O. Box 127, 1364, Budapest, Hungary

    Gyula O. H. Katona

  3. Department of Information Systems, Massey University, Private Bag 11222, Palmerston North, New Zealand

    Klaus-Dieter Schewe

  4. Institute of Computer Science, Brandenburg University of Technology at Cottbus, P.O. Box 10 13 44, 03013, Cottbus, Germany

    Bernhard Thalheim

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hartmann, S. (2003). Soft Constraints and Heuristic Constraint Correction in Entity-Relationship Modelling. In: Bertossi, L., Katona, G.O.H., Schewe, KD., Thalheim, B. (eds) Semantics in Databases. SiD 2001. Lecture Notes in Computer Science, vol 2582. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36596-6_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-36596-6_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00957-3

  • Online ISBN: 978-3-540-36596-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation