Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
A normal form for XML documents
ACM Transactions on Database Systems (TODS)
Strong functional dependencies and their application to normal forms in XML
ACM Transactions on Database Systems (TODS)
Taxonomy of XML schema languages using formal language theory
ACM Transactions on Internet Technology (TOIT)
Mapping Relational Schemas to XML DTDs with Constraints
IMSCCS '06 Proceedings of the First International Multi-Symposiums on Computer and Computational Sciences - Volume 2 (IMSCCS'06) - Volume 02
Propagating XML constraints to relations
Journal of Computer and System Sciences
Efficient reasoning about a robust XML key fragment
ACM Transactions on Database Systems (TODS)
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Solving the implication problem for XML functional dependencies with properties
WoLLIC'10 Proceedings of the 17th international conference on Logic, language, information and computation
A comparative study of functional dependencies for XML
APWeb'05 Proceedings of the 7th Asia-Pacific web conference on Web Technologies Research and Development
On the existence of armstrong data trees for XML functional dependencies
FoIKS'10 Proceedings of the 6th international conference on Foundations of Information and Knowledge Systems
| Hi-index | 0.00 |
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.