DBScholar

Back to papers

Rule Ordering in Bottom-Up Fixpoint Evaluation of Logic Programs

Summary: Introduces GSN/OSN/PSN algorithms for ordered bottom-up fixpoint evaluation that retain semi-naive nonredundancy; OSN/PSN support stratified negation without overhead. Proves cycle-preserving fair orderings minimize rule applications, yielding fewer joins experimentally. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
8148
Venue
VLDB
Year
1990
Pagerank
5.5684407e-05
Overall Rank
7,680 | 47.31%
DOI
-

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{ramakrishnan_vldb90,
        title = {{Rule Ordering in Bottom-Up Fixpoint Evaluation of Logic Programs}},
        author = {Ramakrishnan, Raghu and Srivastava, Divesh and Sudarshan, S.},
        journal = {PVLDB},
        series = {{VLDB} '90},
        pages = {359},
        year = {1990}
}

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank Citing Paper Year Venue Pagerank
4,520 Context-Sensitive Program Analysis as Database Queries 2005 PODS 6.6472658e-05
4,975 Implementation of the CORAL Deductive Database System 1993 SIGMOD 6.41738e-05
7,679 Space Optimization in the Bottom-Up Evaluation of Logic Programs 1991 SIGMOD 5.5684407e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 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