Gram : A Graph Data Model and Query Language

Bernd Amann (1) , Michel Scholl (1)

1 CEDRIC - Centre d'études et de recherche en informatique et communications

We present a model for data organized as graphs. Regular expressions over the types of the node and edge labels are used to qualify connected subgraphs. An algebraic language based on these regular expressions and supporting a restricted form of recursion is introduced. A natural application of this model and its query language is hypertext querying.

Domaines: Informatique [cs]; Base de données [cs.DB]

Bernd Amann, Michel Scholl. Gram : A Graph Data Model and Query Language. ECHT92: European Conference on Hypertext '92, Nov 1992, Milan, Italy. ⟨hal-01124475⟩