Approximation and relaxation of semantic web path queries-Reference-Cited by-同舟云学术

Approximation and relaxation of semantic web path queries

Published:2016-10 Issue: Volume:40 Page:1-21
ISSN:1570-8268
Container-title:Journal of Web Semantics
language:en
Short-container-title:Journal of Web Semantics

Author:

Poulovassilis Alexandra,Selmer Petra,Wood Peter T.

Publisher

Elsevier BV

Subject

Computer Networks and Communications,Human-Computer Interaction,Software

Reference78 articles.

1. T. Berners-Lee, Y. Chen, L. Chilton, D. Connolly, R. Dhanaraj, J. Hollenbach, A. Lerer, D. Sheets, Tabulator: Exploring and analyzing linked data on the semantic web, in: Proc. 3rd Int. Semantic Web User Interaction Workshop, 2006.

2. A. Singhal, Introducing the Knowledge Graph: things, not strings, in: Official Google Blog, 2012, https://googleblog.blogspot.co.uk/2012/05/introducing-knowledge-graph-things-not.html.

3. I.F. Cruz, A.O. Mendelzon, P.T. Wood, A graphical query language supporting recursion, in: Proc. ACM SIGMOD, 1987, pp. 323–330.

4. D. Calvanese, G.D. Giacomo, M. Lenzerini, M.Y. Vardi, Containment of conjunctive regular path queries with inverse, in: Proc. 7th Int. Conf. on Principles of Knowledge Representation and Reasoning, 2000, pp. 176–185.

5. K. Kochut, M. Janik, SPARQLeR: Extended SPARQL for semantic association discovery, in: Proc. 4th European Semantic Web Conference, 2007, pp. 145–159.

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Optimisation Techniques for Flexible SPARQL Queries;ACM Transactions on the Web;2022-11-16

2. Relaxing relationship queries on graph data;Journal of Web Semantics;2020-03

3. Generating Compact and Relaxable Answers to Keyword Queries over Knowledge Graphs;Lecture Notes in Computer Science;2020

4. Estimating query rewriting quality over LOD;Semantic Web;2019-04-05

5. Augmented Access for Querying and Exploring a Polystore;2018 IEEE 34th International Conference on Data Engineering (ICDE);2018-04