Efficient bottom-up computation of queries on stratified databases-Reference-Cited by-同舟云学术

Efficient bottom-up computation of queries on stratified databases

Published:1991-10 Issue:3-4 Volume:11 Page:295-344
ISSN:0743-1066
Container-title:The Journal of Logic Programming
language:en
Short-container-title:The Journal of Logic Programming

Author:

Balbin I.,Port G.S.,Ramamohanarao K.,Meenakshi K.

Publisher

Elsevier BV

Subject

Logic

Reference49 articles.

1. Towards a Theory of Declarative Knowledge;Apt,1988

2. Efficient Bottom-Up Computation on Recursively Defined Deductive Databases;Balbin,1989

3. A Query Independent Method for Magic Set Computation on Stratified Databases;Balbin;Proceedings of the 1988 International Conference on Fifth Generation Computer Systems,1988

4. Magic Set Computation for Stratified Databases;Balbin,1987

5. A Differential Approach to Query Optimization in Recursive Deductive Databases;Balbin,1986

Cited by 36 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Optimizing Recursive Queries with Progam Synthesis;Proceedings of the 2022 International Conference on Management of Data;2022-06-10

2. 60 Years of Databases (part two);PROBLEMS IN PROGRAMMING;2021-12

3. Metamorphic testing of Datalog engines;Proceedings of the 29th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering;2021-08-18

4. Generating Random Logic Programs Using Constraint Programming;Lecture Notes in Computer Science;2020

5. Extended Magic for Negation: Efficient Demand-Driven Evaluation of Stratified Datalog with Precise Complexity Guarantees;Electronic Proceedings in Theoretical Computer Science;2019-09-19