arXiv (All)
open access
Few Rows Tell Them Apart: Equivalence of Queries Mixing Set and Bag Semantics
Bounded SQL equivalence checkers search for a counter-example database of bounded size, and a search that comes back empty proves nothing. We supply missing theory: computable bounds $B$ such that agreement on all databases with at most $B$ tuples per relation implies equivalence. We work in the com
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Incompleteness and Computability: An Open Introduction to Gödel's Theorems#721836
- BRIDGE LAWS IN HYPERTEXT: A LOGIC MODELING APPROACH#933469
- Quantitative relaxation of concurrent data structures#442695
- Additional properties of parity based bit-counting complexity classes and hierarchies#1155251
- Relational properties: Definition, reduction, and states of affairs#97701
Record · ID 996784
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive