DBScholar

Back to papers

Synthesizing Nested Relational Queries from Implicit Specifications

Summary: Effective Beth-style implicit→explicit conversion for nested relations: from a proof of implicit definability in the natural nested-logic, synthesize an explicit NRC query. Yields effective extraction of NRC rewritings of queries using NRC views from determinacy proofs. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1904
Venue
PODS
Year
2023
Pagerank
5.093636e-05
Overall Rank
11,362 | 22.05%
DOI
10.1145/3584372.3588653

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@inproceedings{benedikt_pods23,
        address = {New York, NY, USA},
        series = {{PODS} '23},
        title = {{Synthesizing Nested Relational Queries from Implicit Specifications}},
        url = {https://dl.acm.org/doi/10.1145/3584372.3588653},
        doi = {10.1145/3584372.3588653},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Benedikt, Michael and Pradic, Cécilia and Wernhard, Christoph},
        year = {2023}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers