When Can We Answer Queries Using Result-Bounded Data Interfaces?

Summary: Studies query answerability over result-bounded access methods (e.g., paginated/rate-limited APIs). Reduces plan existence to constraint-aware query containment, derives schema-simplification principles, and establishes decidability/complexity results. (summarized by gpt-5.6-luna on Jul 26 2026)

Paper ID: 1744
Venue: PODS
Year: 2018
Pagerank: 5.5357919e-05
Overall Rank: 7,830 | 46.28%
DOI: 10.1145/3196959.3196965

Incoming Non-self Citations Over Time

Authors

1. Antoine Amarilli (Télécom Paris; Université Paris-Saclay)
2. Michael Benedikt (University of Oxford)

BibTeX Citation

@inproceedings{amarilli_pods18,
        address = {New York, NY, USA},
        series = {{PODS} '18},
        title = {{When Can We Answer Queries Using Result-Bounded Data Interfaces?}},
        url = {https://dl.acm.org/doi/10.1145/3196959.3196965},
        doi = {10.1145/3196959.3196965},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Amarilli, Antoine and Benedikt, Michael},
        year = {2018}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
9,196	Non-Uniformly Terminating Chase: Size and Complexity	2022	PODS	5.3058708e-05

Outgoing Citations (Sorted by Pagerank)

Showing 7 of 7 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
69	Answering Queries Using Views (Extended Abstract)	1995	PODS	0.00038090878
134	Testing Containment of Conjunctive Queries Under Functional and Inclusion Dependencies (Extended Abstract)	1982	PODS	0.00030343737
874	On the Decidability and Complexity of Query Answering over Inconsistent and Incomplete Databases	2003	PODS	0.00013481551
2,947	Querying with Access Patterns and Integrity Constraints	2015	VLDB	7.9325276e-05
3,392	Complete Yet Practical Search for Minimal Query Reformulations Under Constraints	2014	SIGMOD	7.4515019e-05
3,712	Non-Deterministic Languages to Express Deterministic Transformations	1990	PODS	7.1777407e-05
8,236	PDQ: Proof-driven Query Answering over Web-based Data	2014	VLDB	5.460452e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	851	Query Optimization in the Presence of Limited Access Patterns	1999	SIGMOD
2	298	Answering Queries Using Templates With Binding Patterns (Extended Abstract)	1995	PODS
3	2,947	Querying with Access Patterns and Integrity Constraints	2015	VLDB
4	12,029	Bounded Query Rewriting Using Views	2016	PODS
5	4,495	Queries with Incomplete Answers over Semistructured Data	1999	PODS
6	1,630	On the Decidability of Query Containment under Constraints	1998	PODS
7	874	On the Decidability and Complexity of Query Answering over Inconsistent and Incomplete Databases	2003	PODS
8	6,841	Querying Big Data by Accessing Small Data	2015	PODS
9	12,364	Determining Relevance of Accesses at Runtime	2011	PODS
10	4,393	Bounded Conjunctive Queries	2014	VLDB