Linked Data Indexing Methods: A Survey

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F11%3A10099331" target="_blank" >RIV/00216208:11320/11:10099331 - isvavai.cz</a>

Result on the web

<a href="http://www.springerlink.com/content/e5km325672761442/" target="_blank" >http://www.springerlink.com/content/e5km325672761442/</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-642-25126-9_59" target="_blank" >10.1007/978-3-642-25126-9_59</a>

Result language

angličtina

Original language name

Linked Data Indexing Methods: A Survey

Original language description

Documents on the contemporary Web are based especially on HTML formats and, therefore, it is rather difficult to retrieve hidden structured information from them using automated agents. The concept of Linked Data based primarily on RDF data triples seemsto successfully solve this drawback. However, we cannot directly adopt the existing solutions from relational databases or XML technologies, because RDF triples are modelled as graph data and not relational or tree data. Despite the research effort in recent years, several questions in the area of Linked Data indexing and querying remain open, not only since the amount of Linked Data globally available significantly increases each year. This paper attempts to introduce advantages and disadvantages of the state-of-the-art solutions and discuss several issues related to our ongoing research effort - the proposal of an efficient querying framework over Linked Data.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

IN - Informatics

OECD FORD branch

—

Project

<a href="/en/project/GAP202%2F10%2F0573" target="_blank" >GAP202/10/0573: Handling XML Data in Heterogeneous and Dynamic Environments</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach

Publication year

2011

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Lecture Notes in Computer Science

ISSN

0302-9743

e-ISSN

—

Volume of the periodical

2011

Issue of the periodical within the volume

7046

Country of publishing house

DE - GERMANY

Number of pages

10

Pages from-to

474-483

UT code for WoS article

—

EID of the result in the Scopus database

—