On Codd families of keys over incomplete relations

Computer Journal

Volumn 54, Issue 7, 2011, Pages 1166-1180

  Hartmann, Sven ^a   Leck, Uwe ^b   Link, Sebastian ^c  

^a CLAUSTHAL UNIVERSITY OF TECHNOLOGY   (Germany)

^b UNIVERSITY OF WISCONSIN MADISON   (United States)

^c VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

Author keywords

Armstrong relation; axiomatization; extremal problem; implication problem; incomplete relation; key; relational database

Indexed keywords

ARMSTRONG RELATIONS; AXIOMATIZATION; EXTREMAL PROBLEMS; IMPLICATION PROBLEM; INCOMPLETE RELATION; KEY; RELATIONAL DATABASE;

ALGORITHMS; DATA HANDLING;

RELATIONAL DATABASE SYSTEMS;

EID: 79960128556     PISSN: 00104620     EISSN: 14602067     Source Type: Journal    
DOI: 10.1093/comjnl/bxq073     Document Type: Article

References (90)

1. Codd, E.F. (1970)A relational model of data for large shared data banks. Commun. ACM, 13, 377-387.
2. Abiteboul, S., Hull, R. and Vianu, V. (1995) Foundations of Databases. Addison-Wesley, Reading, MA.
3. Fagin, R. (1981) A normal form for relational databases that is based on domains and keys. ACM Trans. Database Syst., 6, 387-415. (Pubitemid 12503775)
4. Maier, D. (1983) The Theory of Relational Databases. Computer Science Press, Rockville, MD.
5. Codd, E.F. (1986) Missing information (applicable and inapplicable) in relational databases. SIGMOD Rec., 15, 53-78.
6. Zaniolo, C. (1984) Database relations with null values. J. Comput. Syst. Sci., 28, 142-166.
7. Lien, E. (1982) On the equivalence of database models. J. ACM, 29, 333-362.
8. Atzeni, P. and Morfuni, N. (1986) Functional dependencies and constraints on null values in database relations. Inf. Control, 70, 1-31. (Pubitemid 17511515)
9. Fagin, R. (1982) Armstrong Databases. Technical Report RJ3440(40926), IBM Research Laboratory, San Jose, CA, USA.
10. De Marchi, F., Lopes, S., Petit, J.-M. and Toumani, F. (2003) Analysis of existing databases at the logical level: the DBA companion project. SIGMOD Rec., 32, 47-52. (Pubitemid 40536098)
11. Langeveldt, W.-D. and Link, S. (2010) Empirical evidence for the usefulness of Armstrong relations in the acquisition of meaningful functional dependencies. Inf. Systems, 35, 352-374.
12. Mannila, H. and Räihä, K.-J. (1986) Design by example: an application ofArmstrong relations. J. Comput. Syst. Sci., 33, 126-141.
13. Levene, M. and Loizou, G. (1998) Axiomatisation of functional dependencies in incomplete relations. Theor. Comput. Sci., 206, 283-300. (Pubitemid 128451188)
14. Paulley, G. and Larson, P.-A. (1994) Exploiting Uniqueness in Query Optimization. Proc. 10th Int. Conf. Data Engineering (ICDE), Houston, USA, February 14-18, pp. 68-79. IEEE Computer Society.
15. Fagin, R. and Vardi, M. (1984) The Theory of Data Dependencies-an overview. Proc. 11th Colloquium on Automata, Languages and Programming (ICALP),Antwerp, Belgium, July 16-20, Lecture Notes in Computer Science 172, pp. 1-22. Springer.
16. Thalheim, B. (1991) Dependencies in Relational Databases. Teubner, Leipzig.
17. Codd, E.F. (1972) Further Normalization of the Database Relational Model. Proc. 1971 Courant Computer Science Symposia Series 6: Data Base Systems, New York, USA, May 24-25, pp. 33-64. Prentice Hall.
18. Beeri, C., Mendelzon, A.O., Sagiv, Y. and Ullman, J.D. (1981) Equivalence of relational database schemes. SIAM J. Comput., 10, 352-370.
19. Bernstein, P. (1976) Synthesizing third normal form relations from functional dependencies. ACM Trans. Database Syst., 1, 277-298.
20. Beeri, C., Bernstein, P.A. and Goodman, N. (1978) A Sophisticate's Introduction to Database Normalization Theory. Proc. 4th Int. Conf. Very Large Databases (VLDB),West Berlin, Germany, September 13-15, pp. 113-124. IEEE-CS.
21. Beeri, C. and Bernstein, P. (1979) Computational problems related to the design of normal form relational schemas. ACM Trans. Database Syst., 4, 30-59. (Pubitemid 9437762)
22. Biskup, J., Dayal, U. and Bernstein, P. (1979) Synthesizing Independent Database Schemas. Proc. ACM SIGMOD Int. Conf. Management of Data (SIGMOD), Boston, USA, May 30-June 1, pp. 143-151. ACM.
23. Maier, D. (1980) Minimum covers in relational database model. J. ACM, 27, 664-674.
24. Lucchesi, C. and Osborn, S. (1978) Candidate keys for relations. J. Comput. Syst. Sci., 17, 270-279.
25. Mannila, H. and Räihä, K.-J. (1994) Algorithms for inferring functional dependencies from relations. Data Knowl. Eng., 12, 83-99.
26. Biskup, J., Embley, D. and Lochner, J. (2008) Reducing inference control to access control for normalized database schemas. Inf. Process Lett., 106, 8-12. (Pubitemid 351199847)
27. Klug, A. and Price, R. (1982) Determining view dependencies using tableaux. ACM Trans. Database Syst., 7, 361-380.
28. Cheng, Q., Gryz, J., Koo, F., Leung, C., Liu, L., Qian, X. and Schiefer, K. (1999) Implementation of Two Semantic Query Optimization Techniques in DB2 Universal Database. Proc. 25th Int. Conf. Very Large Databases (VLDB), Edinburgh, Scotland, September 7-10, pp. 687-698. Morgan Kaufmann.
29. Deutsch,A., Ludäscher,B. and Nash,A. (2007) Rewriting queries using views with access patterns under integrity constraints. Theor. Comput. Sci., 371, 200-226. (Pubitemid 46215858)
30. Deutsch, A., Popa, L. and Tannen,V. (2006) Query reformulation with constraints. SIGMOD Rec., 35, 65-73. (Pubitemid 43383850)
31. Arenas, M., Fan,W. and Libkin, L. (2008) On the complexity of verifying consistency of XML specifications. SIAM J. Comput., 38, 841-880.
32. Arenas, M. and Libkin, L. (2004) A normal form for XML documents. ACM Trans. Database Syst., 29, 195-232.
33. Bojanczyk, M., Muscholl, A., Schwentick, T. and Segoufin, L. (2009) Two-variable logic on data trees and XML reasoning. J. ACM, 56, Article 13, 48p.
34. Buneman, P., Davidson, S., Fan,W., Hara, C. and Tan,W. (2003) Reasoning about keys for XML. Inf. Syst., 28, 1037-1063.
35. Fischer, P.C., Saxton, L.V., Thomas, S.J. and Van Gucht, D. (1985) Interactions between dependencies and nested relational structures. J. Comput. Syst. Sci., 31, 343-354. (Pubitemid 16522404)
36. Gottlob, G., Pichler, R. and Wei, F. (2010) Tractable database design and datalog abduction through bounded treewidth. Inf. Syst., 35, 278-298.
37. Hartmann, S. and Link, S. (2007) UnlockingKeys forXMLTrees. Proc. 11th Int. Conf. Database Theory (ICDT), Barcelona, Spain, January 10-12, Lecture Notes in Computer Science 4353, pp. 104-118. Springer.
38. Hartmann, S. and Link, S. (2008) Characterising nested database dependencies by fragments of propositional logic. Ann. Pure Appl. Log., 152, 84-106.
39. Hartmann, S., Köhler, H., Link, S., Trinh, T. andWang, J. (2008) On the Notion of an XML Key. Revised Selected Papers from the 3rd Int. Workshop on Semantics in Data and Knowledge Bases (SDKB), Nantes, France, March 29, Lecture Notes in Computer Science 4925, pp. 103-112. Springer.
40. Hartmann, S. and Link, S. (2009) Efficient reasoning about a robust XML key fragment. ACM Trans. Database Syst., 34, Article 10, 33p.
41. Hartmann, S. and Link, S. (2009) Expressive, Yet Tractable XML Keys. Proc. 12th Int. Conf. Extending Database Technology (EDBT), Saint Petersburg, Russia, March 24-26, ACM International Conference Proceeding Series 360, pp. 357- 367. ACM.
42. Hartmann, S. and Link, S. (2010) When Data Dependencies over SQL Tables Meet the Logics of Paradox and S-3. Proc. 29th ACM SIGMOD-SIGACT-SIGART Symp. Principles of Database Systems (PODS), Indianapolis, USA, June 6-11, pp. 317-326. ACM.
43. Jensen, C., Snodgrass, R. and Soo, M. (1996) Extending existing dependency theory to temporal databases. IEEE Trans. Knowl. Data Eng., 8, 563-582. (Pubitemid 126774379)
44. Kolahi, S. (2007) Dependency-preserving normalization of relational and XML data. J. Comput. Syst. Sci., 73, 636-647. (Pubitemid 46440978)
45. Sözat, M. and Yazici, A. (2001) A complete axiomatization for fuzzy functional and multivalued dependencies in fuzzy database relations. ACM Fuzzy Sets Syst., 117, 161-181.
46. Tari, Z., Stokes, J. and Spaccapietra, S. (1997) Object normal forms and dependency constraints for object-oriented schemata. ACM Trans. Database Syst., 22, 513-569. (Pubitemid 127449843)
47. Vincent, M., Liu, J. and Liu, C. (2004) Strong functional dependencies and their application to normal forms in XML. ACM Trans. Database Syst., 29, 445-462.
48. Weddell, G. (1992) Reasoning about functional dependencies generalized for semantic data models. ACM Trans. Database Syst., 17, 32-64. (Pubitemid 23609946)
49. Wijsen, J. (1999) Temporal FDs on complex objects. ACM Trans. Database Syst., 24, 127-176. (Pubitemid 129598107)
50. Link, S. (2001) Consistency Enforcement in Databases. Revised Papers from the 2nd Int. Workshop on Semantics in Databases, Dagstuhl Castle, Germany, January 7-12, Lecture Notes in Computer Science 2582, pp. 139-158. Springer.
51. Fan,W., Geerts, F., Jia, X. and Kementsietsidis, A. (2008) Conditional functional dependencies for capturing data inconsistencies. ACM Trans. Database Syst., 33, Article 6, 48p.
52. Davidson, S., Fan, W. and Hara, C. (2007) Propagating XML constraints to relations. J. Comput. Syst. Sci., 73, 316-361. (Pubitemid 46027078)
53. Chomicki, J. (2007) Consistent Query Answering: Five Easy Pieces. Proceedings of the 11th Int. Conf. Database Theory (ICDT), Barcelona, Spain, January 10-12, Lecture Notes in Computer Science 4353, pp. 1-17. Springer.
54. Fagin, R., Kolaitis, P., Popa, L. and Tan, W. (2009) Reverse Data Exchange: Coping with Nulls. Proc. 28th ACM SIGMODSIGACT- SIGART Symp. Principles of Database Systems (PODS), Providence, USA, June 19-July 1, pp. 23-32. ACM.
55. Libkin, L. (2006) Data Exchange and Incomplete Information. Proc. 25th ACM SIGACT-SIGMOD-SIGART Symp. Principles of Database Systems (PODS), Chicago, USA, June 26-28, pp. 60-69. ACM. (Pubitemid 46946467)
56. Miklau, G. and Suciu, D. (2007) A formal analysis of information disclosure in data exchange. J. Comput. Syst. Sci., 73, 507-534. (Pubitemid 46027076)
57. Cali, A., Calvanese, D., De Giacomo, G. and Lenzerini, M. (2004) Data integration under integrity constraints. Inf. Syst., 29, 147-163.
58. Miller, R., Hernandez, M., Haas, L.,Yan, L.-L., Ho, C., Fagin, R. and Popa, L. (2001) The Clio project: managing heterogeneity. SIGMOD Rec., 30, 78-83. (Pubitemid 33604427)
59. Demetrovics, J. (1980) On the equivalence of candidate keys with Sperner systems. Acta Cybern., 4, 247-252.
60. Demetrovics, J. and Gyepesi, G. (1983) A note on minimal matrix representation of closure operations. Combinatorica, 2, 177-179.
61. Katona, G. and Tichler, K. (2006) Some Contributions to the Minimum Representation Problem of Key Systems. Proc. 4th Int. Symp. Foundations of Information and Knowledge Systems (FoIKS), Budapest, Hungary, February 14-17, Lecture Notes in Computer Science 3861, pp. 240-257. Springer. (Pubitemid 43973751)
62. Sali,A. (2004) MinimalKeys in Higher-Order Datamodels. Proc. 3rd Int. Symp. Foundations of Information and Knowledge Systems (FoIKS),Wilhelminenburg Castle, Austria, February 17-20, Lecture Notes in Computer Science 2942, pp. 242-251. Springer.
63. Armstrong, W.W. (1974) Dependency structures of database relationships. Inf. Process., 74, 580-583.
64. Beeri, C., Dowd, M., Fagin, R. and Statman, R. (1984) On the structure of Armstrong relations for functional dependencies. J. ACM, 31, 30-46.
65. Demetrovics, J. and Thi, V. (1995) Armstrong relations, functional dependencies and strong dependencies. Comput. Artif. Intell., 14.
66. Fagin, R. and Vardi, M. (1983) Armstrong databases for functional and inclusion dependencies. Inf. Process. Lett., 16, 13-19. (Pubitemid 13528904)
67. Gottlob, G. and Libkin, L. (1990) Investigation on Armstrong relations, dependency inference, and excluded functional dependencies. Acta Cybern., 9, 385-402.
68. De Marchi, F. and Petit, J.-M. (2007) Semantic sampling of existing databases through informative Armstrong databases. Inf. Syst., 32, 446-457. (Pubitemid 44822640)
69. Sali, A. and Schewe, K.-D. (2008)Keys and Armstrong databases in trees with restructuring. Acta Cybern., 18, 529-556.
70. Sali, A. and Székely, L. (2008) On the Existence of Armstrong Instances with Bounded Domains. Proc. 5th Int. Symp. Foundations of Information and Knowledge Systems (FoIKS), Pisa, Italy, February 11-15, Lecture Notes in Computer Science 4932, pp. 151-157. Springer.
71. Vincent, M. and Srinivasan, B. (1993) Armstrong Relations for Functional and Multivalued Dependencies in Relational Databases. Proc. 4th Australian Database Conference (ADC), Brisbane,Australia, February 1-2, pp. 317-328.World Scientific.
72. Silva, A. and Melkanoff, M. (1979) A Method for Helping Discover the Dependencies of a Relation. Proc. Workshop on Formal Bases for Data Bases-Advances in Data Base Theory, Toulouse, France, December 12-14, pp. 115-133. Plemum Press.
73. Demetrovics, J. (1978) On the number of candidate keys. Inf. Process. Lett., 7, 266-269.
74. Demetrovics, J., Katona, G., Miklos, D., Seleznjev, O. and Thalheim, B. (1998)Asymptotic properties of keys and functional dependencies in random databases. Theor. Comput. Sci., 190, 151-166. (Pubitemid 128638652)
75. Demetrovics, J., Katona, G., Miklos, D. and Thalheim, B. (2006) On the Number of Independent Functional Dependencies. Proc. 4th Int. Symp. Foundations of Information and Knowledge Bases (FoIKS), Budapest, Hungary, February 14-17, Lecture Notes in Computer Science 3861, pp. 83-91. Springer. (Pubitemid 43973743)
76. Katona, G. (1992) Combinatorial and Algebraic Results for Database Relations. Proc. 4th Int. Conf. Database Theory (ICDT), Berlin, Germany, October 14-16, Lecture Notes in Computer Science 646, pp. 1-20. Springer.
77. Tichler, K. (2004) Extremal theorems for databases. Ann. Math. Artif. Intell., 40, 165-182. (Pubitemid 38103550)
78. Grant, J. (1977) Null values in a relational data base. Inf. Process. Lett., 6, 156-157.
79. Grahne, G. (1984) Dependency Satisfaction in Databases with Incomplete Information. Proc. 10th Int. Conf. Very Large Databases (VLDB), Singapore, August 27-31, pp. 37-45. IEEE Computer Society. (Pubitemid 16526813)
80. Makinouchi, A. (1977) A Consideration on Normal Form of Not-Necessarily-Normalized Relation in the Relational Data Model. Proc. 3rd Int. Conf. Very Large Databases (VLDB), Tokyo, Japan, October 6-8, pp. 447-453. IEEE Computer Society. (Pubitemid 8567817)
81. Gottlob, G. and Zicari, R. (1988) ClosedWorld Databases Opened Through NullValues. Proc. 14th Int. Conf. Very Large Databases (VLDB), Los Angeles, USA, August 29-September 1, pp. 50-61. IEEE Computer Society.
82. Thalheim, B. (1989) On semantic issues connected with keys in relational databases permitting null values. Elektron. Inf.verarb. Kybern., 25, 11-20.
83. Link, S. (2008) On the implication of multivalued dependencies in partial database relations. Int. J. Found. Comput. Sci., 19, 691-715.
84. Demetrovics, J. and Thi, V. (1987) Keys, antikeys and prime attributes. Annales Univ. Sci. Budapest, Sect. Comp., 8, 35-52.
85. Demetrovics, J. and Katona, O. (1981) Extremal Combinatorial Problems in Relational Data Base. Proc. Fundamentals of Computing Theory (FCT), Szeged, Hungary, August 24-28, Lecture Notes in Computer Science 117, pp. 110-119. Springer.
86. Engel, K. (1997) Sperner Theory. Cambridge University Press, Cambridge, UK.
87. Sperner, E. (1928) Ein Satzüber Untermengen einer endlichen Menge. Math Z., 27, 544-548.
88. Levene, M. and Vincent, M. (2000) Justification for inclusion dependency normal form. IEEE Trans. Knowl. Data Eng., 12, 281-291.
89. Levene,M.and Loizou, G. (1999) Database design for incomplete relations. ACM Trans. Database Syst., 24, 80-125.
90. Fagin, R. (1982) Horn clauses and database dependencies. J. ACM, 29, 952-985.