R.I.P.
👻
Ghosted
A Journey to the Frontiers of Query Rewritability
December 21, 2020 · Declared Dead · 🏛 ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Piotr Ostropolski-Nalewaja, Jerzy Marcinkowski, David Carral, Sebastian Rudolph
arXiv ID
2012.11269
Category
cs.DB: Databases
Citations
4
Venue
ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems
Last Checked
3 months ago
Abstract
This paper is about (first order) query rewritability in the context of theory-mediated query answering. The starting point of our journey is the FUS/FES conjecture, saying that if a theory is core-terminating (FES) and admits query rewriting (BDD, FUS) then it is uniformly bounded. We show that this conjecture is true for a wide class of "local" BDD theories. Then we ask how non-local can a BDD theory actually be and we discover phenomena which we think are quite counter-intuitive.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
📜 Similar Papers
In the same crypt — Databases
R.I.P.
👻
Ghosted
The Case for Learned Index Structures
R.I.P.
👻
Ghosted
Untangling Blockchain: A Data Processing View of Blockchain Systems
R.I.P.
👻
Ghosted
Converting Static Image Datasets to Spiking Neuromorphic Datasets Using Saccades
R.I.P.
👻
Ghosted
BLOCKBENCH: A Framework for Analyzing Private Blockchains
R.I.P.
👻
Ghosted
Data Synthesis based on Generative Adversarial Networks
Died the same way — 👻 Ghosted
R.I.P.
👻
Ghosted
Language Models are Few-Shot Learners
R.I.P.
👻
Ghosted
PyTorch: An Imperative Style, High-Performance Deep Learning Library
R.I.P.
👻
Ghosted
XGBoost: A Scalable Tree Boosting System
R.I.P.
👻
Ghosted