Skip to main content
SpringerLink
Log in

Coding Theory Motivated by Relational Databases

  • Conference paper
Semantics in Data and Knowledge Bases (SDKB 2010)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 6834))

Included in the following conference series:

Abstract

In the present paper results on minimal Armstrong instances of certain integrity constraints in relational databases are surveyed that lead to coding theory type problems. First, branching dependencies are studied. Finding minimal Armstrong instances for some collections of these integrity constraints lead to a new metric space. Error correcting codes in that space have been investigated on their own right since then.

In the second part Armstrong instances of functional dependencies are investigated when the size of the domain of each attribute is bounded by a constant q. These come up naturally in real life databases, as well as in the study of higher order data model. These instances can be directly considered as q-ary codes, if tuples are taken as codewords.

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 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.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. Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)

    MATH  Google Scholar 

  2. Agrell, E., Vardy, A., Zeger, K.: Upper bounds for constant-weight codes. IEEE Transactions on Information Theory 46, 2373–2395 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  3. Armstrong, W.W.: Dependency structures of database relationships. Information Processing, 580–583 (1974)

    Google Scholar 

  4. Ausiello, G., D’Atri, A., Moscarini, M.: Chordality properties on graphs and minimal conceptual connections in semantic data models. Journal of Computer and System Sciences 33(2), 179–202 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  5. Beeri, C., Fagin, R., Maier, D., Yannakakis, M.: On the desirability of acyclic database schemes. J. ACM 30, 479–513 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  6. Bennett, F.E., Wu, L.: On minimum matrix representation of closure operations. Discrete Applied Mathematics 26(1), 25–40 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  7. Blokhuis, A., Sali, A.: Paper in preparation

    Google Scholar 

  8. Bollobás, B., Katona, G.O.H., Leader, I.: Paper in preparation

    Google Scholar 

  9. Brightwell, G., Katona, G.O.H.: A new type of coding theorem. Studia Sci. Math. Hungar. 38, 139–147 (2001)

    MathSciNet  MATH  Google Scholar 

  10. Brouwer, A.E.: Personal communication (2008)

    Google Scholar 

  11. Bryant, D.E., Khodkar, A.: On orthogonal double covers of graphs. Designs, Codes and Cryptography 13, 103–105 (1998) 10.1023/A:1008283627078

    Article  MathSciNet  MATH  Google Scholar 

  12. D’Atri, A., Moscarini, M.: On the recognition and design of acyclic databases. In: Proceedings of the 3rd ACM SIGACT-SIGMOD Symposium on Principles of Database Systems PODS 1984, pp. 1–8. ACM, New York (1984)

    Google Scholar 

  13. Demetrovics, J.: On the equivalence of candidate keys with Sperner systems. Acta Cybernetica 4, 247–252 (1979)

    MathSciNet  MATH  Google Scholar 

  14. Demetrovics, J., Füredi, Z., Katona, G.O.H.: Minimum matrix reperesentation of closure operetions. Discrete Applied Mathematics 11, 115–128 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  15. Demetrovics, J., Gyepesi, G.: A note on minimum matrix reperesentation of closure operetions. Combinatorica 3, 177–180 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  16. Demetrovics, J., Katona, G. O. H.: Tempero, E.: Extremal combinatorial problems in relational data base. In:FCT 1981. LNCS, vol. 117, pp. 110–119. Springer, Heidelberg (1981)

    Chapter  Google Scholar 

  17. Demetrovics, J., Katona, G.O.H.: A survey of some combinatorial results concerning functional dependencies in databases. Annals of Mathematics and Artificial Intelligence 7, 63–82 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  18. Demetrovics, J., Katona, G.O.H., Sali, A.: The characterization of branching dependencies. Discrete Applied Mathematics 40, 139–153 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  19. Demetrovics, J., Katona, G.O.H., Sali, A.: Representations of branching dependencies. Acta Sci. Math. (Szeged) 60, 213–223 (1995)

    MathSciNet  MATH  Google Scholar 

  20. Demetrovics, J., Katona, G.O.H., Sali, A.: Design type problems motivated by database theory. Journal of Statistical Planning and Inference 72, 149–164 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  21. Deza, M.-M., Deza, E.: Dictionary of distances. Elsevier, Amsterdam (2006)

    MATH  Google Scholar 

  22. Enomoto, H., Katona, G.O.H.: Pairs of disjoint q-element subsets far from each other. Electronic Journal of Combinatorics 8, # R7 (2001)

    MathSciNet  MATH  Google Scholar 

  23. Fagin, R.: Horn clauses and database dependencies. Journal of the Association for Computing Machinery 29(4), 952–985 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  24. Fagin, R.: Degrees of acyclicity for hypergraphs and relational database schemes. J. ACM 30, 514–550 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  25. Fu, F.-W., Kløve, T., Luo, Y., Wei, V.: On equidistant constant weight codes. Discrete Applied Mathematics 128, 157–164 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  26. Füredi, Z.: Perfect error-correcting databases. Discrete Applied Mathematics 28, 171–176 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  27. Ganter, B., Gronau, H.-D.O.F.: On two conjectures of Demetrovics, Füredi and Katona concerning partitions. Discrete Mathematics 88, 149–155 (1987)

    Article  MATH  Google Scholar 

  28. Ganter, B., Gronau, H.-D.O.F., Mullin, R.C.: On orthogonal double covers of K n . Ars Combinatoria 37, 209–221 (1994)

    MathSciNet  MATH  Google Scholar 

  29. Graham, R., Sloane, N.: Lower bounds for constant weight code. IEEE Trans. Inform. Theory 26, 37–43 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  30. Grahne, G., Räihä, K.-J.: Characterizations for acyclic database schemes. In: Preparata, F., Kanellakis, P. (eds.) Advances in Computing Research, p. 1941. JAI Press Inc., Greenwich (1986)

    Google Scholar 

  31. Grant, J., Minker, J.: Normalization and axiomatization for numerical dependencies. Information and Control 65, 1–17 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  32. Gronau, H.-D.O.F., Grttmller, M., Hartmann, S., Leck, U., Leck, V.: On orthogonal double covers of graphs. Designs, Codes and Cryptography 27, 49–91 (2002) 10.1023/A:1016546402248

    Article  MathSciNet  MATH  Google Scholar 

  33. Gronau, H.-D.O.F., Schmidmeier, M.: Orthogonal covers by multiplication graphs. Discrete Applied Mathematics 157(9), 2048–2056 (2009); Optimal Discrete Structures and Algorithms - ODSA 2006

    Article  MathSciNet  MATH  Google Scholar 

  34. Hartmann, S., Leck, U.: Self-orthogonal decompositions of graphs into matchings. Electronic Notes in Discrete Mathematics 23, 5–11 (2005); Workshop on Graph Asymmetries

    Article  MathSciNet  MATH  Google Scholar 

  35. Hartmann, S., Leck, U., Leck, V.: More orthogonal double covers of complete graphs by hamiltonian paths. Discrete Mathematics 308(12), 2502–2508 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  36. Hartmann, S., Link, S., Schewe, K.-D.: Weak functional dependencies in higher-order datamodels. In: Seipel, D., Turull-Torres, J.M. (eds.) FoIKS 2004. LNCS, vol. 2942. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  37. Katona, G.O.H., Sali, A., Schewe, K.-D.: Codes that attain minimum distance in all possible directions. Central Eruopean J. of Math. 6, 1–11 (2008)

    Article  MATH  Google Scholar 

  38. Leck, U., Leck, V.: Orthogonal double covers of complete graphs by trees of small diameter. Discrete Applied Mathematics 95(1-3), 377–388 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  39. Lovász, L.: Toplogical and algebraic methods in graph theory. In: Graph Theory and Related Topics: Proc. Conf. Univ. Waterloo, Ontario 1977. Academic Press, New York (1979)

    Google Scholar 

  40. Quistorff, J.: New upper bounds on enomoto-katona’s coding type problem. Studia Sci. Math. Hungar. 42, 61–72 (2005)

    MathSciNet  MATH  Google Scholar 

  41. Quistorff, J.: Combinatorial problems in the enomoto-katona space. Studia Sci. Math. Hungar. 46, 121–139 (2009)

    MathSciNet  MATH  Google Scholar 

  42. Rankin, R.: The closest packing of spherical caps in n dimensions. Proceedings of the Glagow Mathematical Society 2, 145–146 (1955)

    MathSciNet  MATH  Google Scholar 

  43. Sali, A.: Minimal keys in higher-order datamodels. In: Seipel, D., Turull-Torres, J.M. (eds.) FoIKS 2004. LNCS, vol. 2942, Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  44. Sali, A., Schewe, K.-D.: Counter-free keys and functional dependencies in higher-order datamodels. Fundamenta Informaticae 70, 277–301 (2006)

    MathSciNet  MATH  Google Scholar 

  45. Sali, A., Schewe, K.-D.: Keys and Armstrong databases in trees with restructuring. Acta Cybernetica 18, 529–556 (2008)

    MathSciNet  MATH  Google Scholar 

  46. Sali, A., Székely, L.A.: On the existence of armstrong instances with bounded domains. In: Hartmann, S., Kern-Isberner, G. (eds.) FoIKS 2008. LNCS, vol. 4932, pp. 151–157. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  47. Sali sr, A., Sali, A.: Generalized dependencies in relational databases. Acta Cybernetica (Szeged) 13, 431–438 (1998)

    MathSciNet  MATH  Google Scholar 

  48. Silva, A., Melkanoff, M.: A method for helping discover the dependencies of a relation. In: Gallaire, H., Minker, J., Nicolas, J.-M. (eds.) Advances in Data Base Theory, vol. 1. Plenum Publishing, New York (1981)

    Google Scholar 

  49. Thalheim, B.: The number of keys in relational and nested relational databases. Discrete Applied Mathematics 40, 265–282 (1992)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences, Budapest, P.O.B.127, H-1364, Hungary

    Attila Sali

Authors
  1. Attila Sali
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Software Competence Center Hagenberg and Johannes-Keppler-University Linz, Softwarepark 21, 4232, Hagenberg, Austria

    Klaus-Dieter Schewe

  2. Department of Computer Science, Christian-Albrechts-University Kiel, Olshausenstr. 40, 24098, Kiel, Germany

    Bernhard Thalheim

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sali, A. (2011). Coding Theory Motivated by Relational Databases. In: Schewe, KD., Thalheim, B. (eds) Semantics in Data and Knowledge Bases. SDKB 2010. Lecture Notes in Computer Science, vol 6834. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23441-5_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23441-5_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23440-8

  • Online ISBN: 978-3-642-23441-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation