Gram:一种图形数据模型和查询语言

European Conference on Hypertext Pub Date : 1992-11-30 DOI:10.1145/168466.168527

B. Amann, M. Scholl

{"title":"Gram:一种图形数据模型和查询语言","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":"{\"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}","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

摘要

我们提出了一个将数据组织成图形的模型。节点和边缘标签类型上的正则表达式用于限定连接子图。介绍了一种基于这些正则表达式的代数语言，并支持一种限制形式的递归。该模型及其查询语言的自然应用是超文本查询。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Gram: a graph data model and query languages

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

European Conference on Hypertext

自引率

0.00%

发文量

期刊最新文献

VIKI: spatial hypertext supporting emergent structure Querying typed hypertexts in Multicard/O2 Backtracking in a multiple-window hypertext environment Chimera: hypertext for heterogeneous software environments Accessing hyperdocuments through interactive dynamic maps