arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2005.02239cs.DBcs.IRcs.SI
收藏

基于引导式链接流的查询处理

Guided Link-Traversal-Based Query Processing

Ruben Verborgh, Ruben Taelman

摘要:

基于链接的查询处理(LTBQP)是一种通过从一组种子文档开始评估数据Web上的查询的技术,这些种子文档通过以下超链接动态扩展。与静态源集合上的查询评估相比,LTBQP由于所需的网络请求的数量而明显较慢。此外,由于来源是动态选择的,因此人们对结果的相关性和可信度感到关切。为了解决这两个问题,我们提出了引导LTBQP,一种技术,其中有关文档链接结构和内容策略的信息传递到查询处理器。因此,处理器可以通过仅遵循相关链接来修剪文档的搜索树,并且通过限制针对什么种类的内容考虑哪些文档来将结果集限制为期望的结果。在这篇探索性的论文中,我们在高层次上描述了这项技术,并概述了它的一些应用。我们认为,这样的指导可以使LTBQP在分散的环境中,数据分布在不同级别的用户信任的文档中的一个有价值的查询策略。

英文摘要:

Link-Traversal-Based Query Processing (LTBQP) is a technique for evaluating queries over a web of data by starting with a set of seed documents that is dynamically expanded through following hyperlinks. Compared to query evaluation over a static set of sources, LTBQP is significantly slower because of the number of needed network requests. Furthermore, there are concerns regarding relevance and trustworthiness of results, given that sources are selected dynamically. To address both issues, we propose guided LTBQP, a technique in which information about document linking structure and content policies is passed to a query processor. Thereby, the processor can prune the search tree of documents by only following relevant links, and restrict the result set to desired results by limiting which documents are considered for what kinds of content. In this exploratory paper, we describe the technique at a high level and sketch some of its applications. We argue that such guidance can make LTBQP a valuable query strategy in decentralized environments, where data is spread across documents with varying levels of user trust.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑