Answering Queries Using Views with Arithmetic Comparisons

Summary: Novel algorithm to compute maximally-contained rewritings (MCRs) for conjunctive queries with arithmetic comparisons (CQACs) over dense orders, handling left/right semi-interval-comparison predicates. Shows finite unions of CQACs can be insufficient, identifies cases where datalog suffices, and proves decidability of equivalent rewritings. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID: 1266
Venue: PODS
Year: 2002
Pagerank: 5.4741922e-05
Overall Rank: 5,496 | 61.81%
DOI: -

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
2,039	Views and Queries: Determinacy and Rewriting	2005	PODS	9.7059912e-05
3,514	Complete Yet Practical Search for Minimal Query Reformulations Under Constraints	2014	SIGMOD	7.0192177e-05
8,951	Queries with Arithmetic on Incomplete Databases	2020	PODS	4.420578e-05
11,711	Catching Numeric Inconsistencies in Graphs	2018	SIGMOD	4.1905499e-05

Outgoing Citations (Sorted by Pagerank)

Showing 15 of 15 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
82	Answering Queries Using Views (Extended Abstract)	1995	PODS	0.00054430106
127	Querying Heterogeneous Information Sources Using Source Descriptions	1996	VLDB	0.00044607231
152	Optimizing Queries across Diverse Data Sources	1997	VLDB	0.00040979242
297	Complexity of Answering Queries Using Materialized Views	1998	PODS	0.00028572729
396	An Adaptive Query Execution System for Data Integration*	1999	SIGMOD	0.00024439334
533	Answering Recursive Queries Using Views	1997	PODS	0.00020767726
541	Parallel Evaluation of Recursive Rule Queries	1986	PODS	0.00020586706
582	The Complexity of Querying Indefinite Data about Linearly Ordered Domains (Preliminary Version)	1992	PODS	0.00019753367
907	On the Equivalence of Recursive and Nonrecursive Datalog Programs	1992	PODS	0.00015417107
1,155	A Scalable Algorithm for Answering Queries Using Views	2000	VLDB	0.00013606507
1,360	Data Warehouse Configuration	1997	VLDB	0.0001239983
1,579	Constraint Checking with Partial Information	1994	PODS	0.00011273105
2,539	Rewriting Queries Using Views in Description Logics	1997	PODS	8.5759464e-05
4,055	On the Complexity of the Containment Problem for Conjunctive Queries with Built-in Predicates	1998	PODS	6.4906839e-05
4,132	Optimization of Run-time Management of Data Intensive Web Sites	1999	VLDB	6.4187496e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
533	Answering Recursive Queries Using Views	1997	PODS	0.00020767726
297	Complexity of Answering Queries Using Materialized Views	1998	PODS	0.00028572729
9,263	Materializing Views with Minimal Size To Answer Queries	2003	PODS	4.3648789e-05
4,552	View-Based Query Containment	2003	PODS	6.0856349e-05
6,884	Query Evaluation using Overlapping Views: Completeness and Efficiency	2006	SIGMOD	4.8917858e-05
976	Answering Queries Using Limited External Query Processors	1996	PODS	0.00014877501
82	Answering Queries Using Views (Extended Abstract)	1995	PODS	0.00054430106
2,539	Rewriting Queries Using Views in Description Logics	1997	PODS	8.5759464e-05
971	Rewriting Aggregate Queries Using Views	1999	PODS	0.00014915911
11,834	Bounded Query Rewriting Using Views	2016	PODS	4.1905499e-05