Abstract
In the present paper a distance concept of databases is investigated. Two database instances are of distance 0, if they have the same number of attributes and satisfy exactly the same set of functional dependencies. This naturally leads to the poset of closures as a model of changing database. The distance of two databases (closures) is defined to be the distance of the two closures in the Hasse diagram of that poset. We determine the diameter of the poset and show that the distance of two closures is equal to the natural lower bound, that is to the size of the symmetric difference of the collections of closed sets. We also investigate the diameter of the set of databases with a given system of keys. Sharp upper bounds are given in the case when the minimal keys are 2 (or r)-element sets.
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
Berman, H.M., Westbrook, J., Feng, Z., Gilliland, G., Bhat, T.N., Weissig, H., Shindyalov, I.N., Bourne, P.E.: The Protein Data Bank. Nucleic Acids Research 28(1), 235–242 (2000)
Bhat, T.N., et al.: The PDB data uniformity project. Nucleic Acid Research 29(1), 214–218 (2001)
Boutselakis, H., et al.: E-MSD: the European Bioinformatics Institute Macromolecular Structure Database. Nucleic Acid Research 31(1), 458–462 (2003)
Burosch, G., Demetrovics, J., Katona, G.O.H.: The Poset of Closures as a Model of Changing Databases. Order 4, 127–142 (1987)
Demetrovics, J., Katona, G.O.H.: Extremal combinatorial problems in relational data base. In: Gecseg, F. (ed.) FCT 1981. LNCS, vol. 117, pp. 110–119. Springer, Heidelberg (1981)
Erdős, P.: On the number of complete subgraphs contained in certain graphs. Publ. Math. Inst. Hung. Acad. Sci. VII, Ser. A3, 459–464 (1962), http://www.math-inst.hu/~p_erdos/1962-14.pdf
Katona, G.: A theorem on finite sets. In: Theory of Graphs, Proc. Coll. held at Tihany, 1966, Akadémiai Kiadó, pp. 187–207 (1968)
Kruskal, J.B.: The number of simplices in a complex. In: Mathematical Optimization Techniques, pp. 251–278. University of California Press, Berkeley (1963)
Müller, H., Freytag, J.-C., Leser, U.: On the Distance of Databases, Technical Report, HUB-IB-199 (March 2006)
Müller, H., Freytag, J.-C., Leser, U.: Describing differences between databases. In: CIKM 2006: Proceedings of the 15th ACM international conference on Information and knowledge management, Arlington, Virginia, USA, pp. 612–621 (2006)
Rother, K., Müller, H., Trissl, S., Koch, I., Steinke, T., Preissner, R., Frömmel, C., Leser, U.: COLUMBA: Multidimensional Data Integration of Protein Annotations. In: Rahm, E. (ed.) DILS 2004. LNCS (LNBI), vol. 2994. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Katona, G.O.H., Keszler, A., Sali, A. (2010). On the Distance of Databases. In: Link, S., Prade, H. (eds) Foundations of Information and Knowledge Systems. FoIKS 2010. Lecture Notes in Computer Science, vol 5956. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11829-6_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-11829-6_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11828-9
Online ISBN: 978-3-642-11829-6
eBook Packages: Computer ScienceComputer Science (R0)