Startsida
Hjälp
Sök i LIBRIS databas

     

 

Sökning: onr:m4bj7xxkkf83wt92 > Rewriting ontology-...

Rewriting ontology-mediated navigational queries into cypher [Elektronisk resurs]

Dragovic, Nikola (författare)
Okulmus, Cem (författare)
Ortiz, Magdalena (författare)
Umeå universitet Teknisk-naturvetenskapliga fakulteten (utgivare)
Publicerad: CEUR-WS, 2023
Engelska.
Serie: CEUR workshop proceedings.
Ingår i: Proceedings of the 36th international workshop on Description Logics (DL 2023).
Läs hela texten
Läs hela texten
Läs hela texten
  • E-bok
Sammanfattning Ämnesord
Stäng  
  • The ontology-based data access (OBDA) paradigm has successfully grown over the last decade as a powerful means to access data from possibly diverse and incomplete sources, using a domain ontology as a mediator. The ability to query generic graph-structured data is often highlighted as an advantage of OBDA, but in practice, existing solutions do not allow to access data in popular graph database management systems (DBMS) (e.g., Neo4j) that adopt the so-called 'property graph' data model and support dedicated query languages such as Cypher. Towards overcoming this major limitation, we propose a technique for ontology-mediated querying (OMQ) of property graphs. We tailor a suitable query language that supports path navigation in a form that can be naturally expressed in Cypher and other important graph query languages. It keeps the data complexity of query evaluation tractable even under trail semantics and is sufficient for our motivating use case in the autonomous driving domain. We address the semantic gap between the traditional path semantics adopted by most works on graph databases, and the trail semantics used in Cypher, and identify cases where both semantics coincide. To our knowledge, OMQs with trail semantics had not been addressed before. We develop a rewriting algorithm for queries mediated by DL-Lite ontologies that enables query answering using plain Cypher. The experimental evaluation of our proof-of-concept prototype on a sample set of use case queries reveals that the approach is promising, and can be a stepping stone to making OBDA applicable to data stored in graph DBMS. 

Ämnesord

Natural Sciences  (hsv)
Computer and Information Sciences  (hsv)
Computer Sciences  (hsv)
Naturvetenskap  (hsv)
Data- och informationsvetenskap  (hsv)
Datavetenskap (datalogi)  (hsv)
Engineering and Technology  (hsv)
Electrical Engineering, Electronic Engineering, Information Engineering  (hsv)
Computer Systems  (hsv)
Teknik och teknologier  (hsv)
Elektroteknik och elektronik  (hsv)
Datorsystem  (hsv)

Genre

government publication  (marcgt)

Indexterm och SAB-rubrik

Graph databases
Ontology-based data access
Property graphs
Query rewriting
Inställningar Hjälp

Uppgift om bibliotek saknas i LIBRIS

Kontakta ditt bibliotek, eller sök utanför LIBRIS. Se högermenyn.

Om LIBRIS
Sekretess
Hjälp
Fel i posten?
Kontakt
Teknik och format
Sök utifrån
Sökrutor
Plug-ins
Bookmarklet
Anpassa
Textstorlek
Kontrast
Vyer
LIBRIS söktjänster
SwePub
Uppsök

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

Copyright © LIBRIS - Nationella bibliotekssystem

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy