Name
Abstract | ||
|---|---|---|
Ontology-Based Data Access has been studied so far for relational structures and deployed on top of relational databases. This paradigm enables a uniform access to heterogeneous data sources, also coping with incomplete information. Whether OBDA is suitable also for non-relational structures, like those shared by increasingly popular NOSQL languages, is still an open question. In this paper, we study the problem of answering ontology-mediated queries on top of key-value stores. We formalize the data model and core queries of these systems, and introduce a rule language to express lightweight ontologies on top of data. We study the decidability and data complexity of query answering in this setting. |
Year | Venue | DocType |
|---|---|---|
2016 | THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE | Conference |
Citations | PageRank | References |
5 | 0.54 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marie-laure Mugnier | 1 | 859 | 80.16 |
| Marie-Christine Rousset | 2 | 1258 | 159.51 |
| Federico Ulliana | 3 | 31 | 6.57 |