{"title":"Gram: a graph data model and query languages","authors":"B. Amann, M. Scholl","doi":"10.1145/168466.168527","DOIUrl":null,"url":null,"abstract":"We present a model for data organized as graphs. Regular expressions over the types of the node and edge labels\nare used to qualify connected subgraphs. An algebraic language based on these regular expressions and supporting\na restricted form of recursion is introduced. A natural application of this model and its query language is hypertext\nquerying.","PeriodicalId":112968,"journal":{"name":"European Conference on Hypertext","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"122","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"European Conference on Hypertext","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/168466.168527","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 122
Abstract
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
