Database Paper Browser

Back to papers

A Time Bound on the Materialization of Some Recursively Defined Views

Summary: Defines a restricted class of recursive view definitions that admit a data-independent bound on the number of iterations to materialize the view. Provides necessary and sufficient conditions for a statement in this class to have the bound, enabling guaranteed worst-case materialization cost. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
7703
Venue
VLDB
Year
1985
Pagerank
0.0001915957
Overall Rank
612 | 95.75%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 15 of 15 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

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

Rank Cited Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Semantically Similar Papers

Overall Rank Paper Year Venue Pagerank
97 Maintaining Views Incrementally 1993 SIGMOD 0.00050863077
1,552 Evaluation Of Database Recursive Logic Programs As Recurrent Function Series 1986 SIGMOD 0.00011393892
82 Answering Queries Using Views (Extended Abstract) 1995 PODS 0.00054430106
4,552 View-Based Query Containment 2003 PODS 6.0856349e-05
297 Complexity of Answering Queries Using Materialized Views 1998 PODS 0.00028572729
2,539 Rewriting Queries Using Views in Description Logics 1997 PODS 8.5759464e-05
261 Maintenance Of Views 1984 SIGMOD 0.00029976111
533 Answering Recursive Queries Using Views 1997 PODS 0.00020767726
11,834 Bounded Query Rewriting Using Views 2016 PODS 4.1905499e-05
7,272 The Impact of Virtual Views on Containment 2010 VLDB 4.7760673e-05