liu.seSök publikationer i DiVA
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
LDQL: A query language for the Web of Linked Data
Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska fakulteten.
University of Chile, Chile; Chilean Centre Semant Web Research, Chile.
2016 (Engelska)Ingår i: Journal of Web Semantics, ISSN 1570-8268, E-ISSN 1873-7749, Vol. 41Artikel i tidskrift (Refereegranskat) Published
Abstract [en]

The Web of Linked Data is composed of tons of RDF documents interlinked to each other forming a huge repository of distributed semantic data. Effectively querying this distributed data source is an important open problem in the Semantic Web area. In this paper, we propose LDQL, a declarative language to query Linked Data on the Web. One of the novelties of LDQL is that it expresses separately (i) patterns that describe the expected query result, and (ii) Web navigation paths that select the data sources to be used for computing the result. We present a formal syntax and semantics, prove equivalence rules, and study the expressiveness of the language. In particular, we show that LDQL is strictly more expressive than all the query formalisms that have been proposed previously for Linked Data on the Web. We also study some computability issues regarding LDQL. We first prove that when considering the Web of Linked Data as a fully accessible graph, the evaluation problem for LDQL can be solved in polynomial time. Nevertheless, when the limited data access capabilities of Web clients are considered, the scenario changes drastically; there are LDQL queries for which a complete execution is not possible in practice. We formally study this issue and provide a sufficient syntactic condition to avoid this problem; queries satisfying this condition are ensured to have a procedure to be effectively evaluated over the Web of Linked Data. (C) 2016 Elsevier B.V. All rights reserved.

Ort, förlag, år, upplaga, sidor
ELSEVIER SCIENCE BV , 2016. Vol. 41
Nyckelord [en]
Linked Data; Query language; Foundations; SPARQL; Queries
Nationell ämneskategori
Datavetenskap (datalogi)
Identifikatorer
URN: urn:nbn:se:liu:diva-133742DOI: 10.1016/j.websem.2016.10.001ISI: 000389584600002OAI: oai:DiVA.org:liu-133742DiVA, id: diva2:1063119
Anmärkning

Funding Agencies|Millennium Nucleus Center for Semantic Web Research [NC120004]; Fondecyt [1140790]

Tillgänglig från: 2017-01-09 Skapad: 2017-01-09 Senast uppdaterad: 2018-01-13

Open Access i DiVA

fulltext(470 kB)13 nedladdningar
Filinformation
Filnamn FULLTEXT01.pdfFilstorlek 470 kBChecksumma SHA-512
972f7d0af1503f4eefda59508a1811347a3b521a1152c32e24a54fbbc00705f945f0ecaa154560bc33b4d1ce91b991fbd7b27ae90b6a838ec770632c96b80488
Typ fulltextMimetyp application/pdf

Övriga länkar

Förlagets fulltext

Sök vidare i DiVA

Av författaren/redaktören
Hartig, Olaf
Av organisationen
Databas och informationsteknikTekniska fakulteten
I samma tidskrift
Journal of Web Semantics
Datavetenskap (datalogi)

Sök vidare utanför DiVA

GoogleGoogle Scholar
Totalt: 13 nedladdningar
Antalet nedladdningar är summan av nedladdningar för alla fulltexter. Det kan inkludera t.ex tidigare versioner som nu inte längre är tillgängliga.

doi
urn-nbn

Altmetricpoäng

doi
urn-nbn
Totalt: 90 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf