Abstract
We present a method for decomposing a hypergraph with certain regularities into smaller hypergraphs. By applying this to the set of all canonical covers of a given set of functional dependencies, we obtain more efficient methods for solving several optimization problems in database design. These include finding one or all “optimal” covers w.r.t. different criteria, which can help to synthesize better decompositions, and to reduce the cost of constraint checking.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Armstrong, W.W.: Dependency structures of data base relationships. In: IFIP Congress, pp. 580–583 (1974)
Ausiello, G., D’Atri, A., Saccà, D.: Minimal representation of directed hypergraphs. SIAM J. Comput. 15(2), 418–431 (1986)
Berge, C.: Hypergraphs: Combinatorics of Finite Sets. Elsevier Science Pub. Co., Amsterdam (1989)
Biskup, J., Dayal, U., Bernstein, P.A.: Synthesizing independent database schemas. In: SIGMOD Conference, pp. 143–151 (1979)
Gottlob, G.: On the size of nonredundant FD-covers. Inf. Process. Lett. 24(6), 355–360 (1987)
Gottlob, G., Pichler, R., Wei, F.: Tractable database design through bounded treewidth. In: PODS, pp. 124–133 (2006)
Habib, M., de Montgolfier, F., Paul, C.: A simple linear-time modular decomposition algorithm for graphs, using order extension. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol. 3111, pp. 187–198. Springer, Heidelberg (2004)
Koehler, H.: Finding faithful Boyce-Codd normal form decompositions. In: Cheng, S.-W., Poon, C.K. (eds.) AAIM 2006. LNCS, vol. 4041, pp. 102–113. Springer, Heidelberg (2006)
Lechtenbörger, J.: Computing unique canonical covers for simple FDs via transitive reduction. Inf. Process. Lett. 92(4), 169–174 (2004)
Levene, M., Loizou, G.: A Guided Tour of Relational Databases and Beyond. Springer, Heidelberg (1999)
Lucchesi, C.L., Osborn, S.L.: Candidate keys for relations. Journal of Computer and System Sciences 17(2), 270–279 (1978)
Maier, D.: Minimum covers in the relational database model. Journal of the ACM 27(4), 664–674 (1980)
Maier, D.: The Theory of Relational Databases. Computer Science Press (1983)
Mannila, H., Räihä, K.-J.: The Design of Relational Databases. Addison-Wesley, Reading (1987)
Osborn, S.L.: Testing for existence of a covering Boyce-Codd normal form. Information Processing Letters 8(1), 11–14 (1979)
Saiedian, H., Spencer, T.: An efficient algorithm to compute the candidate keys of a relational database schema. Comput. J. 39(2), 124–132 (1996)
Zaniolo, C.: A new normal form for the design of relational database schemata. ACM Trans. Database Syst. 7(3), 489–499 (1982)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Koehler, H. (2008). Autonomous Sets – A Method for Hypergraph Decomposition with Applications in Database Theory. In: Hartmann, S., Kern-Isberner, G. (eds) Foundations of Information and Knowledge Systems. FoIKS 2008. Lecture Notes in Computer Science, vol 4932. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77684-0_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-77684-0_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77683-3
Online ISBN: 978-3-540-77684-0
eBook Packages: Computer ScienceComputer Science (R0)