Optimizing the Chase: Scalable Data Integration under Constraints

Summary: Introduces the frugal chase, producing smaller universal solutions while retaining polynomial data complexity. A compact graph-based implementation scales LAV query rewriting under weakly acyclic constraints, accelerating dependency compilation by up to three orders of magnitude. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID: 11072
Venue: VLDB
Year: 2014
Pagerank: 5.5181056e-05
Overall Rank: 7,930 | 45.60%
DOI: 10.14778/2733085.2733093

Incoming Non-self Citations Over Time

Authors

1. George Konstantinidis (University of Southern California)
2. José Luis Ambite (University of Southern California)

BibTeX Citation

@article{konstantinidis_vldb14,
        title = {{Optimizing the Chase: Scalable Data Integration under Constraints}},
        author = {Konstantinidis, George and Ambite, José Luis},
        journal = {PVLDB},
        series = {{VLDB} '14},
        volume = {7},
        number = {14},
        doi = {10.14778/2733085.2733093},
        url = {https://doi.org/10.14778/2733085.2733093},
        year = {2014}
}

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
2,634	Benchmarking the Chase	2017	PODS	8.3210907e-05
7,867	ForBackBench: A Benchmark for Chasing vs. Query-Rewriting	2022	VLDB	5.5277527e-05
9,228	Enabling Personal Consent in Databases	2022	VLDB	5.3018457e-05
11,366	Bounded Treewidth and the Infinite Core Chase: Complications and Workarounds toward Decidable Querying	2023	PODS	5.093636e-05

Outgoing Citations (Sorted by Pagerank)

Showing 12 of 12 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
22	Data Integration: A Theoretical Perspective	2002	PODS	0.00056204792
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
377	Data Exchange: Getting to the Core	2003	PODS	0.00019643793
525	The Chase Revisited	2008	PODS	0.00017118255
913	A Scalable Algorithm for Answering Queries Using Views	2000	VLDB	0.00013253821
1,541	Generalized Schema-Mappings: From Termination To Tractability	2009	PODS	0.00010427058
2,256	STBenchmark: Towards a Benchmark for Mapping Systems	2008	VLDB	8.8578542e-05
2,550	Computing Cores for Data Exchange: New Algorithms and Practical Solutions	2005	PODS	8.4290753e-05
4,193	Core Schema Mappings	2009	SIGMOD	6.842657e-05
6,090	Scalable Query Rewriting: A Graph-Based Approach	2011	SIGMOD	5.9796288e-05
6,933	Laconic Schema Mappings: Computing the Core with SQL Queries	2009	VLDB	5.7357191e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	7,045	Exploiting Equality Generating Dependencies in Checking Chase Termination	2016	VLDB
2	6,740	Stratification Criteria and Rewriting Techniques for Checking Chase Termination	2011	VLDB
3	2,189	Physical Data Independence, Constraints, and Optimization with Universal Plans	1999	VLDB
4	525	The Chase Revisited	2008	PODS
5	11,129	Chase Termination Beyond Polynomial Time	2024	PODS
6	3,247	On Chase Termination Beyond Stratification	2009	VLDB
7	9,196	Non-Uniformly Terminating Chase: Size and Complexity	2022	PODS
8	4,369	Semantic Query Optimization in the Presence of Types	2010	PODS
9	4,426	A Chase Too Far?	2000	SIGMOD
10	2,634	Benchmarking the Chase	2017	PODS