DBScholar

Back to papers

Relational Query Synthesis ⋈ Decision Tree Learning

Summary: LIBRA synthesizes SPJ queries with categorical/numerical predicates by interleaving schema-guided relational search and decision-tree learning. It guarantees completeness, favors minimal queries, and outperforms Scythe/PATSQL on 1,475 multi-table instances. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
13663
Venue
VLDB
Year
2024
Pagerank
5.093636e-05
Overall Rank
11,245 | 22.85%
DOI
10.14778/3626292.3626306

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@article{naik_vldb24,
        title = {{Relational Query Synthesis ⋈ Decision Tree Learning}},
        author = {Naik, Aaditya and Thakkar, Aalok and Stein, Adam and Alur, Rajeev and Naik, Mayur},
        journal = {PVLDB},
        series = {{VLDB} '24},
        volume = {17},
        number = {2},
        pages = {250--263},
        doi = {10.14778/3626292.3626306},
        url = {https://doi.org/10.14778/3626292.3626306},
        year = {2024}
}

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 8 of 8 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