Dataflow query execution in a parallel main-memory environment
Distributed and Parallel Databases - Selected papers from the first international conference on parallel and distributed information systems
Fjording the Stream: An Architecture for Queries Over Streaming Sensor Data
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Hash-Merge Join: A Non-blocking Join Algorithm for Producing Fast and Early Join Results
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
RPJ: producing fast join results on streams through rate-based optimization
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Double Index NEsted-Loop Reactive Join for Result Rate Optimization
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Semplore: A scalable IR approach to search the Web of Data
Web Semantics: Science, Services and Agents on the World Wide Web
Executing SPARQL Queries over the Web of Linked Data
ISWC '09 Proceedings of the 8th International Semantic Web Conference
Data summaries for on-demand queries over linked data
Proceedings of the 19th international conference on World wide web
Linked data query processing strategies
ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
ANAPSID: an adaptive query processing engine for SPARQL endpoints
ISWC'11 Proceedings of the 10th international conference on The semantic web - Volume Part I
FedBench: a benchmark suite for federated semantic data query processing
ISWC'11 Proceedings of the 10th international conference on The semantic web - Volume Part I
FedX: optimization techniques for federated query processing on linked data
ISWC'11 Proceedings of the 10th international conference on The semantic web - Volume Part I
Foundations of traversal based query execution over linked data
Proceedings of the 23rd ACM conference on Hypertext and social media
SPARQL for a web of linked data: semantics and computability
ESWC'12 Proceedings of the 9th international conference on The Semantic Web: research and applications
Top-k linked data query processing
ESWC'12 Proceedings of the 9th international conference on The Semantic Web: research and applications
Improving the recall of live linked data querying through reasoning
RR'12 Proceedings of the 6th international conference on Web Reasoning and Rule Systems
Hybrid SPARQL queries: fresh vs. fast results
ISWC'12 Proceedings of the 11th international conference on The Semantic Web - Volume Part I
Federating queries in SPARQL 1.1: Syntax, semantics and evaluation
Web Semantics: Science, Services and Agents on the World Wide Web
Colledge: a vision of collaborative knowledge networks
Proceedings of the 2nd International Workshop on Semantic Search over the Web
Hi-index | 0.00 |
The amount of Linked Data is increasing steadily. Optimized top-down Linked Data query processing based on complete knowledge about all sources, bottom-up processing based on run-time discovery of sources as well as a mixed strategy that combines them have been proposed. A particular problem with Linked Data processing is that the heterogeneity of the sources and access options lead to varying input latency, rendering the application of blocking join operators infeasible. Previous work partially address this by proposing a non-blocking iterator-based operator and another one based on symmetric-hash join. Here, we propose detailed cost models for these two operators to systematically compare them, and to allow for query optimization. Further, we propose a novel operator called the Symmetric Index Hash Join to address one open problem of Linked Data query processing: to query not only remote, but also local Linked Data. We perform experiments on real-world datasets to compare our approach against the iterator-based baseline, and create a synthetic dataset to more systematically analyze the impacts of the individual components captured by the proposed cost models.