Abstract
In this paper, the definition of approximate XFDs based on value equality is proposed. Two metrics, support and strength, are presented for measuring the degree of approximate XFD. A basic algorithm is designed for extracting minimal set of approximate XFDs, and then two optimized strategies are proposed to improve the performance. Finally, the experimental results show that the optimized algorithms are correct and effective.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Yang X, Li C. Secure XML Publishing without Information Leakage in the Presence of Data Inference.Proceedings of 30th International Conference on Very Large Data Bases. Toronto, Canada, Sept, 2004. 96-107.
Yang X, Li C, Yu G. XGuard: A System for Publishing XML Documents without Information Leakage in the Presence of Data Inference.Proceedings of International Conference on Data Engineering. Tokyo, Japan, April 2005. 1124–1125.
Kivinen J, Mannila H. Approximate Inference of Functional Dependencies from Relations.Theor Comput Sci, 1995,149 (1): 129–149.
Arenas M, Libkin L. A Normal Form for XML Documents. ACM Trans.Database Syst, 2004,29: 195–232.
Liu J, Vincent M W, Liu C. Functional Dependencies, from Relational to XMLErshov Memorial Conference. Novosibirsk, Russia, July, 2003. 531–538.
Lee M L, Ling T W, Low W L. Designing Functional Dependencies for XML.Proceedings of 8th International Conference on Extending Database Technology. Prague, Czech Repubic, March 2002, 124–141.
Yang X, Wang G. Mapping Referential Integrity Constraints from Relational Databases to XML.Proceedings of the 2nd International Conference on Advances in Web-Age Information Management. German: Springer-Verlag Press, 2001. 329–340.
Huhtala Y, Kärkkäinen J, Porkka P,et al. TANE: An Efficient Algorithm for Discovering Functional and Approximate Dependencies.Comput J, 1999,42: 100–111.
Mannila H, Toivonen H. Levelwise Search and Borders of Theories in Knowledge Discovery.Data Min Knowl Discov, 1997,1(3): 241–258.
Ilyas I F, Markl V, Haas P J,et al. CORDS: Automatic discovery of Correlations and Soft Functional Dependencies.Proceedings of Proceeding at the ACM SIGMOD International Conference on Management of Data. Paris, France, June 2004. 647–658.
Grahne G, Zhu J. Discovering Approximate Keys in XML Data.Proceedings of International Conference on Information and Knowledge Management. Virginia, USA, Nov. 2002. 453–460.
Buneman P, Davidson S, Fan W,et al. Reasoning about Keys for XML. International Workshop on Database Programming Languages, Lecture Notes in Computer Science 2397. Frascati, Italy, Sept. 2002. 133–148.
Author information
Authors and Affiliations
Corresponding author
Additional information
Foundation item: Supported by the National Natural Science Foundation of China (60173051). Teaching and Research Award Program for Outstanding Young Teachers in Higher Education Institution of the Ministry of Education, the National Research Foundation for the Doctoral Program of Higher Education of China (20030145029), and the Natural Science Foundation for Doctoral Career Award of Liaoning Province (20041016).
Biography: SHI Lei (1980-), male, Master candidate, research direction: XML access control, data mining
Rights and permissions
About this article
Cite this article
Lei, S., Xiao-chun, Y., Ge, Y. et al. An optimized approach for extracting approximate functional dependencies in XML documents. Wuhan Univ. J. Nat. Sci. 11, 127–132 (2006). https://doi.org/10.1007/BF02831717
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02831717