CoChat
Sign Up
Cited by 51

The DOI matches its Crossref record.

An Overview on Execution Strategies for Linked Data Queries

Hartig, Olaf·2013·Datenbank-Spektrum
DOI 10.1007/s13222-013-0122-1
Open this paper in CoChat — free account

Overview

Integrity signals

Registry

Crossref · 10.1007/s13222-013-0122-1

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Traversal-based querying does not allow for the efficient and complete evaluation of certain types of queries.

    “Such limited interfaces normally have the drawback that traversal-based querying does not allow for the efficient and complete evaluation of certain types of queries (Hartig, 2013)”

    From Decentralized provenance-aware publishing with nanopublications (2016) · cites this paper as Hartig, 2013

Citations

Cites

No references could be resolved yet.

Research works printed but not linked: 36

  1. Batsakis S, Petrakis EGM, Milios E (2009) Improving the performance of focused web crawlers. Data Knowl Eng 68(10):1001–1013 · DOI
  2. Bizer C, Heath T, Berners-Lee T (2009) Linked data—the story so far. Int J Semantic Web Inf Syst 5(3):1–22 · DOI
  3. Bouquet P, Ghidini C, Serafini L (2009) Querying the web of data: a formal approach. In: Proc of the 4th Asian semantic web conference (ASWC)
  4. Chakrabarti S, van den Berg M, Dom B (1999) Focused crawling: a new approach to topic-specific web resource discovery. Comput Netw 31(11–16):1623–1640 · DOI
  5. Diligenti M, Coetzee F, Lawrence S, Giles CL, Gori M (2000) Focused crawling using context graphs. In: Proc of the 26th int conf on very large data bases (VLDB)
  6. Ding L, Shinavier J, Shangguan Z, McGuinness DL (2010) SameAs networks and beyond: analyzing deployment status and implications of owl: sameAs in linked data. In: Proc of the 9th international semantic web conference (ISWC)
  7. Dolog P, Stuckenschmidt H, Wache H, Diederich J (2009) Relaxing RDF queries based on user and domain preferences. J Intell Inf Syst 33(3):239–260 · DOI
  8. Görlitz O, Staab S (2011) Federated data management and query optimization for linked open data. In: New directions in web data management 1, pp 109–137 · DOI
  9. Harth A, Decker S (2005) Optimized index structures for querying RDF from the web. In: Proc of the 3rd Latin American web congress (LA-web)
  10. Harth A, Hose K, Karnstedt M, Polleres A, Sattler K-U, Umbrich J (2010) Data summaries for on-demand queries over linked data. In: Proc of the 19th int conf on world wide web (WWW)
  11. Harth A, Speiser S (2012) On completeness classes for query evaluation on linked data. In: Proc of the 26th AAAI conference
  12. Hartig O (2011) How caching improves efficiency and result completeness for querying linked data. In: Proc of the 4th linked data on the web workshop (LDOW)
  13. Hartig O (2011) Zero-knowledge query planning for an iterator implementation of link traversal based query execution. In: Proc of the 8th extended semantic web conference (ESWC)
  14. Hartig O (2012) SPARQL for a web of linked data: semantics and computability. In: Proc of the 9th extended semantic web conference (ESWC)
  15. Hartig O, Bizer C, Freytag J-C (2009) Executing SPARQL queries over the Web of Linked Data. In: Proc of the 8th international semantic web conference (ISWC)
  16. Hartig O, Freytag J-C (2012) Foundations of traversal based query execution over linked data. In: Proc of the 23rd ACM conference on hypertext and social media (HT)
  17. Hartig O, Langegger A (2010) A database perspective on consuming linked data on the web. Datenbank-Spektrum 10(2) · DOI
  18. Heath T, Bizer C (2011) Linked data: evolving the web into a global data space. Morgan & Claypool · DOI
  19. Hogan A, Harth A, Umrich J, Kinsella S, Polleres A, Decker S (2012) Searching and browsing linked data with SWSE: the semantic web search engine. Web semantics: science, services and agents on the world wide web 9(4) · DOI
  20. Hogan A, Mellotte M, Powell G, Stampouli D (2012) Towards fuzzy query-relaxation for RDF. In: Proc of the 9th extended semantic web conference (ESWC)
  21. Huang H, Liu C, Zhou X (2012) Approximating query answering on RDF databases. World Wide Web J 15(1):89–114 · DOI
  22. Joshi AK, Jain P, Hitzler P, Yeh PZ, Verma K, Sheth AP, Damova M (2012) Alignment-based querying of linked open data. In: Proc of the 11th int conference on ontologies, DataBases, and applications of semantics (ODBASE)
  23. Ladwig G, Tran DT (2010) Linked data query processing strategies. In: Proc of the 9th international semantic web conference (ISWC)
  24. Ladwig G, Tran DT (2011) SIHJoin: querying remote and local linked data. In: Proc of the 8th extended semantic web conference (ESWC)
  25. Makris K, Gioldasis N, Bikakis N, Christodoulakis S (2010) Ontology mapping and SPARQL rewriting for querying federated RDF data sources. In: Proceedings of OTM conferences
  26. Mika P, Potter T (2012) Metadata statistics for a large web corpus. In: Proc of the 5th linked data on the web workshop (LDOW)
  27. Miranker DP, Depena RK, Jung H, Sequeda JF, Reyna C (2012) Diamond: a SPARQL query engine, for linked data based on the Rete match. In: Proc of the workshop on artificial intelligence meets the web of data (AImWD)
  28. Mühleisen H, Bizer C (2012) Web data commons—extracting structured data from two large web corpora. In: Proc of the 5th linked data on the web workshop (LDOW)
  29. Neumann T, Weikum G (2008) RDF-3X: a RISC-style engine for RDF. In: Proc of the 34th int conf on very large data bases (VLDB)
  30. Paret E, Van Woensel W, Casteleyn S, Signer B, De Troyer O (2011) Efficient querying of distributed RDF sources in mobile settings based on a source index model. In: Procedia CS
  31. Schmedding F (2011) Incremental SPARQL evaluation for query answering on linked data. In: Proc of the 2nd int workshop on consuming linked data (COLD)
  32. Tian Y, Umbrich J, Yu Y (2011) Enhancing source selection for live queries over linked data via query log mining. In: Proc of the joint int semantic technology conference (JIST)
  33. Umbrich J, Hogan A, Polleres A, Decker S (2012) Improving the recall of live linked data querying through reasoning. In: Proc of the 6th int conference on web reasoning and rule systems (RR)
  34. Umbrich J, Hose K, Karnstedt M, Harth A, Polleres A (2011) Comparing data summaries for processing live queries over linked data. World Wide Web J 14(5–6):495–544 · DOI
  35. Wagner A, Tran T, Ladwig G, Harth A (2012) Top-k linked data query processing. In: Proc of the 9th extended semantic web conference (ESWC)
  36. Weiss C, Karras P, Bernstein A (2008) Hexastore: sextuple indexing for semantic web data management. In: Proc of the 34th international conference on very large data bases (VLDB)

Cited by

Sorted by citations

Metadata

Authors
Hartig, O.
Venue
Datenbank-Spektrum
Publisher
Springer Science and Business Media LLC
Published
2013-05-23
Volume
13
Issue
2
Pages
89-99
ISSN
  • 1618-2162
  • 1610-1995
DOI
10.1007/s13222-013-0122-1
Cited by
51
References
0
Language
en
Licence
www.springer.com/tdm (tdm)

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review