Journal article
Complexity of answering counting aggregate queries over DL - Lite
- Abstract:
-
The ontology based data access model assumes that users access data by means of an ontology, which is often described in terms of description logics. As a consequence, languages for managing ontologies now need algorithms not only to decide standard reasoning problems, but also to answer database-like queries. However, fundamental database aggregate queries, such as the ones using functions COUNT and COUNT DISTINCT, have received very little attention in this context, and even defining approp...
Expand abstract
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Author's original, pdf, 557.5KB)
-
- Publisher copy:
- 10.1016/j.websem.2015.05.003
Authors
Funding
+ Engineering and Physical Sciences Research Council
More from this funder
Grant:
EP/J017728/1
EP/G049165/1
Bibliographic Details
- Publisher:
- Elsevier Publisher's website
- Journal:
- Journal of Web Semantics Journal website
- Volume:
- 33
- Pages:
- 94-111
- Publication date:
- 2015-05-29
- DOI:
- EISSN:
-
1873-7749
- ISSN:
-
1570-8268
- Source identifiers:
-
550198
Item Description
- Keywords:
- Pubs id:
-
pubs:550198
- UUID:
-
uuid:1407507b-7a5d-46de-9237-f0b79cf11cf8
- Local pid:
- pubs:550198
- Deposit date:
- 2015-12-21
Terms of use
- Copyright holder:
- Elsevier
- Copyright date:
- 2015
- Notes:
- Copyright © 2015 Elsevier B.V. All rights reserved.
If you are the owner of this record, you can report an update to it here: Report update to this record