Armstrong Databases: Validation, Communication and Consolidation of Conceptual Models with Perfect Test Data

Conceptual models are relational database schemata that result from conceptual data modeling. Conceptual models usually capture the semantics of the underlying application domain inadequately. Therefore, the structure of the conceptual model is often inadequate, too. Academic and commercial database design tools often advocate the use of good test data to validate the adequacy of the conceptual models they produce. In this article we provide evidence that Armstrong databases constitute perfect test data. In particular, Armstrong databases capture perfectly the perceptions of the design team about the semantics of the application domain. Therefore, Armstrong databases serve as an excellent medium to validate and consolidate the understanding of an application domain's semantics, and to communicate this understanding between different stakeholders of the target database. An overview is given about recent advancements on the structural and computational properties of Armstrong databases. These advancements suggest that Armstrong databases provide the foundations necessary to establish an agile database design methodology. Such a methodology complements existing approaches to database design, and is not meant to replace them.

[1]  Hannu Toivonen,et al.  TANE: An Efficient Algorithm for Discovering Functional and Approximate Dependencies , 1999, Comput. J..

[2]  Y. Edmund Lien,et al.  On the Equivalence of Database Models , 1982, JACM.

[3]  Donald D. Chamberlin,et al.  SEQUEL: A structured English query language , 1974, SIGFIDET '74.

[4]  Jean-Marc Petit,et al.  Unary and n-ary inclusion dependency discovery in relational databases , 2009, Journal of Intelligent Information Systems.

[5]  Edward Grossman ACM Queue , 2003, CIE.

[6]  Alvaro Cortés-Calabuig,et al.  Constraints in RDF , 2010, SDKB.

[7]  Jeffrey D. Ullman,et al.  Principles of Database and Knowledge-Base Systems, Volume II , 1988, Principles of computer science series.

[8]  Marcelo Arenas,et al.  A normal form for XML documents , 2004, TODS.

[9]  E. F. Codd,et al.  Extending the database relational model to capture more meaning , 1979, ACM Trans. Database Syst..

[10]  Daniel Gooch,et al.  Communications of the ACM , 2011, XRDS.

[11]  Bernhard Thalheim,et al.  Entity-relationship modeling - foundations of database technology , 2010 .

[12]  Georg Lausen,et al.  SPARQLing constraints for RDF , 2008, EDBT '08.

[13]  Ronald Fagin,et al.  Multivalued dependencies and a new normal form for relational databases , 1977, TODS.

[14]  F. E. A Relational Model of Data Large Shared Data Banks , 2000 .

[15]  Michael Rys Scalable SQL , 2011, CACM.

[16]  János Demetrovics,et al.  Some Remarks On Generating Armstrong And Inferring Functional Dependencies Relation , 1995, Acta Cybern..

[17]  Jane Grimson,et al.  Journal of Software Maintenance and Evolution: Research and Practice Consistent Database Sampling as a Database Prototyping Approach , 2022 .

[18]  Beng Chin Ooi,et al.  On multi-column foreign key discovery , 2010, Proc. VLDB Endow..

[19]  Gyula O. H. Katona,et al.  Some Contributions to the Minimum Representation Problem of Key Systems , 2006, FoIKS.

[20]  Sven Hartmann,et al.  On the implication problem for cardinality constraints and functional dependencies , 2001, Annals of Mathematics and Artificial Intelligence.

[21]  Mark Levene,et al.  Null Inclusion Dependencies in Relational Databases , 1997, Inf. Comput..

[22]  Chengfei Liu,et al.  Strong functional dependencies and their application to normal forms in XML , 2004, TODS.

[23]  Paul Brown,et al.  GORDIAN: efficient and scalable discovery of composite keys , 2006, VLDB.

[24]  Wenfei Fan,et al.  Keys for XML , 2002, Comput. Networks.

[25]  Sven Hartmann,et al.  Design by example for SQL table definitions with functional dependencies , 2012, The VLDB Journal.

[26]  Jeffrey D. Ullman,et al.  Principles Of Database And Knowledge-Base Systems , 1979 .

[27]  Dan Olteanu,et al.  10106 Worlds and Beyond: Efficient Representation and Processing of Incomplete Information , 2007, ICDE.

[28]  Adnan Yazici,et al.  A complete axiomatization for fuzzy functional and multivalued dependencies in fuzzy database relations , 2001, Fuzzy Sets Syst..

[29]  Sven Hartmann,et al.  Numerical constraints on XML data , 2010, Inf. Comput..

[30]  Avelyn Davidson,et al.  Happy Birthday , 1997 .

[31]  Carlo Zaniolo Database relations with null values , 1982, PODS '82.

[32]  Philip A. Bernstein,et al.  Computational problems related to the design of normal form relational schemas , 1979, TODS.

[33]  Jeffrey D. Uuman Principles of database and knowledge- base systems , 1989 .

[34]  Limsoon Wong,et al.  Semantic representations and query languages for or-sets , 1993, PODS '93.

[35]  Maurizio Lenzerini,et al.  On The Satisfiability of Dependency Constraints in Entity-Relationship Schemata , 1987, VLDB.

[36]  Bernhard Thalheim,et al.  Dependencies in relational databases , 1991, Teubner-Texte zur Mathematik.

[37]  Sven Hartmann,et al.  When data dependencies over SQL tables meet the logics of paradox and S-3 , 2010, PODS '10.

[38]  Thomas Schwentick,et al.  Two-variable logic on data trees and XML reasoning , 2009, JACM.

[39]  Ronald Fagin,et al.  The theory of data dependencies - a survey , 1984 .

[40]  Sven Hartmann,et al.  Codd Table Representations under Weak Possible World Semantics , 2011, DEXA.

[41]  Tomasz Imielinski,et al.  Incomplete Information in Relational Databases , 1984, JACM.

[42]  Sven Hartmann Reasoning about participation constraints and Chen's constraints , 2003, ADC.

[43]  Shamim A. Naqvi,et al.  Using Constraints for Efficient Query Processing in Nondeterministic Databases , 1995, IEEE Trans. Knowl. Data Eng..

[44]  Heikki Mannila,et al.  Algorithms for Inferring Functional Dependencies from Relations , 1994, Data Knowl. Eng..

[45]  Wojciech Ziarko,et al.  The Discovery, Analysis, and Representation of Data Dependencies in Databases , 1991, Knowledge Discovery in Databases.

[46]  Jean-Marc Petit,et al.  Analysis of existing databases at the logical level: the DBA companion project , 2003, SGMD.

[47]  Professor Dr. Bernhard Thalheim Entity-Relationship Modeling , 2000, Springer Berlin Heidelberg.

[48]  Bernhard Thalheim,et al.  Fundamentals of Cardinality Constraints , 1992, ER.

[49]  Sven Hartmann,et al.  Efficient reasoning about a robust XML key fragment , 2009, TODS.

[50]  Georg Gottlob,et al.  Identifying the Minimal Transversals of a Hypergraph and Related Problems , 1995, SIAM J. Comput..

[51]  Wenfei Fan,et al.  Integrity constraints for XML , 2000, PODS.

[52]  Heikki Mannila,et al.  Design of Relational Databases , 1992 .

[53]  Ronald Fagin,et al.  Horn clauses and database dependencies , 1982, JACM.

[54]  Michael Rys Scalable SQL , 2011 .

[55]  Jean-Marc Petit,et al.  Semantic sampling of existing databases through informative Armstrong databases , 2007, Inf. Syst..

[56]  Erik Meijer,et al.  A co-Relational Model of Data for Large Shared Data Banks , 2011, ECOOP.

[57]  David Maier,et al.  The Theory of Relational Databases , 1983 .

[58]  Mark Levene,et al.  A guided tour of relational databases and beyond , 1999 .

[59]  Gary Anthes,et al.  Happy Birthday, RDBMS! , 2010, Commun. ACM.

[60]  Heikki Mannila,et al.  Design by Example: An Application of Armstrong Relations , 1986, J. Comput. Syst. Sci..

[61]  Georg Gottlob,et al.  Investigations on Armstrong relations, dependency inference, and excluded functional dependencies , 1990, Acta Cybern..

[62]  Paolo Atzeni,et al.  Functional Dependencies and Constraints on Null Values in Database Relations , 1986, Inf. Control..

[63]  Ronald Fagin,et al.  Armstrong Databases for Functional and Inclusion Dependencies , 1983, Inf. Process. Lett..

[64]  Tomasz Imielinski,et al.  Complexity Tailored Design: A New Design Methodology for Databases With Incomplete Information , 1995, J. Comput. Syst. Sci..

[65]  János Demetrovics,et al.  Armstrong Relations, Functional Dependencies and Strong Dependencies , 1995, Comput. Artif. Intell..

[66]  Jane Grimson,et al.  Database sampling with functional dependencies , 2001, Inf. Softw. Technol..

[67]  Sebastian Link,et al.  Empirical evidence for the usefulness of Armstrong relations in the acquisition of meaningful functional dependencies , 2010, Inf. Syst..

[68]  János Demetrovics,et al.  On the equivalence of candidate keys with Sperner systems , 1979, Acta Cybern..

[69]  Dan Olteanu,et al.  $${10^{(10^{6})}}$$ worlds and beyond: efficient representation and processing of incomplete information , 2006, 2007 IEEE 23rd International Conference on Data Engineering.

[70]  Michael Eichberg,et al.  A Handbook of Software and Systems Engineering , 2009 .

[71]  David W. Embley,et al.  Cardinality Constraints in Semantic Data Models , 1993, Data Knowl. Eng..

[72]  Giuseppe Di Battista,et al.  26 Computer Networks , 2004 .

[73]  Mark Levene,et al.  Axiomatisation of Functional Dependencies in Incomplete Relations , 1998, Theor. Comput. Sci..

[74]  Catriel Beeri,et al.  A complete axiomatization for functional and multivalued dependencies in database relations , 1977, SIGMOD '77.

[75]  Sven Hartmann,et al.  On Codd Families of Keys over Incomplete Relations , 2011, Comput. J..

[76]  Ian G. MacDonald,et al.  Information Engineering , 2019, Information Systems Design Methodologies: Improving the Practice.

[77]  Albert Endres,et al.  A handbook of software and systems engineering - empirical observations, laws and theories , 2003, The Fraunhofer IESE series on software engineering.

[78]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

[79]  Richard Statman,et al.  On the Structure of Armstrong Relations for Functional Dependencies , 1984, JACM.

[80]  Barry W. Boehm,et al.  Software Engineering Economics , 1993, IEEE Transactions on Software Engineering.

[81]  Michel A. Melkanoff,et al.  A Method for Helping Discover the Dependencies of a Relation , 1979, Advances in Data Base Theory.

[82]  Sven Hartmann,et al.  A Precious Class of Cardinality Constraints for Flexible XML Data Processing , 2011, ER.