Constraint acquisition for Entity-Relationship models

Data and Knowledge Engineering

Volumn 68, Issue 10, 2009, Pages 1128-1155

  Hartmann, Sven ^a   Link, Sebastian ^b   Trinh, Thu ^a  

^a CLAUSTHAL UNIVERSITY OF TECHNOLOGY   (Germany)

^b VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

Author keywords

Conceptual database; Knowledge acquisition; Propositional logic; Semantic constraint

Indexed keywords

APPLICATION DOMAINS; CONCEPTUAL DATABASE; CONCEPTUAL DATABASE DESIGN; DECISION SUPPORTS; DOMAIN KNOWLEDGE; ENTITY-RELATIONSHIP MODEL; INTEGRITY CONSTRAINTS; PROPOSITIONAL LOGIC; SAMPLE DATABASE; SEARCH ALGORITHMS; SEMANTIC CONSTRAINT; SEMANTIC KNOWLEDGE; TARGET DATABASE;

DECISION SUPPORT SYSTEMS; KNOWLEDGE ACQUISITION; LEARNING ALGORITHMS; MERGERS AND ACQUISITIONS; MULTI AGENT SYSTEMS; SEMANTICS;

DATABASE SYSTEMS;

EID: 69249216368     PISSN: 0169023X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.datak.2009.06.001     Document Type: Article

References (112)

1. Armstrong W.W. Dependency structures of database relationships. Inform. Process. 74 (1974) 580-583
2. Beeri C., Dowd M., Fagin R., and Statman R. On the structure of armstrong relations for functional dependencies. J. ACM 31 1 (1984) 30-46
3. Bogdanova G., and Georgieva T. Using error-correcting dependencies for collaborative filtering. Data Knowl. Eng. 66 3 (2008) 402-413
4. Bonchi F., and Lucchese C. Extending the state-of-the-art of constraint-based pattern discovery. Data Knowl. Eng. 60 2 (2007) 377-399
5. Demetrovics J., and Gyepesi G. A note on minimal matrix representation of closure operations. Combinatorica 2 (1983) 177-179
6. J. Demetrovics, L. Ronyai, H. Son, On the representation of dependencies by propositional logic, in: MFDBS 1991, Lecture Notes in Computer Science, vol. 495, Springer, 1991, pp. 230-242.
7. Demetrovics J., Ronyai L., and Son H. Dependency types. Comput. Math. Appl. 21 1 (1991) 25-33
8. R. Fagin, Armstrong databases, Technical Report RJ3440(40926), IBM Research Laboratory, San Jose, California, USA, 1982.
9. Fagin R. Horn clauses and database dependencies. J. ACM 29 4 (1982) 952-985
10. Fagin R., and Vardi M. Armstrong databases for functional and inclusion dependencies. Inf. Process. Lett. 16 1 (1983) 13-19
11. Georgieva T. Discovering branching and fractional dependencies in databases. Data Knowl. Eng. 66 2 (2008) 311-325
12. Gottlob G., and Libkin L. Investigation on armstrong relations, dependency inference, and excluded functional dependencies. Acta Cybern. 9 4 (1990) 385-402
13. Grant J., and Jacobs B. On the family of generalized dependency constraints. J. ACM 29 4 (1982) 986-997
14. G. Katona, K. Tichler, Some contributions to the minimum representation problem of key systems, in: FoIKS, LNCS, vol. 3861, Springer, 2006, pp. 240-257.
15. Khardon R., Mannila H., and Roth D. Reasoning with examples: propositional formulae and database dependencies. Acta Inf. 36 4 (1999) 267-286
16. Mannila H., and Räihä K.-J. Design by example: an application of armstrong relations. J. Comput. Syst. Sci. 33 2 (1986) 126-141
17. H. Mannila, K.-J. Räihä, Test data for relational queries, in: Proceedings of the Fifth SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, ACM, 1985, pp. 217-223.
18. De Marchia F., and Petit J.-M. Semantic sampling of existing databases through informative armstrong databases. Inf. Syst. 32 3 (2007) 446-457
19. Sagiv Y., Delobel C., Parker Jr. D.S., and Fagin R. An equivalence between relational database dependencies and a fragment of propositional logic. J. ACM 28 3 (1981) 435-453
20. Fagin R. Multivalued dependencies and a new normal form for relational databases. Trans. Database Syst. 2 3 (1977) 262-278
21. Thalheim B. Dependencies in Relational Databases (1991), Teubner-Verlag
22. Berman J., and Blok W. Positive Boolean dependencies. Inform. Process. Lett. 27 (1988) 147-150
23. Hartmann S., and Link S. Characterising nested database dependencies by fragments of propositional logic. Ann. Pure Appl. Logic 152 1-3 (2008) 84-106
24. Sagiv Y., Delobel C., Parker Jr. D.S., and Fagin R. Correction to an equivalence between relational database dependencies and a fragment of propositional logic. J. ACM 34 4 (1987) 1016-1018
25. J. Marques-Silva, Practical applications of Boolean satisfiability, in: Ninth International Workshop on Discrete Event Systems - WODES 2008, IEEE Computer Society, 2008, pp. 74-80.
26. Chen P.P. The entity-relationship model: towards a unified view of data. Trans. Database Syst. (TODS) 1 (1976) 9-36
27. Thalheim B. Entity-Relationship Modeling: Foundations of Database Technology (2000), Springer
28. Chen P.P. English sentence structure and entity-relationship diagrams. Inform. Sci. 29 (1983) 127-149
29. S. Hartmann, S. Link, English sentence structures and EER modelling, in: Fourth Asia-Pacific Conference on Conceptual Modelling (APCCM2007), CRPIT, vol. 67, ACS, 2007, pp. 27-35.
30. Moreno-Capuchino A., Juristo Juzgado N., and Van de Riet R. Formal justification in object-oriented modelling: a linguistic approach. Data Knowl. Eng. 33 1 (2000) 25-47
31. Moody D., and Shanks G. Improving the quality of data models: empirical validation of a quality management framework. Inf. Syst. 28 6 (2003) 619-650
32. Greco G., Guzzo A., and Pontieri L. Mining taxonomies of process models. Data Knowl. Eng. 67 1 (2008) 74-102
33. Greco G., Guzzo A., Pontieri L., and Sacca D. Discovering expressive process models by clustering log traces. IEEE Trans. Knowl. Data Eng. 18 8 (2006) 1010-1027
34. Lu R., Sadiq S., and Governatori G. On managing business processes variants. Data Knowl. Eng. 68 7 (2009) 642-664
35. Hunter A., and Summerton R. Merging news reports that describe events. Data Knowl. Eng. 59 1 (2006) 1-24
36. Hunter A. Merging structured text using temporal knowledge. Data Knowl. Eng. 41 1 (2002) 29-66
37. Antoniou G., Bikakis A., Dimaresis N., Genetzakis M., Georgalis G., Governatori G., Karouzaki E., Kazepis N., Kosmadakis D., Kritsotakis M., Lilis G., Papadogiannakis A., Pediaditis P., Terzakis C., Theodosaki R., and Zeginis D. Proof explanation for a nonmonotonic semantic web rules language. Data Knowl. Eng. 64 3 (2008) 662-687
38. Batini C., Ceri S., and Navathe S.B. Conceptual Database Design: An Entity-Relationship Approach (1992), Benjamin Cummings
39. Elmasri R., and Navathe S. Fundamentals of Database Systems. fourth ed. (2003), Addison-Wesley
40. Thalheim B. Foundations of entity-relationship modeling. Ann. Math. Artif. Intell. 6 (1992) 197-256
41. Demetrovics J. On the equivalence of candidate keys with Sperner systems. Acta Cybern. 4 (1980) 247-252
42. Bernstein P. Synthesizing third normal form relations from functional dependencies. Trans. Database Syst. 1 4 (1976) 277-298
43. J. Biskup, U. Dayal, P. Bernstein, Synthesizing independent database schemas, in: SIGMOD Conference, 1979, pp. 143-151.
44. Codd E.F. A relational model of data for large shared data banks. Commun. ACM 13 6 (1970) 377-387
45. E.F. Codd, Further normalization of the database relational model, in: Courant Computer Science Symposia 6: Data Base Systems, Prentice-Hall, 1972, pp. 33-64.
46. Arenas M., and Libkin L. A normal form for XML documents. Trans. Database Syst. 29 1 (2004) 195-232
47. S. Hartmann, T. Trinh, Axiomatising functional dependencies for XML with frequencies, in: FoIKS 2006: Proceedings of the Fourth International Symposium on Foundations of Information and Knowledge Systems, Lecture Notes in Computer Science, vol. 3861, Springer, 2006, pp. 159-178.
48. Levene M., and Loizou G. Axiomatisation of functional dependencies in incomplete relations. Theor. Comput. Sci. 206 1-2 (1998) 283-300
49. Tari Z., Stokes J., and Spaccapietra S. Object normal forms and dependency constraints for object-oriented schemata. Trans. Database Syst. 22 (1997) 513-569
50. Weddell G. Reasoning about functional dependencies generalized for semantic data models. Trans. Database Syst. 17 1 (1992) 32-64
51. Wijsen J. Temporal FDs on complex objects. Trans. Database Syst. 24 1 (1999) 127-176
52. Delobel C. Normalisation and hierarchical dependencies in the relational data model. Trans. Database Syst. 3 3 (1978) 201-222
53. Hartmann S., and Link S. On inferences of weak multivalued dependencies. Fundam. Inform. 92 1-2 (2009) 83-102
54. Link S. Charting the completeness frontier of inference systems for multivalued dependencies. Acta Inf. 45 7-8 (2008) 565-591
55. Link S. On the implication of multivalued dependencies in partial database relations. Int. J. Found. Comput. Sci. 19 3 (2008) 691-715
56. S. Link, Spoilt for choice: full first-order hierarchical decompositions, in: Proceedings of 16th International Workshop on Logic, Language, Information and Computation - WoLLIC 2009, Lecture Notes in Artificial Intelligence, vol. 5514, Springer, 2009, pp. 256-267.
57. S. Hartmann, S. Link, T. Trinh, Boolean constraints for XML modeling, in: Information Modelling and Knowledge Bases, Frontiers in Artificial Intelligence and Applications, vol. 190, IOS Press, 2008, pp. 85-104.
58. Beeri C., and Bernstein P.A. Computational problems related to the design of normal form relational schemata. ACM Trans. Database Syst. 4 1 (1979) 30-59
59. Galil Z. An almost linear-time algorithm for computing a dependency basis in a relational database. J. ACM 29 1 (1982) 96-102
60. Enderton H. A Mathematical Introduction to Logic. second ed. (2001), Academic Press
61. Beth E. The Foundations of Mathematics (1959), North-Holland
62. Hintikka K. Form and content in quantification theory. Acta Philos. Fenica 8 (1955) 7-55
63. Gentzen G. Untersuchungen über das logische Schließen. Math. Zeitschrift 39 (1935) 176-210 405-431
64. Smullyan R. First-Order Logic (1995), Dover Publications
65. J. Gu, P. Purdom, J. Franco, B. Wah, Algorithms for the satisfiability (sat) problem: a survey, in: Satisfiability Problem: Theory and Applications, Amer. Math. Soc., 1997, pp. 19-152.
66. Kautz H., and Selman B. The state of SAT. Dis. Appl. Math. 155 12 (2007) 1514-1524
67. O. Grumberg, A. Schuster, A. Yadgar, Memory efficient all-solutions SAT solver and its application for reachability analysis, in: Fifth International Conference on Formal Methods in Computer-Aided Design, Lecture Notes in Computer Science, vol. 3312, Springer, 2004, pp. 275-289.
68. H. Jin, F. Somenzi, Prime clauses for fast enumeration of satisfying assignments to Boolean circuits, in: Proceedings of the 42nd Design Automation Conference, 2005, pp. 750-753.
69. Maier D. Minimum covers in relational database model. J. ACM 27 4 (1980) 664-674
70. S. Cook, The complexity of theorem-proving procedures, in: ACM Symposium on Theory of Computing, 1971, pp. 151-158.
71. Yu P., Chen M.-S., Heiss H.-U., and Lee S. On workload characterization of relational database environments. Trans. Software Eng. 18 4 (1992) 347-355
72. Transaction Processing Process Council, TPC-A,TPC-D,TPC-E,TPC-H,TPC-R,TPC-W, 2008, .
73. S. Cook, D. Mitchell, Finding hard instances of the satisfiability problem: a survey, in: Satisfiability Problem: Theory and Applications, Amer. Math. Soc., 1997, pp. 1-17.
74. R. Dechter, A. Itai, Finding all solutions if you can find one, in: Proceedings of the Workshop on Tractable Reasoning - AAAI 92, 1992, pp. 35-39.
75. M. Albrecht, E. Buchholz, A. Düsterhöft, B. Thalheim, An informal and efficient approach for obtaining semantic constraints using sample data and natural language processing, in: Semantics in Databases, LNCS, vol. 1358, Springer, 1995, pp. 1-28.
76. Halpin T., and Morgan T. Information Modeling and Relational Databases (2008), Morgan Kaufman
77. T. Halpin, Object-role modeling (ORM/NIAM, in: Handbook on Architectures of Information Systems, Springer, 1998, pp. 81-102.
78. T. Halpin, J. McCormack, Automated validation of conceptual schema constraints, in: CAiSE 1992, 1992, pp. 445-462.
79. Moody D. Theoretical and practical issues in evaluating the quality of conceptual models: current state and future directions. Data Knowl. Eng. 55 3 (2005) 243-276
80. Enders A., and Romback H. A Handbook of Software and Systems Engineering; Empirical Overservations, Laws and Theories (2003), Addison-Wesley
81. Lauesen S., and Vinter O. Preventing requirement defects: an experiment in process improvement. Requir. Eng. 6 1 (2001) 37-50
82. Martin J. Information Engineering (1989), Prentice-Hall
83. Standish Group, The CHAOS report, The Standish Group International, 1994, .
84. Standish Group, Unfinished voyages, The Standish Group International, 1995, .
85. Boehm B. Software Engineering Economics (1981), Prentice-Hall
86. R. Zultner, The deming way: total quality management for software, in: Proceedings of Total Quality Management for Software, 1992, pp. 134-145.
87. Browne G., and Ramesh V. Improving information requirements determination: a cognitive perspective. Inform. Manage. 39 8 (2002) 625-645
88. Chandra A., and Krovi R. Representational congruence and information retrieval: towards an extended model of cognitive fit. Dec. Support Syst. 25 4 (1999) 271-288
89. Wand Y., and Weber R. Research commentary: information systems and conceptual modeling - a research agenda. Inform. Syst. Res. 13 4 (2002) 363-376
90. Vincent M. Semantic foundations of 4NF in relational database design. Acta Inf. 36 3 (1999) 173-213
91. D. Moody, Dealing with complexity: a practical method for representing large entity-relationship models, Ph.D. Thesis, Dept. of Information Systems, University of Melbourne, 2001.
92. Simsion G. Data Modeling Essential - Analysis. Design and Innovation (1994), Van Nostrand Reinhold, New York
93. M. Wu, The practical need for fourth normal form, in: Proceedings of the 23rd SIGCSE Technical Symposium on Computer Science Education, ACM, 1992, pp. 19-23.
94. B. Thalheim, Conceptual treatment of multivalued dependencies, in: Conceptual Modeling - ER 2003, Proceedings, Lecture Notes in Computer Science, vol. 2813, Springer, 2003, pp. 363-375.
95. Biskup J., and Polle T. Decomposition of object-oriented database schemas. Ann. Math. Artif. Intell. 33 2-4 (2001) 119-155
96. Hartmann S. Decomposing relationship types by pivoting and schema equivalence. Data Knowl. Eng. 39 1 (2001) 75-99
97. Levene M., and Loizou G. A Guided Tour of Relational Databases and Beyond (1999), Springer
98. C. Hara, S. Davidson, Reasoning about nested functional dependencies, in: Proceedings of the 18th SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, ACM, 1999, pp. 91-100.
99. Hartmann S., Link S., and Schewe K.-D. Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets. Theor. Comput. Sci. 355 2 (2006) 167-196
100. Hartmann S., Link S., and Schewe K.-D. Functional and multivalued dependencies in nested databases generated by record and list constructor. Ann. Math. Artif. Intell. 46 1-2 (2006) 114-164
101. Ito M., and Weddell G. Implication problems for functional constraints on databases supporting complex objects. J. Comput. Syst. Sci. 49 3 (1994) 726-768
102. Levene M., and Loizou G. Semantics for null extended nested relations. Trans. Database Syst. 18 3 (1993) 414-459
103. S. Hartmann, H. Koehler, S. Link, T. Trinh, J. Wang, On the notion of an XML key, in: Proceedings of the Third International Workshop on Semantics in Data and Knowledge Bases (SDKB), Lecture Notes in Computer Science, vol. 4925, Springer, 2007, pp. 103-112.
104. Hartmann S., and Link S. Efficient reasoning about a robust XML key fragment. ACM Trans. Database Syst. 34 2 (2009) 33p
105. S. Hartmann, S. Link, Expressive, yet tractable XML keys, in: Proceedings of 12th International Conference on Extending Database Technology - EDBT 2009, International Conference Proceeding Series, vol. 360, ACM, 2009, pp. 357-367.
106. Kolahi S. Dependency-preserving normalization of relational and XML data. J. Comput. Syst. Sci. 73 4 (2007) 636-647
107. Vincent M., Liu J., and Liu C. Strong functional dependencies and their application to normal forms in XML. Trans. Database Syst. 29 3 (2004) 445-462
108. Vincent M., Liu J., and Mohania M. On the equivalence between FDs in XML and FDs in relations. Acta Inf. 44 3-4 (2007) 207-247
109. Arenas M., and Libkin L. An information-theoretic approach to normal forms for relational and XML data. J. ACM 52 2 (2005) 246-283
110. Genevés P., and Layaïda N. Deciding XPath containment with MSO. Data Knowl. Eng. 63 1 (2007) 108-136
111. Levene M., and Loizou G. Database design for incomplete relations. ACM Trans. Database Syst. 24 1 (1999) 80-125
112. Mok W. On utilizing variables for specifying FDs in data-centric XML documents. Data Knowl. Eng. 60 3 (2007) 494-510