On Querying Incomplete Information in Databases under Bag Semantics
Authors: Marco Console, Paolo Guagliardo, Leonid Libkin
IJCAI 2017 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | We show that the behavior of positive queries is different under bag semantics: finding the minimum number of occurrences can still be done efficiently, but for maximum it becomes intractable. We use these results to investigate approximation schemes for computing certain answers to arbitrary first-order queries that have been proposed for set semantics. One of them cannot be adapted to bags, as it relies on the intractable maxima of occurrences, but another scheme only deals with minima, and we show how to adapt it to bag semantics without losing efficiency. |
| Researcher Affiliation | Academia | Marco Console , Paolo Guagliardo and Leonid Libkin University of Edinburgh |
| Pseudocode | No | The paper provides formal definitions and theoretical proofs, but it does not include any pseudocode or algorithm blocks. |
| Open Source Code | No | The paper does not mention releasing any source code for the described methodology. |
| Open Datasets | No | The paper is theoretical and does not involve training models on datasets. |
| Dataset Splits | No | The paper is theoretical and does not involve validation sets for empirical evaluation. |
| Hardware Specification | No | The paper is theoretical and does not describe any experimental setup or the hardware used. |
| Software Dependencies | No | The paper is theoretical and does not specify software dependencies with version numbers for experimental reproducibility. |
| Experiment Setup | No | The paper is theoretical and does not describe any experimental setup details such as hyperparameters or training configurations. |