Abstract
Dependency discovery is an important technique for relational database design due to numerous applications like normalisation and query optimisation. Similar applications are likely to exist in the context of XML. To date, there are few investigations into dependency discovery in the context of XML. We propose a transversal approach for discovering a class of subgraph-based XML functional dependencies with pre-image semantics (XFDs). We cover all aspects of the discovery process, from determining agree sets to the extraction of an XFD cover. An inherent challenge is the large and complex search space of valid XFDs due to the tree-structure of XML data.
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
Arenas, M., Libkin, L.: A normal form for XML documents. ACM Trans. Database Syst. 29(1), 195–232 (2004)
Grahne, G., Zhu, J.: Discovering approximate keys in XML data. In: CIKM 2002, pp. 453–460. ACM, New York (2002)
Hartmann, S., Link, S.: More functional dependencies for XML. In: Kalinichenko, L.A., Manthey, R., Thalheim, B., Wloka, U. (eds.) ADBIS 2003. LNCS, vol. 2798, pp. 355–369. Springer, Heidelberg (2003)
Hartmann, S., Link, S., Trinh, T.: Efficient reasoning about xfds. In: Kotagiri, R., et al. (eds.) DASFAA 2007. LNCS, vol. 4443, p. 1070. Springer, Heidelberg (2007)
Huhtala, Y., Kärkkäinen, J., Porkka, P., Toivonen, H.: Tane: An efficient algorithm for discovering functional and approximate dependencies. Comput. J. 42(2), 100–111 (1999)
Kavvadias, D.J., Stavropoulos, E.C.: An efficient algorithm for the transversal hypergraph generation. J. Graph Algorithms Appl. 9(2), 239–264 (2005)
Lopes, S., Petit, J.-M., Lakhal, L.: Efficient discovery of functional dependencies and armstrong relations. In: Zaniolo, C., Grust, T., Scholl, M.H., Lockemann, P.C. (eds.) EDBT 2000. LNCS, vol. 1777, pp. 350–364. Springer, Heidelberg (2000)
Mannila, H., Räihä, K.-J.: Dependency inference. In: Stocker, P.M., Kent, W., Hammersley, P. (eds.) VLDB 1987, pp. 155–158. Morgan Kaufmann, San Francisco (1987)
Mannila, H., Räihä, K.-J.: Algorithms for inferring functional dependencies from relations. Data Knowl. Eng. 12(1), 83–99 (1994)
Vincent, M., Liu, J.: Strong functional dependencies and a redundancy free normal form for XML. In: 7th World Multi-Conference on Systemics, Cybernetics and Informatics (2003)
Wang, J., Topor, R.W.: Removing XML data redundancies using functional and equality-generating dependencies. In: ADC 2005, pp. 65–74 (2005)
Wyss, C., Giannella, C., Robertson, E.L.: Fastfds: A heuristic-driven, depth-first algorithm for mining functional dependencies from relation instances - extended abstract. In: Kambayashi, Y., Winiwarter, W., Arikawa, M. (eds.) DaWaK 2001. LNCS, vol. 2114, pp. 101–110. Springer, Heidelberg (2001)
Yu, C., Jagadish, H.V.: Efficient discovery of XML data redundancies. In: Dayal, U., Whang, K.-Y., Lomet, D.B., Alonso, G., Lohman, G.M., Kersten, M.L., Cha, S.K., Kim, Y.-K. (eds.) VLDB 2006, pp. 103–114. ACM, New York (2006)
Zhou, Z.: Algorithms and implementation of functional dependency discovery for XML. Master thesis, Massey University, Palmerston North, New Zealand, pages 81 (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Trinh, T. (2008). Using Transversals for Discovering XML Functional Dependencies. 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_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-77684-0_15
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)