Corpus ID: 218502366

Guided Link-Traversal-Based Query Processing

@article{Verborgh2020GuidedLQ,
  title={Guided Link-Traversal-Based Query Processing},
  author={R. Verborgh and Ruben Taelman},
  journal={ArXiv},
  year={2020},
  volume={abs/2005.02239}
}
  • R. Verborgh, Ruben Taelman
  • Published 2020
  • Computer Science
  • ArXiv
  • 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… CONTINUE READING

    Tables and Topics from this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-8 OF 8 REFERENCES
    Custom Pictorial Structures for Re-identification
    592
    Re-decentralizing the Web, for good this time
    • 2020
    Comunica: A Modular SPARQL Query Engine for the Web
    20
    Comunica: a modular query engine for the Web
    • 2018
    Walking Without a Map: Ranking-Based Traversal for Querying Linked Data
    8
    LDQL: A Query Language for the Web of Linked Data
    22
    An Overview on Execution Strategies for Linked Data Queries
    55
    SPARQL for a Web of Linked Data: Semantics and Computability (Extended Version)
    57
    for a Web of Linked Data: semantics and computability
    • 2012