Corpus ID: 14558934

Multi-objective Linked Data Query Optimization : Technical Report

@inproceedings{Ladwig2012MultiobjectiveLD,
  title={Multi-objective Linked Data Query Optimization : Technical Report},
  author={G. Ladwig and T. Tran},
  year={2012}
}
  • G. Ladwig, T. Tran
  • Published 2012
  • Computer Science
  • With the rapid proliferation of Linked Data on theWeb, the topic of Linked Data query processing has recently gained attention. Works in this direction do not assume full availability of SPARQL endpoints. As an alternative to federation over these endpoints, this new querying paradigm follows the Linked Data principles to use only HTTP lookups for accessing and querying Linked Data. Existing works focus on the ranking and pruning of sources behind the query URIs, or on the ecient processing of… CONTINUE READING
    1 Citations

    References

    SHOWING 1-10 OF 19 REFERENCES
    SIHJoin: Querying Remote and Local Linked Data
    • 71
    • PDF
    Executing SPARQL Queries over the Web of Linked Data
    • 394
    • Highly Influential
    • PDF
    Data summaries for on-demand queries over linked data
    • 215
    • Highly Influential
    • PDF
    Linked Data Query Processing Strategies
    • 121
    • PDF
    MiniCon: A scalable algorithm for answering queries using views
    • 440
    • PDF
    Scalable join processing on very large RDF graphs
    • 239
    • PDF
    Joint optimization of cost and coverage of query plans in data integration
    • 39
    • PDF
    FedBench: A Benchmark Suite for Federated Semantic Data Query Processing
    • 157
    • PDF
    Zero-Knowledge Query Planning for an Iterator Implementation of Link Traversal Based Query Execution
    • 76
    • PDF
    Selectivity estimation for SPARQL graph pattern
    • 6
    • PDF