Ontology-Mediated Query Answering for Key-Value Stores
release_4dxsf4knbbgfvbr75kl35bnnwq
by
Meghyn Bienvenu, Pierre Bourhis, Marie-Laure Mugnier, Sophie Tison, Federico Ulliana
2017 p844-851
Abstract
We propose a novel rule-based ontology language for JSON records and investigate its computational properties. After providing a natural translation into first-order logic, we identify relationships to existing ontology languages, which yield decidability of query answering but only rough complexity bounds. By establishing an interesting and non-trivial connection to word rewriting, we are able to pinpoint the exact combined complexity of query answering in our framework and obtain tractability results for data complexity. The upper bounds are proven using a query reformulation technique, which can be implemented on top of key-value stores, thereby exploiting their querying facilities.
In application/xml+jats
format
Archived Files and Locations
application/pdf 649.7 kB
file_yd27xjlxd5cb3k4s7usa2tq5ga
|
hal-lirmm.ccsd.cnrs.fr (repository) web.archive.org (webarchive) |
application/pdf 187.4 kB
file_xppl7al275bvvjxtctyb5zt6ga
|
web.archive.org (webarchive) www.ijcai.org (web) |
paper-conference
Stage
published
Year 2017
access all versions, variants, and formats of this works (eg, pre-prints)
Crossref Metadata (via API)
Worldcat
wikidata.org
CORE.ac.uk
Semantic Scholar
Google Scholar