Abstract
In this paper, we first rephrase the notion of extended tuple as a sentence from a regular language generated by a grammar G where the nonterminal symbols of the grammar are the attribute names of the tuple. Finite sets of extended tuples play the role of extended relation instances. Then we introduce the dual language, which generates the accepted tuple-types of the extended relation. We define the syntactical form of functional dependencies for extended relation on the graph of the finite state automaton associated to the dual language. Using this model we can handle extended relations generated by recursive regular expressions too. The implication problem of our class of dependencies is decidable by a version of Chase algorithm specified on the graph of the associated FSA.
The research was supported by the European Union and co-financed by the European Social Fund (grant agreement no. TAMOP 4.2.1./B-09/1/KMR-2010-0003).
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
Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley (1995)
Amano, S., Libkin, L., Murlak, F.: XML schema mappings. In: Proceedings of the Twenty-Eighth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, Providence, Rhode Island, USA, June 29-July 01, pp. 33–42 (2009)
Arenas, M., Libkin, L.: A normal form for XML documents. ACM TODS 29, 195–232 (2004)
Buneman, P., Davidson, S.B., Fan, W., Hara, C.S., Tan, W.C.: Keys for XML. Computer Networks 39(5), 473–487 (2002)
Chen, Y., Davidson, S.B., Zheng, Y.: Constraint Preserving XML Storage in Relations. In: Proceedings of the International Workshop on the Web and Databases (WEBDB), pp. 7–12 (2002)
Lee, D., Mani, M., Murata, M.: Reasoning about XML Schema Languages using Formal Language Theory. Technical Report, IBM Almaden Research Center, RJ# 10197, Log# 95071 (2000), http://www.cs.ucla.edu/dongwon/paper
Davidson, S., Fan, W., Hara, C.: Propagating XML constraints to relations. Journal of Computer and System Sciences 73(3), 316–361 (2007)
Hartmann, S., Köhler, H., Trinh, T.: On the Existence of Armstrong Data Trees for XML Functional Dependencies. In: Link, S., Prade, H. (eds.) FoIKS 2010. LNCS, vol. 5956, pp. 94–113. Springer, Heidelberg (2010)
Hartmann, S., Link, S.: Efficient reasoning about a robust XML key fragment. ACM Trans. Database Syst. 34(2) (2009)
Hartmann, S., Link, S., Trinh, T.: Solving the Implication Problem for XML Functional Dependencies with Properties. In: Dawar, A., de Queiroz, R. (eds.) WoLLIC 2010. LNCS, vol. 6188, pp. 161–175. Springer, Heidelberg (2010)
Lv, T., Yan, P.: Mapping Relational Schemas to XML DTDs with Constraints. In: Proceedings of the First International Multi-Symposiums on Computer and Computational Sciences, pp. 528–533 (2006)
Murata, M., Lee, D., Mani, M., Kawaguchi, K.: Taxonomy of XML schema languages using formal language theory. ACM Trans. Internet Technol. 5(4), 660–704 (2005)
Sperberg-McQueen, C.M., Thompson, H.: XML Schema. Technical report, World Wide Web Consortium (2005), http://www.w3.org/XML/Schema
Vincent, M.W., Liu, J., Liu, C.: Strong functional dependencies and their application. to normal forms in XML. ACM ToDS 29, 445–462 (2004)
Wang, J.: A Comparative Study of Functional Dependencies for XML. In: Zhang, Y., Tanaka, K., Yu, J.X., Wang, S., Li, M. (eds.) APWeb 2005. LNCS, vol. 3399, pp. 308–319. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Szabó, G.I., Benczúr, A. (2012). Functional Dependencies on Extended Relations Defined by Regular Languages. In: Lukasiewicz, T., Sali, A. (eds) Foundations of Information and Knowledge Systems. FoIKS 2012. Lecture Notes in Computer Science, vol 7153. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28472-4_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-28472-4_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28471-7
Online ISBN: 978-3-642-28472-4
eBook Packages: Computer ScienceComputer Science (R0)