{"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}
引用次数: 0
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.