Database Paper Browser

Back to papers

Rewriting Queries Using Views in Description Logics

Summary: For description-logic view definitions without existentials, a UCQ rewriting always exists and is answer-maximal. With existentials rewritings may be recursive; the paper gives an algorithm maximal on tree-shaped instances and shows maximal rewritings may not exist in general. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1107
Venue
PODS
Year
1997
Pagerank
8.5837937e-05
Overall Rank
2,536 | 82.36%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 9 of 9 citing papers.

Previous Page 1 / 1 Next

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.

Previous Page 1 / 1 Next

Semantically Similar Papers

Overall Rank Paper Year Venue Pagerank
584 Answering Queries with Aggregation Using Views 1996 VLDB 0.0001971526
297 Complexity of Answering Queries Using Materialized Views 1998 PODS 0.00028596715
5,471 Answering Queries Using Views with Arithmetic Comparisons 2002 PODS 5.4888202e-05
2,342 Rewriting of Regular Expressions and Regular Path Queries 1999 PODS 9.0015589e-05
5,144 Scalable Query Rewriting: A Graph-Based Approach 2011 SIGMOD 5.6651982e-05
82 Answering Queries Using Views (Extended Abstract) 1995 PODS 0.00054402763
6,567 Generating Efficient Plans for Queries Using Views 2001 SIGMOD 5.0069599e-05
532 Answering Recursive Queries Using Views 1997 PODS 0.00020778506
11,826 Bounded Query Rewriting Using Views 2016 PODS 4.1945683e-05
971 Rewriting Aggregate Queries Using Views 1999 PODS 0.00014925576