作者: Gyula I. Szabó , András Benczúr
DOI: 10.1007/978-3-642-28472-4_22
关键词:
摘要: In this paper, we first rephrase the notion of extended tuple as a sentence from regular language generated by grammar G where nonterminal symbols are attribute names tuple. Finite sets tuples play role relation instances. Then introduce dual language, which generates accepted tuple-types relation. We define syntactical form functional dependencies for on graph finite state automaton associated to language. Using model can handle relations recursive expressions too. The implication problem our class is decidable version Chase algorithm specified FSA.