论文信息 - Provenance for Regular Path Queries

Provenance for Regular Path Queries

Regular path queries (RPQs) the ubiquitous mechanism for querying data graphs of partially known structure. RPQs are in essence regular expressions over the edge symbols. The answer to an RPQ on a given graph (database) is the set of pairs of objects, which are connected by paths spelling words in the language of the regular path query. Often the database edges come with a weights assoaciated to them. Such weights can distances, levels of discomfort, multiplicities, etc. We model weights using semiring frameworks.

Alex Thomo | Gosta Grahne | Alex Thomo | Gösta Grahne

[1] Kosaburo Hashiguchi. New upper bounds to the limitedness of distance automata , 2000, Theor. Comput. Sci..

[2] Jacques Sakarovitch,et al. Elements of Automata Theory , 2009 .

[3] Grzegorz Rozenberg,et al. Handbook of formal languages, vol. 1: word, language, grammar , 1997 .

[4] Kosaburo Hashiguchi,et al. Limitedness Theorem on Finite Automata with Distance Functions , 1982, J. Comput. Syst. Sci..

[5] Daniel Krob,et al. The Equality Problem for Rational Series with Multiplicities in the tropical Semiring is Undecidable , 1992, Int. J. Algebra Comput..

[6] Imre Simon,et al. On Semigroups of Matrices over the Tropical Semiring , 1994, RAIRO Theor. Informatics Appl..

[7] Helmut Seidl,et al. On the Degree of Ambiguity of Finite Automata , 1986, MFCS.

[8] Val Tannen,et al. Provenance semirings , 2007, PODS.

[9] Hing Leung. Limitedness Theorem on Finite Automata with Distance Functions: An Algebraic Proof , 1991, Theor. Comput. Sci..

[10] William W. Wadge,et al. Preferential Regular Path Queries , 2009, Fundam. Informaticae.

[11] Samuel Eilenberg,et al. Automata, languages, and machines. A , 1974, Pure and applied mathematics.

[12] Diego Calvanese,et al. Rewriting of regular expressions and regular path queries , 1999, PODS '99.

[13] Harry B. Hunt,et al. On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata , 1985, SIAM J. Comput..