Encyclopedia of Big Data Technologies

Living Edition
| Editors: Sherif Sakr, Albert Zomaya

Linked Data Management

  • Olaf Hartig
  • Katja Hose
  • Juan Sequeda
Living reference work entry
DOI: https://doi.org/10.1007/978-3-319-63962-8_76-1

Synonyms

Definitions

The term Linked Data refers to data that is made available on the Web in a structured, directly machine-processable form via the following four principles:
  1. 1.

    Use URIs as names for things

     
  2. 2.

    Use HTTP URIs so that people [and machines] can look up those names.

     
  3. 3.

    When someone looks up a URI, provide useful information, using the standards (RDF, SPARQL)

     
  4. 4.

    Include links to other URIs, so that they can discover more things. (Berners-Lee 2006; Bizer et al. 2009)

     
Per these principles, given a URI that names something (e.g., a person, a book, a concept, an abstract idea ) [Principle 1], it is possible to look up this URI using the HTTP protocol [Principle 2] and retrieve a document with RDF data describing the thing [Principle 3]. This data may include other URIs to refer to other things, and these URIs can be looked up in the same manner [Principle 4].

Overview

When applying the abovementioned principles, data becomes...

This is a preview of subscription content, log in to check access.

References

  1. Acosta M, Vidal M (2015) Networks of linked data eddies: an adaptive web query processing engine for RDF data. In: The semantic web – ISWC 2015 – 14th international semantic web conference, Proceedings, Part I, Bethlehem, 11–15 Oct 2015, pp 111–127. https://doi.org/10.1007/978-3-319-25007-6_7
  2. Avnur R, Hellerstein JM (2000) Eddies: continuously adaptive query processing. In: Proceedings of the 2000 ACM SIGMOD international conference on management of data, Dallas, 16–18 May 2000, pp 261–272. http://doi.acm.org/10.1145/342009.335420
  3. Berners-Lee T (2006) Design issues: linked data. Online at http://www.w3.org/DesignIssues/LinkedData.html Google Scholar
  4. Bizer C, Heath T, Berners-Lee T (2009) Linked data – the story so far. Int J Semantic Web Inf Syst (IJSWIS) 5(3):1–22CrossRefGoogle Scholar
  5. Bouquet P, Ghidini C, Serafini L (2009) Querying the web of data: a formal approach. In: The semantic web, fourth Asian conference, ASWC 2009, Proceedings, Shanghai, 6–9 Dec 2009, pp 291–305. https://doi.org/10.1007/978-3-642-10871-6_20
  6. Buil-Aranda C, Hogan A, Umbrich J, Vandenbussche P (2013) SPARQL web-querying infrastructure: ready for action? In: The semantic web – ISWC 2013 – 12th international semantic web conference, Proceedings, Part II, Sydney, 21–25 Oct 2013, pp 277–293. https://doi.org/10.1007/978-3-642-41338-4_18 Google Scholar
  7. Feigenbaum L, Williams GT, Clark KG, Torres E (2013) SPARQL 1.1 Protocol. W3C Recommendation. Online at https://www.w3.org/TR/sparql11-protocol/
  8. Fionda V, Gutierrez C, Pirrò G (2014) The swget portal: navigating and acting on the web of linked data. J Web Sem 26:29–35. https://doi.org/10.1016/j.websem.2014.04.003 CrossRefGoogle Scholar
  9. Fionda V, Pirrò G, Gutierrez C (2015) Nautilod: a formal language for the web of data graph. TWEB 9(1):5:1–5:43. http://doi.acm.org/10.1145/2697393
  10. Harth A, Hose K, Karnstedt M, Polleres A, Sattler K, Umbrich J (2010) Data summaries for on-demand queries over linked data. In: Proceedings of the 19th international conference on World Wide Web, WWW 2010, Raleigh, 26–30 Apr 2010, pp 411–420. http://doi.acm.org/10.1145/1772690.1772733
  11. Hartig O (2011a) How caching improves efficiency and result completeness for querying linked data. In: WWW2011 workshop on linked data on the Web, Hyderabad, 29 Mar 2011. http://ceur-ws.org/Vol-813/ldow2011-paper05.pdf
  12. Hartig O (2011b) Zero-knowledge query planning for an iterator implementation of link traversal based query execution. In: The semantic web: research and applications – 8th extended semantic web conference, ESWC 2011, Proceedings, Part I, Heraklion, 29 May–2 June 2011, pp 154–169. https://doi.org/10.1007/978-3-642-21034-1_11
  13. Hartig O (2012) SPARQL for a web of linked data: semantics and computability. In: The semantic web: research and applications – 9th extended semantic web conference, ESWC 2012, Proceedings, Heraklion, 27–31 May 2012, pp 8–23. https://doi.org/10.1007/978-3-642-30284-8_8
  14. Hartig O (2013) SQUIN: a traversal based query execution system for the web of linked data. In: Proceedings of the ACM SIGMOD international conference on management of data, SIGMOD 2013, New York, 22–27 June 2013, pp 1081–1084. http://doi.acm.org/10.1145/2463676.2465231
  15. Hartig O, Buil-Aranda C (2016) Bindings-restricted triple pattern fragments. In: On the move to meaningful internet systems: OTM 2016 conferences – confederated international conferences: CoopIS, C&TC, and ODBASE 2016, Proceedings, Rhodes, 24–28 Oct 2016, pp 762–779. https://doi.org/10.1007/978-3-319-48472-3_48
  16. Hartig O, Özsu MT (2016) Walking without a map: ranking-based traversal for querying linked data. In: The semantic web – ISWC 2016 – 15th international semantic web conference, Proceedings, Part I, Kobe, 17–21 Oct 2016, pp 305–324. https://doi.org/10.1007/978-3-319-46523-4_19
  17. Hartig O, Pérez J (2016) LDQL: a query language for the web of linked data. J Web Sem 41:9–29. https://doi.org/10.1016/j.websem.2016.10.001 CrossRefGoogle Scholar
  18. Hartig O, Bizer C, Freytag JC (2009) Executing SPARQL queries over the web of linked data. In: The semantic web – ISWC 2009, 8th international semantic web conference, ISWC 2009, Proceedings, Chantilly, 25–29 Oct 2009, pp 293–309. https://doi.org/10.1007/978-3-642-04930-9_19
  19. Ladwig G, Tran T (2010) Linked data query processing strategies. In: The semantic web – ISWC 2010 – 9th international semantic web conference, ISWC 2010, Revised Selected Papers, Part I, Shanghai, 7–11 Nov 2010, pp 453–469. https://doi.org/10.1007/978-3-642-17746-0_29
  20. Ladwig G, Tran T (2011) Sihjoin: querying remote and local linked data. In: The semantic web: research and applications – 8th extended semantic web conference, ESWC 2011, Proceedings, Part I, Heraklion, 29 May–2 June 2011, pp 139–153. https://doi.org/10.1007/978-3-642-21034-1_10
  21. Lynden SJ, Kojima I, Matono A, Nakamura A, Yui M (2013) A hybrid approach to linked data query processing with time constraints. In: Proceedings of the WWW2013 workshop on linked data on the web, Rio de Janeiro, 14 May 2013. http://ceur-ws.org/Vol-996/papers/ldow2013-paper-07.pdf
  22. Mika P, Potter T (2012) Metadata statistics for a large web corpus. In: Proceedings of the 5th linked data on the web workshop (LDOW)Google Scholar
  23. 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: Proceedings of the workshop on artificial intelligence meets the web of data (AImWD)Google Scholar
  24. 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: Proceedings of the 2nd international conference on ambient systems, networks and technologies (ANT 2011), the 8th international conference on mobile web information systems (MobiWIS-2011), Niagara Falls, 19–21 Sept 2011, pp 554–561. https://doi.org/10.1016/j.procs.2011.07.072
  25. Schaffert S, Bauer C, Kurz T, Dorschel F, Glachs D, Fernandez M (2012) The linked media framework: integrating and interlinking enterprise media content and data. In: I-SEMANTICS 2012 – 8th international conference on semantic systems, I-SEMANTICS’12, Graz, 5–7 Sept 2012, pp 25–32. http://doi.acm.org/10.1145/2362499.2362504
  26. Schmachtenberg M, Bizer C, Paulheim H (2014) Adoption of the linked data best practices in different topical domains. In: Proceedings of the 13th international semantic web conference (ISWC)Google Scholar
  27. Schmedding F (2011) Incremental SPARQL evaluation for query answering on linked data. In: Proceedings of the second international workshop on consuming linked data (COLD 2011), Bonn, 23 Oct 2011. http://ceur-ws.org/Vol-782/Schmedding_COLD2011.pdf
  28. Tian Y, Umbrich J, Yu Y (2011) Enhancing source selection for live queries over linked data via query log mining. In: The semantic web – joint international semantic technology conference, JIST 2011, Proceedings, Hangzhou, 4–7 Dec 2011, pp 176–191. https://doi.org/10.1007/978-3-642-29923-0_12
  29. Umbrich J, Hose K, Karnstedt M, Harth A, Polleres A (2011) Comparing data summaries for processing live queries over linked data. World Wide Web 14(5–6):495–544. https://doi.org/10.1007/s11280-010-0107-z CrossRefGoogle Scholar
  30. Umbrich J, Karnstedt M, Hogan A, Parreira JX (2012) Hybrid SPARQL queries: fresh vs. fast results. In: The semantic web – ISWC 2012 – 11th international semantic web conference, Proceedings, Part I, Boston, 11–15 Nov 2012, pp 608–624. https://doi.org/10.1007/978-3-642-35176-1_38
  31. Vander Sande M, Verborgh R, Van Herwegen J, Mannens E, Van de Walle R (2015) Opportunistic linked data querying through approximate membership metadata. In: The semantic web – ISWC 2015 – 14th international semantic web conference, Proceedings, Part I, Bethlehem, 11–15 Oct 2015, pp 92–110. https://doi.org/10.1007/978-3-319-25007-6_6
  32. Van Herwegen J, Verborgh R, Mannens E, Van de Walle R (2015) Query execution optimization for clients of triple pattern fragments. In: The semantic web. Latest advances and new domains – 12th European semantic web conference, ESWC 2015, Proceedings, Portoroz, 31 May–4 June 2015, pp 302–318. https://doi.org/10.1007/978-3-319-18818-8_19
  33. Verborgh R, Vander Sande M, Hartig O, Van Herwegen J, De Vocht L, De Meester B, Haesendonck G, Colpaert P (2016) Triple pattern fragments: a low-cost knowledge graph interface for the web. J Web Sem 37–38:184–206. https://doi.org/10.1016/j.websem.2016.03.003 CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG 2018

Authors and Affiliations

  1. 1.Linköping UniversityLinköpingSweden
  2. 2.Aalborg UniversityAalborgDenmark
  3. 3.CapsentaAustinUSA

Section editors and affiliations

  • Hannes Voigt
    • 1
  • George Fletcher
    • 2
  1. 1.Dresden Database Systems GroupTechnische Universität DresdenDresdenGermany
  2. 2.Department of Mathematics and Computer ScienceEindhoven University of Technology