How to Forget the Past Without Repeating It
Summary: Introduces a bottom-up deductive-database evaluation scheme that discards intermediate facts during execution while guaranteeing no recomputation. Under broad conditions, compile-time garbage collection retains only a small live subset, substantially reducing space. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Jeffrey F. Naughton (University of Wisconsin)
- 2. Raghu Ramakrishnan (University of Wisconsin)
BibTeX Citation
@article{naughton_vldb90,
title = {{How to Forget the Past Without Repeating It}},
author = {Naughton, Jeffrey F. and Ramakrishnan, Raghu},
journal = {PVLDB},
series = {{VLDB} '90},
pages = {278},
year = {1990}
}
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,679 | Space Optimization in the Bottom-Up Evaluation of Logic Programs | 1991 | SIGMOD | 5.5684407e-05 |
| 13,100 | Detecting Redundant Tuples During Query Evaluation | 1991 | PODS | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 16 | MAGIC SETS AND OTHER STRANGE WAYS TO IMPLEMENT LOGIC PROGRAMS (Extended Abstract) | 1986 | PODS | 0.00060089598 |
| 344 | On the Power of Magic | 1987 | PODS | 0.00020659405 |
| 6,307 | Optimizing Existential Datalog Queries | 1988 | PODS | 5.9196585e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 4,238 | Polynomial Time Query Processing in Temporal Deductive Databases | 1990 | PODS |
| 2 | 2,247 | A Framework for the Parallel Processing of Datalog Queries | 1990 | SIGMOD |
| 3 | 1,530 | Multiple Query Processing in Deductive Databases using Query Graphs | 1986 | VLDB |
| 4 | 1,538 | Bottom-Up Beats Top-Down For Datalog | 1989 | PODS |
| 5 | 6,008 | More Efficient Datalog Queries: Subsumptive Tabling Beats Magic Sets | 2011 | SIGMOD |
| 6 | 2,511 | Aggregation and Relevance in Deductive Databases | 1991 | VLDB |
| 7 | 13,099 | Structural Query Optimization — A Uniform Framework For Semantic Query Optimization In Deductive Databases | 1991 | PODS |
| 8 | 13,100 | Detecting Redundant Tuples During Query Evaluation | 1991 | PODS |
| 9 | 6,729 | Efficient Implementation of Loops in Bottom-Up Evaluation of Logic Queries | 1990 | VLDB |
| 10 | 7,679 | Space Optimization in the Bottom-Up Evaluation of Logic Programs | 1991 | SIGMOD |