查询图结构数据

2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007) Pub Date : 2007-09-18 DOI:10.1109/NPC.2007.166

Jiefeng Cheng, Jeffrey Xu Yu

{"title":"查询图结构数据","authors":"Jiefeng Cheng, Jeffrey Xu Yu","doi":"10.1109/NPC.2007.166","DOIUrl":null,"url":null,"abstract":"Graphs have great expressive power to describe the complex relationships among data objects, and there are large graph datasets available such as Web data, semi-structured data and XML data. In this paper, we describe our work on querying graph-structured data, including graph labeling methods, reachability joins, and graph pattern matching. We show that we can base on the graph labeling of complex XML and semi-structured data to process path queries and we devise join primitives for matching graph patterns. Novel aspects about using such join primitives for graph pattern matching are addressed.","PeriodicalId":278518,"journal":{"name":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Querying Graph-Structured Data\",\"authors\":\"Jiefeng Cheng, Jeffrey Xu Yu\",\"doi\":\"10.1109/NPC.2007.166\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Graphs have great expressive power to describe the complex relationships among data objects, and there are large graph datasets available such as Web data, semi-structured data and XML data. In this paper, we describe our work on querying graph-structured data, including graph labeling methods, reachability joins, and graph pattern matching. We show that we can base on the graph labeling of complex XML and semi-structured data to process path queries and we devise join primitives for matching graph patterns. Novel aspects about using such join primitives for graph pattern matching are addressed.\",\"PeriodicalId\":278518,\"journal\":{\"name\":\"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-09-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NPC.2007.166\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NPC.2007.166","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

图在描述数据对象之间的复杂关系方面具有强大的表达能力，并且有大量可用的图数据集，如Web数据、半结构化数据和XML数据。在本文中，我们描述了我们在查询图结构数据方面的工作，包括图标记方法、可达性连接和图模式匹配。我们展示了可以基于复杂XML和半结构化数据的图标记来处理路径查询，并设计了连接原语来匹配图模式。讨论了使用这种连接原语进行图模式匹配的新方面。

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

查看原文本刊更多论文

Querying Graph-Structured Data

Graphs have great expressive power to describe the complex relationships among data objects, and there are large graph datasets available such as Web data, semi-structured data and XML data. In this paper, we describe our work on querying graph-structured data, including graph labeling methods, reachability joins, and graph pattern matching. We show that we can base on the graph labeling of complex XML and semi-structured data to process path queries and we devise join primitives for matching graph patterns. Novel aspects about using such join primitives for graph pattern matching are addressed.

求助全文

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

来源期刊

2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)

自引率

0.00%

发文量