Skip to main content
SpringerLink
Log in

Design by example for SQL table definitions with functional dependencies

  • Regular Paper
  • Published:
The VLDB Journal Aims and scope Submit manuscript

Abstract

A database is C-Armstrong for a given set of constraints in a class C if it satisfies every constraint of the set and violates every constraint in C not implied by the set. Therefore, Armstrong databases are test data that perfectly illustrate the current perceptions about the semantics of a schema. We extend the existing theory of Armstrong relations to a toolbox of Armstrong tables. That is, we investigate structural and computational properties of Armstrong tables for the class of functional dependencies (FDs) over SQL tables. Relations are special instances of SQL tables with no duplicate rows and no null value occurrences. While FDs do not enjoy Armstrong tables, the combined class of standard FDs and NOT NULL constraints does enjoy Armstrong tables. The problem of finding an Armstrong table is shown to be precisely exponential for this combined class. However, we establish an algorithm that computes Armstrong tables with a size at most quadratic in that of a minimum-sized Armstrong table. Our resulting toolbox of Armstrong tables can be applied by data engineers to concisely visualize constraints on SQL data. Such support can lead to designs that guarantee efficient data management in practice.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abiteboul S., Hull R., Vianu V.: Foundations of Databases. Addison-Wesley, Reading (1995)

    MATH  Google Scholar 

  2. Alexe, B., Kolaitis, P., Tan, W.-C.: Characterizing schema mappings via data examples. In: Proceedings to the Twenty-Ninth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS), pp. 261–271 (2010)

  3. Arenas M., Fan W., Libkin L.: On the complexity of verifying consistency of XML specifications. SIAM J. Comput. 38(3), 841–880 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  4. Arenas M., Libkin L.: A normal form for XML documents. ACM Trans. Database Syst. 29(1), 195–232 (2004)

    Article  Google Scholar 

  5. Armstrong W.W.: Dependency structures of database relationships. Inf. Process. 74, 580–583 (1974)

    MathSciNet  Google Scholar 

  6. Atzeni P., Morfuni N.: Functional dependencies and constraints on null values in database relations. Inf. Control 70(1), 1–31 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  7. Beeri C., Bernstein P.: Computational problems related to the design of normal form relational schemas. ACM Trans. Database Syst. 4(1), 30–59 (1979)

    Article  Google Scholar 

  8. Beeri, C., Bernstein, P.A., Goodman, N.: A sophisticate’s introduction to database normalization theory. In: Proceedings of the Fourth International Conference on Very Large Data Bases (VLDB), IEEE Computer Society, pp. 113–124 (1978)

  9. Beeri C., Dowd M., Fagin R., Statman R.: On the structure of Armstrong relations for functional dependencies. J. ACM 31(1), 30–46 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  10. Beeri C., Mendelzon A.O., Sagiv Y., Ullman J.D.: Equivalence of relational database schemes. SIAM J. Comput. 10(2), 352–370 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  11. Bernstein P.: Synthesizing third normal form relations from functional dependencies. ACM Trans. Database Syst. 1(4), 277–298 (1976)

    Article  Google Scholar 

  12. Bernstein, P.A., Goodman, N.: What does Boyce-Codd Normal Form do? In: Proceedings of the Sixth International Conference on Very Large Data Bases (VLDB), pp. 245–259 (1980)

  13. Beskales G., Ilyas I., Golab L.: Sampling the repairs of functional dependency violations under hard constraints. Proc. VLDB 3(1), 197–207 (2010)

    Google Scholar 

  14. Bhargava, G., Goel, P., Iyer, B.: Hypergraph-based reorderings of outer join queries with complex predicates. In: Proceedings of the International Conference on Management of Data (SIGMOD), ACM, pp. 304–315 (1995)

  15. Bisbal J., Grimson J.: Database sampling with functional dependencies. Inf. Softw. Technol. 43(10), 607–615 (2001)

    Article  Google Scholar 

  16. Biskup J.: Security in computing systems. Springer, Berlin (2009)

    MATH  Google Scholar 

  17. Biskup, J., Dayal, U., Bernstein, P.: Synthesizing independent database schemas. In: Proceedings of the International Conference on Management of Data (SIGMOD), pp. 143–151 (1979)

  18. Biskup J., Embley D., Lochner J.: Reducing inference control to access control for normalized database schemas. Inf. Proc. Lett. 106(1), 8–12 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  19. Biskup J., Weibert T.: Keeping secrets in incomplete databases. Int. J. Inf. Sec. 7(3), 199–217 (2008)

    Article  Google Scholar 

  20. Boehm B.: Software Engineering Economics. Prentice Hall, NJ (1981)

    MATH  Google Scholar 

  21. Bojanczyk, M., Muscholl, A., Schwentick, T., Segoufin, L.: Two-variable logic on data trees and XML reasoning. J. ACM 56(3) (2009)

  22. Buneman P., Davidson S., Fan W., Hara C., Tan W.: Reasoning about keys for XML. Inf. Syst. 28(8), 1037–1063 (2003)

    Article  Google Scholar 

  23. CA Technologies: ERwin Data Modeler-methods guide. https://support.ca.com/cadocs/0/e002961e.pdf, p. 86 (2011)

  24. Cali A., Calvanese D., De Giacomo G., Lenzerini M.: Data integration under integrity constraints. Inf. Syst. 29(2), 147–163 (2004)

    Article  Google Scholar 

  25. Calvanese, D., De Giacomo, G., Lenzerini, M.: Identification constraints and functional dependencies in description logics. In: Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI), pp. 155–160 (2001)

  26. Cheng, Q., Gryz, J., Koo, F., Leung, C., Liu, L., Qian, X., Schiefer, K. Implementation of two semantic query optimization techniques in DB2 universal database. In: Proceedings of the 25th International Conference on Very Large Data Bases (VLDB), pp. 687–698 (1999)

  27. Chomicki, J.: Consistent query answering: Five easy pieces. In: Proceedings of the 11th International Conference on Database Theory, no. 4353 in Lecture Notes in Computer Science, Springer, pp. 1–17 (2007)

  28. Codd E.F.: A relational model of data for large shared data banks. Commun. ACM 13(6), 377–387 (1970)

    Article  MATH  Google Scholar 

  29. Codd, E.F.: Further normalization of the database relational model. In: Proceedings of the Courant Computer Science Symposia 6: Data Base Systems, pp. 33–64 (1972)

  30. Codd E.F.: Understanding relations. ACM SIGFIDET FDT Bull. 7(3–4), 23–28 (1975)

    Google Scholar 

  31. Codd E.F.: Extending the database relational model to capture more meaning. ACM Trans. Database Syst. 4(4), 397–434 (1979)

    Article  Google Scholar 

  32. Cohen, E.S.: The theory, practice and methodology of relational database design and programming. http://www.openlineconsult.com/, (2008)

  33. Date C.: Database in depth: relational theory for practitioners, 1 ed. O’Reilly Media, Sebastopol (2005)

    MATH  Google Scholar 

  34. Davidson S., Fan W., Hara C.: Propagating XML constraints to relations. J. Comput. Syst. Sci. 73(3), 316–361 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  35. De Marchi F., Lopes S., Petit J.-M., Toumani F.: Analysis of existing databases at the logical level: the DBA companion project. SIGMOD Rec 32(1), 47–52 (2003)

    Article  Google Scholar 

  36. De Marchi F., Petit J.-M.: Semantic sampling of existing databases through informative Armstrong databases. Inf. Syst. 32(3), 446–457 (2007)

    Article  Google Scholar 

  37. Delobel, C., Adiba, M.: Relational database systems. North Holland, (1985)

  38. Demetrovics J.: On the equivalence of candidate keys with Sperner systems. Acta Cybern. 4, 247–252 (1980)

    MathSciNet  Google Scholar 

  39. Demetrovics, J., Katona, G., Miklos, D., Thalheim, B.: On the number of independent functional dependencies. In: Proceedings of the 4th International Symposium on Foundations of Information and Knowledge Systems (FoIKS), no. 3861 in Lecture Notes in Computer Science, Springer, pp. 83–91 (2006)

  40. Demetrovics, J., Thi, V.: Armstrong relations, functional dependencies and strong dependencies. Comput. Artif. Intell. 14(3) (1995)

  41. Demetrovics J., Thi V.: Some remarks on generating Armstrong and inferring functional dependencies relation. Acta Cybern. 12(2), 167–180 (1995)

    MathSciNet  MATH  Google Scholar 

  42. Deutsch A., Ludäscher B., Nash A.: Rewriting queries using views with access patterns under integrity constraints. Theor. Comput. Sci. 371(3), 200–226 (2007)

    Article  MATH  Google Scholar 

  43. Deutsch A., Popa L., Tannen V.: Query reformulation with constraints. SIGMOD Rec. 35(1), 65–73 (2006)

    Article  Google Scholar 

  44. Diederich J., Milton J.: New methods and fast algorithms for database normalization. ACM Trans. Database Syst. 13(3), 339–365 (1988)

    Article  MathSciNet  Google Scholar 

  45. Elmasri R., Navathe S.: Fundamentals of Database Systems, 6 ed. Addison-Wesley, Reading (2010)

    Google Scholar 

  46. Enders A., Romback H.: A Handbook of Software and Systems Engineering; Empirical Overservations, Laws and Theories. Addison-Wesley, Reading (2003)

    Google Scholar 

  47. Engel K.: Sperner theory. Cambridge University Press, Cambridge (1997)

    Book  MATH  Google Scholar 

  48. Fagin, R.: The decomposition versus the synthetic approach to relational database design. In: Proceedings of the Third International Conference on Very Large Data Bases (VLDB), pp. 441–446 (1977)

  49. Fagin, R.: Armstrong databases. Technical report RJ3440(40926), IBM Research Laboratory, San Jose, California, USA (1982)

  50. Fagin R.: Horn clauses and database dependencies. J. ACM 29(4), 952–985 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  51. Fagin, R., Kolaitis, P., Popa, L., Tan, W.: Reverse data exchange: coping with nulls. In: Proceedings of the Twenty-Eight ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS), pp. 23–32 (2009)

  52. Fagin R., Vardi M.: Armstrong databases for functional and inclusion dependencies. Inf. Process. Lett. 16(1), 13–19 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  53. Fagin, R., Vardi, M.: The theory of data dependencies—an overview. In: Proceedings of the 11th Colloqium on Automata, Languages and Programming (ICALP), no. 172 in Lecture Notes in Computer Science, Springer, pp. 1–22 (1984)

  54. Fan, W., Geerts, F., Jia, X., Kementsietsidis, A.: Conditional functional dependencies for capturing data inconsistencies. ACM Trans. Database Syst. 33(2) (2008)

  55. Fan W., Geerts F., Xibei J.: A revival of integrity constraints for data cleaning. PVLDB 1(2), 1522–1523 (2008)

    Google Scholar 

  56. Fan W., Geerts F., Xibei J.: Semandaq: a data quality system based on conditional functional dependencies. Proc. VLDB 1(2), 1460–1463 (2008)

    Google Scholar 

  57. Fan W., Ma S., Hu Y., Liu J., Wu Y.: Propagating functional dependencies with conditions. Proc. VLDB 1(1), 391–407 (2008)

    Google Scholar 

  58. Farkas C., Jajodia S.: The inference problem: a survey. SIGKDD Explor. 4(2), 6–11 (2002)

    Article  Google Scholar 

  59. Fischer P.C., Saxton L.V., Thomas S.J., Van Gucht D.: Interactions between dependencies and nested relational structures. J. Comput. Syst. Sci. 31(3), 343–354 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  60. Ginsburg S., Hull R.: Characterizations for functional dependency and Boyce-Codd normal form families. Theor. Comput. Sci. 26, 243–286 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  61. Gottlob G., Libkin L.: Investigation on Armstrong relations, dependency inference, and excluded functional dependencies. Acta Cybern. 9(4), 385–402 (1990)

    MathSciNet  MATH  Google Scholar 

  62. Gottlob G., Pichler R., Wei F.: Tractable database design through bounded treewidth. Inf. Syst. 35(3), 278–298 (2010)

    Article  Google Scholar 

  63. Gottlob, G., Zicari, R.: Closed world databases opened through null values. In: Proceedings of the Fourteenth International Conference on Very Large Data Bases (VLDB), Morgan Kaufmann, pp. 50–61 (1988)

  64. Grahne, G.: Dependency satisfaction in databases with incomplete information. In: Proceedings of the Tenth International Conference on Very Large Data Bases (VLDB), Morgan Kaufmann, pp. 37–45 (1984)

  65. Grant J.: Null values in a relational data base. Inf. Process. Lett. 6(5), 156–157 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  66. Hartmann S., Link S.: Characterising nested database dependencies by fragments of propositional logic. Ann. Pure Appl. Logic 152(1–3), 84–106 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  67. Hartmann, S., Link, S.: Efficient reasoning about a robust XML key fragment. ACM Trans. Database Syst. 34(2) (2009)

  68. Hartmann S., Link S.: Numerical constraints on XML data. Inf. Comput. 208(5), 521–544 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  69. Hartmann, S., Link, S.: When data dependencies over SQL tables meet the Logics of Paradox and S-3. In: Proceedings to the Twenty-Ninth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS), pp. 317–326 (2010)

  70. Hasan, W., Pirahesh, H.: Query rewrite optimization in STARBURST. Technical Report RJ6367, IBM Research Laboratory, San Jose, California, USA (1988)

  71. Ilyas, I., Markl, V., Haas, P., Brown, P., Aboulnaga, A.: CORDS: Automatic discovery of correlations and soft functional dependencies. In: Proceedings of the International Conference on Management of Data (SIGMOD), ACM, pp. 647–658 (2004)

  72. Imielinski T., Lipski W. Jr.: Incomplete information in relational databases. J. ACM 31(4), 761–791 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  73. Imielinski T., Van der Meyden R., Vadaparty K.: Complexity tailored design: a new design methodology for databases with incomplete information. J. Comput. Syst. Sci. 51(3), 405–432 (1995)

    Article  MathSciNet  Google Scholar 

  74. Jensen C., Snodgrass R., Soo M.: Extending existing dependency theory to temporal databases. IEEE Trans. Knowl. Data Eng. 8(4), 563–582 (1996)

    Article  Google Scholar 

  75. Katona, G., Tichler, K.: Some contributions to the minimum representation problem of key systems. In: Proceedings of the 4th International Symposium on Foundations of Information and Knowledge Systems (FoIKS), vol. 3861 of Lecture Notes in Computer Science, Springer, pp. 240–257 (2006)

  76. Kim M.-S., Whang K.-Y., Lee J.-G., Lee M.-J.: Structural optimization of a full-text n-gram index using relational normalization. VLDB J. 17(6), 1485–1507 (2008)

    Article  Google Scholar 

  77. Kimura H., Huo G., Rasin A., Madden S., Zdonik S.: Correlation maps: a compressed access method for exploiting soft functional dependencies. Proc. VLDB 2(1), 1222–1233 (2009)

    Google Scholar 

  78. Klug A., Price R.: Determining view dependencies using tableaux. ACM Trans. Database Syst. 7(3), 361–380 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  79. Koch C., Olteanu D.: Conditioning probabilistic databases. Proc. VLDB 1(1), 313–325 (2008)

    Google Scholar 

  80. Kolahi S.: Dependency-preserving normalization of relational and XML data. J. Comput. Syst. Sci. 73(4), 636–647 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  81. Kolahi, S., Libkin, L.: An information-theoretic analysis of worst-case redundancy in database design. ACM Trans. Database Syst. 35(1) (2010)

  82. Langeveldt W.-D., Link S.: Empirical evidence for the usefulness of Armstrong relations in the acquisition of meaningful functional dependencies. Inf. Syst. 35(3), 352–374 (2010)

    Article  Google Scholar 

  83. Lechtenbörger J., Vossen G.: Multidimensional normal forms for data warehouse design. Inf. Syst. 28(5), 415–434 (2003)

    Article  MATH  Google Scholar 

  84. Levene M., Loizou G.: Null inclusion dependencies in relational databases. Inf. Comput. 136(2), 67–108 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  85. Levene M., Loizou G.: Axiomatisation of functional dependencies in incomplete relations. Theor. Comput. Sci. 206(1-2), 283–300 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  86. Levene M., Loizou G.: Database design for incomplete relations. ACM Trans. Database Syst. 24(1), 80–125 (1999)

    Article  MathSciNet  Google Scholar 

  87. Libkin, L.: Data exchange and incomplete information. In: Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), pp. 60–69 (2006)

  88. Libkin L., Wong L.: Semantic representations and query languages for Or-sets. J. Comput. Syst. Sciences 52(1), 125–142 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  89. Lien E.: On the equivalence of database models. J. ACM 29(2), 333–362 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  90. Ling, T.: A normal form for Entity-Relationship diagrams. In: Proceedings of the Fourth International Conference on the Entity-Relationship Approach (ER), pp. 24–35 (1985)

  91. Link S.: On the implication of multivalued dependencies in partial database relations. Int. J. Found. Comput. Sci. 19(3), 691–715 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  92. Lucchesi C., Osborn S.: Candidate keys for relations. J. Comput. Syst. Sci. 17(2), 270–279 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  93. Maier D.: Minimum covers in relational database model. J. ACM 27(4), 664–674 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  94. Maier, D.: The Theory of Relational Databases. Computer Science Press, (1983)

  95. Makinouchi, A.: A consideration on normal form of not-necessarily-normalised relation in the relational data model. In: Proceedings of the Third International Conference on Very Large Data Bases (VLDB), pp. 447–453 (1977)

  96. Mannila H., Räihä K.-J.: Design by example: an application of Armstrong relations. J. Comput. Syst. Sci. 33(2), 126–141 (1986)

    Article  MATH  Google Scholar 

  97. Mannila H., Räihä K.-J.: Design of Relational Databases. Addison-Wesley, Reading (1992)

    MATH  Google Scholar 

  98. Mannila H., Räihä K.-J.: Algorithms for inferring functional dependencies from relations. Data Knowl. Eng. 12(1), 83–99 (1994)

    Article  MATH  Google Scholar 

  99. Marnette B., Mecca G., Papotti P.: Scalable data exchange with functional dependencies. Proc. VLDB 3(1), 105–116 (2010)

    Google Scholar 

  100. Martin J.: Information Engineering. Prentice Hall, NJ (1989)

    Google Scholar 

  101. Miklau G., Suciu D.: A formal analysis of information disclosure in data exchange. J. Comput. Syst. Sci. 73(3), 507–534 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  102. Miller R., Hernandez M., Haas L., Yan L.-L., Ho C., Fagin R., Popa L.: The Clio project: managing heterogeneity. SIGMOD Rec. 30(1), 78–83 (2001)

    Article  Google Scholar 

  103. Molinaro C., Greco S.: Polynomial time queries over inconsistent databases with functional dependencies and foreign keys. Data Knowl. Eng. 69(7), 709–722 (2010)

    Article  Google Scholar 

  104. Paulley, G.: Exploiting functional dependence in query optimization. Technical Report UW-CS-2000-11, University of Waterloo, Waterloo, Canada, (2000)

  105. Paulley, G., Larson, P.-A.: Exploiting uniqueness in query optimization. In: Proceedings of the Tenth International Conference on Data Engineering (ICDE), IEEE Computer Society, pp. 68–79 (1994)

  106. Qian L., LeFevre K., Jagadish H.: CRIUS: user-friendly database design. Proc. VLDB Endow. 4(2), 81–92 (2011)

    Google Scholar 

  107. Rauh O., Stickel E.: Standard transformations for the normalization of ER schemata. Inf. Syst. 21(2), 187–208 (1996)

    Article  Google Scholar 

  108. Rosenthal A., Reiner D.: Tools and transformations—rigorous and otherwise—for practical database design. ACM Trans. Database Syst. 19(2), 167–211 (1994)

    Article  Google Scholar 

  109. Schaerf M., Cadoli M.: Tractable reasoning via approximation. Artif. Intell. 74, 249–310 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  110. Silva, A., Melkanoff, M.: A method for helping discover the dependencies of a relation. In: Advances in Data Base Theory, pp. 115–133 (1979)

  111. Simmen, D., Shekita, E., Malkemus, T.: Fundamental techniques for order optimization. In: Proceedings of the International Conference on Management of Data (SIGMOD), pp. 57–67 (1996)

  112. Sözat M., Yazici A.: A complete axiomatization for fuzzy functional and multivalued dependencies in fuzzy database relations. ACM Fuzzy Sets Syst. 117(2), 161–181 (2001)

    Article  MATH  Google Scholar 

  113. Standish Group: Unfinished voyages. The Standish Group International, available on-line at http://www.standishgroup.com/sample_research/unfinsihed_voyages_1.php (1995)

  114. Tan H., Zhao Y.: Automated elicitation of functional dependencies from source codes of database transactions. Inf. Softw. Technol. 46(2), 109–117 (2004)

    Article  Google Scholar 

  115. Tari Z., Stokes J., Spaccapietra S.: Object normal forms and dependency constraints for object-oriented schemata. ACM Trans. Database Syst. 22, 513–569 (1997)

    Article  Google Scholar 

  116. Thalheim B.: Dependencies in relational databases. Teubner, Oxford (1991)

    MATH  Google Scholar 

  117. Thalheim B.: Entity–Relationship Modeling. Springer, Heidelberg (2000)

    MATH  Google Scholar 

  118. Toman D., Weddell G.: On keys and functional dependencies as first-class citizens in description logics. J. Autom. Reason. 40(2–3), 117–132 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  119. Vadaparty K., Naqvi S.: Using constraints for efficient query processing in nondeterministic databases. IEEE Trans. Knowl. Data Eng. 7(6), 850–864 (1995)

    Article  Google Scholar 

  120. Vincent M.: Semantic foundations of 4NF in relational database design. Acta Inf. 36(3), 173–213 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  121. Vincent M., Liu J., Liu C.: Strong functional dependencies and their application to normal forms in XML. ACM Trans. Database Syst. 29(3), 445–462 (2004)

    Article  Google Scholar 

  122. Wang, D., Dong, X., Sarma, A., Franklin, M., Halevy, A.: Functional dependency generation and applications in pay-as-you-go data integration systems. In: Proceedings of the 12th International Workshop on the Web and Databases (WebDB), ACM (2009)

  123. Wang, H., Liu, R.: Privacy-preserving publishing data with full functional dependencies. In: Proceedings of the 15th International Conference on Database Systems for Advanced Applications, Part II (DASFAA), vol. 5982 of Lecture Notes in Computer Science, Springer, pp. 176–183 (2010)

  124. Weddell G.: Reasoning about functional dependencies generalized for semantic data models. ACM Trans. Database Syst. 17(1), 32–64 (1992)

    Article  MathSciNet  Google Scholar 

  125. Wijsen J.: Temporal FDs on complex objects. ACM Trans. Database Syst. 24(1), 127–176 (1999)

    Article  Google Scholar 

  126. Wolf G., Kalavagattu A., Khatri H., Balakrishnan R., Chokshi B., Fan J., Chen Y., Kambhampati S.: Query processing over incomplete autonomous databases: query rewriting using learned data dependencies. VLDB J. 18(5), 1167–1190 (2009)

    Article  Google Scholar 

  127. Yu C., Jagadish H.: XML schema refinement through redundancy detection and normalization. VLDB J. 17(2), 203–223 (2008)

    Article  Google Scholar 

  128. Zaniolo C.: Database relations with null values. J. Comput. Syst. Sci. 28(1), 142–166 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  129. Zultner, R.: The deming way: total quality management for software. In: Proceedings of Total Quality Management for Software, pp. 134–145 (1992)

Download references

Author information

Authors and Affiliations

  1. Department of Informatics, Clausthal University of Technology, Clausthal-Zellerfeld, Germany

    Sven Hartmann

  2. Services Platform Lab, Hewlett-Packard Laboratories, Singapore, Singapore

    Markus Kirchberg

  3. School of Information Management, Victoria University of Wellington, Wellington, New Zealand

    Sebastian Link

Authors
  1. Sven Hartmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Markus Kirchberg
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sebastian Link.

Electronic Supplementary Material

The Below is the Electronic Supplementary Material.

ESM 1 (PDF 96 kb)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hartmann, S., Kirchberg, M. & Link, S. Design by example for SQL table definitions with functional dependencies. The VLDB Journal 21, 121–144 (2012). https://doi.org/10.1007/s00778-011-0239-5

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00778-011-0239-5

Keywords

Search

Navigation