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 visibl...
| Κύριοι συγγραφείς: | , , , |
|---|---|
| Μορφή: | Conference item |
| Έκδοση: |
Association for Computing Machinery
2016
|