{"title":"RDF与关系数据库联合的路径查询语言","authors":"Jiahui Zhang, Xiaowang Zhang, Zhiyong Feng","doi":"10.1145/3068839.3068840","DOIUrl":null,"url":null,"abstract":"In this paper, we present a federated path querying language (FPQ) as itself an extension of the nested regular path querying language with adding an axis operator to support the federation of RDF dataset and relational database. We have proven that FPQ has more expressive power than the nested regular path query language (not to mention regular path querying language). It enjoys the same computational complexity as the regular path query language and its additional expressivity can be exactly used to characterize the conjunction and federation of nested regular path queries. Moreover, we discuss the expressivity of various fragments of FPQ and implement FPQ. Finally, we present an application scenario related to the car-pooling services in real life.","PeriodicalId":211805,"journal":{"name":"Proceedings of the 20th International Workshop on the Web and Databases","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2017-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Path Querying Language for Federation of RDF and Relational Database\",\"authors\":\"Jiahui Zhang, Xiaowang Zhang, Zhiyong Feng\",\"doi\":\"10.1145/3068839.3068840\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we present a federated path querying language (FPQ) as itself an extension of the nested regular path querying language with adding an axis operator to support the federation of RDF dataset and relational database. We have proven that FPQ has more expressive power than the nested regular path query language (not to mention regular path querying language). It enjoys the same computational complexity as the regular path query language and its additional expressivity can be exactly used to characterize the conjunction and federation of nested regular path queries. Moreover, we discuss the expressivity of various fragments of FPQ and implement FPQ. Finally, we present an application scenario related to the car-pooling services in real life.\",\"PeriodicalId\":211805,\"journal\":{\"name\":\"Proceedings of the 20th International Workshop on the Web and Databases\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-05-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 20th International Workshop on the Web and Databases\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3068839.3068840\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 20th International Workshop on the Web and Databases","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3068839.3068840","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Path Querying Language for Federation of RDF and Relational Database
In this paper, we present a federated path querying language (FPQ) as itself an extension of the nested regular path querying language with adding an axis operator to support the federation of RDF dataset and relational database. We have proven that FPQ has more expressive power than the nested regular path query language (not to mention regular path querying language). It enjoys the same computational complexity as the regular path query language and its additional expressivity can be exactly used to characterize the conjunction and federation of nested regular path queries. Moreover, we discuss the expressivity of various fragments of FPQ and implement FPQ. Finally, we present an application scenario related to the car-pooling services in real life.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
