Opportunistic Linked Data Querying Through Approximate Membership Metadata-Reference-Cited by-同舟云学术

Opportunistic Linked Data Querying Through Approximate Membership Metadata

Published:2015 Issue: Volume: Page:92-110
ISSN:0302-9743
Container-title:The Semantic Web - ISWC 2015
language:
Short-container-title:

Author:

Vander Sande Miel,Verborgh Ruben,Van Herwegen Joachim,Mannens Erik,Van de Walle Rik

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-25007-6_6

Reference27 articles.

1. Lecture Notes in Computer Science;G Aluç,2014

2. Basca, C., Bernstein, A.: Avalanche: putting the spirit of the Web back into semantic web querying. In: Scalable Semantic Web Knowledge Base Systems, pp. 64–79 (2010)

3. Bloom, B.H.: Space/time trade-offs in hash coding with allowable errors. Communications of the ACM 13(7), 422–426 (1970)

4. Lecture Notes in Computer Science;C Buil-Aranda,2013

5. Communications in Computer and Information Science;I Ermilov,2013

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

1. Optimisation of Link Traversal Query Processing over Distributed Linked Data through Adaptive Techniques;Lecture Notes in Computer Science;2023

2. Bloom Filter Based Graph Database CRUD Optimization for Stream Data;2021 11th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications (IDAACS);2021-09-22

3. Linked Data Management;Encyclopedia of Big Data Technologies;2019

4. Toward sustainable publishing and querying of distributed Linked Data archives;Journal of Documentation;2018-01-08

5. Comunica: A Modular SPARQL Query Engine for the Web;Lecture Notes in Computer Science;2018