Querying Visible and Invisible Information

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 vi...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science s. 297 - 306
Hlavní autori: Benedikt, Michael, Bourhis, Pierre, ten Cate, Balder, Puppis, Gabriele
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: New York, NY, USA ACM 05.07.2016
Edícia:ACM Conferences
Predmet:
Information systems
Information systems > Data management systems
Information systems > Data management systems > Database design and models
Information systems > Data management systems > Database management system engines
Information systems > Data management systems > Database management system engines > Database query processing
Information systems > Data management systems > Query languages
Theory of computation
Theory of computation > Theory and algorithms for application domains
Theory of computation > Theory and algorithms for application domains > Database theory
Theory of computation > Theory and algorithms for application domains > Database theory > Database query processing and optimization (theory)
ISBN:9781450343916, 1450343910
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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 both positive and negative query information, that is, whether the query or its negation holds. We consider the instance-level version of the problem, where both the query and the visible instance are given, as well as the schema-level version, where we want to know whether truth or falsity of the query can be inferred in some instance of the schema.
ISBN:9781450343916
1450343910
DOI:10.1145/2933575.2935306