On the data complexity of consistent query answering over graph databases (Q2361352)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6737606
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the data complexity of consistent query answering over graph databases |
scientific article; zbMATH DE number 6737606 |
Statements
On the data complexity of consistent query answering over graph databases (English)
0 references
30 June 2017
0 references
graph databases
0 references
regular path queries
0 references
consistent query answering
0 references
description logics
0 references
rewrite systems
0 references
0.9759159088134766
0 references
0.8235694766044617
0 references
0.8112555146217346
0 references
0.7846620082855225
0 references
0.7702247500419617
0 references
