|
 
|
[AS92a] Gram : A Graph Data Model and Query Language
Conférence Internationale avec comité de lecture : ACM ECHT, January 1992,
motcle:
Résumé:
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.
Commentaires:
Milano, Italy
BibTeX
| @inproceedings { | |||
| AS92a, | |||
| title | = | "{Gram : A Graph Data Model and Query Language}", | |
| author | = | " B. Amann and M. Scholl ", | |
| booktitle | = | "{ACM ECHT}", | |
| year | = | 1992, | |
| month | = | "January", | |
| note | = | "{Milano, Italy}", | |
| } | |||
