A Hybrid Approach to Linked Data Query Processing with Time Constraints
暂无分享,去创建一个
[1] Maribel Acosta,et al. ANAPSID: An Adaptive Query Processing Engine for SPARQL Endpoints , 2011, SEMWEB.
[2] Günter Ladwig,et al. FedBench: A Benchmark Suite for Federated Semantic Data Query Processing , 2011, SEMWEB.
[3] Michael Stonebraker. A Database Perspective , 1982, On Conceptual Modelling.
[4] Michael Hausenblas,et al. Describing linked datasets with the VoID vocabulary , 2011 .
[5] Tom Heath,et al. Linked Data: Evolving the Web into a Global Data Space , 2011, Linked Data.
[6] Wolfram Wöß,et al. A Semantic Web middleware for Virtual Data Integration on the Web , 2008, ESWC.
[7] Óscar Corcho,et al. Semantics and Optimization of the SPARQL 1.1 Federation Extension , 2011, ESWC.
[8] Olaf Hartig,et al. A Database Perspective on Consuming Linked Data on the Web , 2010, Datenbank-Spektrum.
[9] Jürgen Umbrich,et al. Freshening up while Staying Fast: Towards Hybrid SPARQL Queries , 2012, EKAW.
[10] Olaf Hartig,et al. Foundations of traversal based query execution over linked data , 2011, HT '12.
[11] Ulf Leser,et al. Querying Distributed RDF Data Sources with SPARQL , 2008, ESWC.
[12] Gonzalo Navarro,et al. A guided tour to approximate string matching , 2001, CSUR.