0


sihjoin:查询远程和本地链接数据

SIHJoin: Querying Remote and Local Linked Data
课程网址: http://videolectures.net/eswc2011_ladwig_quering/  
主讲教师: Günter Ladwig
开课单位: 卡尔斯鲁厄理工学院
开课时间: 2011-07-07
课程语种: 英语
中文简介:
关联数据的数量正在稳步增长。优化自上而下的关联数据查询处理基于对所有源的完整知识,基于源的运行时发现的自下而上处理以及组合它们的混合策略已被提出。关联数据处理的一个特殊问题是源和访问选项的异构性导致不同的输入延迟,使得阻塞连接运算符的应用变得不可靠。以前的工作通过提出一个基于非阻塞迭代器的运算符和另一个基于对称散列连接的运算符来部分地解决这个问题。在本文中,我们提出了这两个运算符的详细成本模型,以便系统地比较它们,并允许查询优化。此外,我们提出了一个名为Symmetric Index Hash Join的新型运算符,以解决关联数据查询处理的一个未解决问题:不仅要查询远程链接数据,还要查询本地链接数据。我们对现实世界数据集进行实验,以将我们的方法与基于迭代器的基线进行比较,并创建合成数据集,以更系统地分析由建议的成本模型捕获的各个组件的影响。
课程简介: 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 has been proposed. One 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 infea- sible. Previous work partially address this by proposing a non-blocking iterator-based operator and another one based on symmetric-hash join. In this paper, 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.
关 键 词: 关联数据; 混合策略; 异构性
课程来源: 视频讲座网
最后编审: 2019-04-13:cwx
阅读次数: 32