A CALCULUS AND ALGEBRA FOR QUERYING DIRECTED ACYCLIC GRAPHS
Simone Santini, Amarnath Gupta · 2006
Palabras clave: Bases de datos, lenguajes de consultas, grafos Resumen. In this paper we present a language for querying directed acyclic graph. The language is based on patterns, that is, grosso modo, on variable-free logic expressions. In order to be included in a broader calculus, the language allows the assignment to variables of portions of a graph that match sub-patterns. Finally, we show how the epressions in the language can be translated into a query plan that makes use of an algebra based on the elementary operations of monoid calculus. 1