Conference item icon

Conference item

Querying visible and invisible information

Abstract:

We provide a wide-ranging study of the scenario where a subset of the relations in the schema are visible — that is, their complete contents are known — while the remaining relations are invisible. We also have integrity constraints (invariants given by logical sentences) which may relate the visible relations to the invisible ones. We want to determine which information about a query (a positive existential sentence) can be inferred from the visible instance and the constraints. We consider ...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed
Version:
Accepted Manuscript

Actions


Access Document


Files:
Publisher copy:
10.1145/2933575.2935306

Authors


More by this author
Department:
University College
Bourhis, P More by this author
ten Cate, B More by this author
Publisher:
Association for Computing Machinery Publisher's website
Pages:
297-306
Publication date:
2016-07-05
Acceptance date:
2016-04-01
DOI:
Pubs id:
pubs:713131
URN:
uri:95354eed-22b1-486f-b787-4f83a16d7aa8
UUID:
uuid:95354eed-22b1-486f-b787-4f83a16d7aa8
Local pid:
pubs:713131
ISBN:
978-1-4503-4391-6

Terms of use


Metrics



If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP