Abstract
In this paper, we study a new evaluation technique for incrementally maintaining derived facts whenever updates occur on base facts. Our method is based upon the semi-naive evaluation so it is easy to implement; it is set-oriented, multiple updates may be dealt with in a single manipulation; and insertion and deletion are treated uniformly.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
F. BRY: ‘Query Evaluation in Recursive Databases: Bottom-up and Top-Down Reconciled', Data and Knowledge Engineering, 5, 1990, 289–312.
F. BANCILHON, D. MAIER, Y. SAGIV, J.D. ULLMAN: ‘Magic Sets and Other Strange Way to Implement Logic Programs', In Proceedings ACM PODS, 1986.
F. BANCILHON, R. RAMAKRISHNAN: ‘An Amateur's Introduction To Recursive Query Processing Strategies', In Proceedings ACM SIGMOD 1986 International Conference on Management of Data, Washington, USA, May 1986.
J.-P. CHEINEY, Y.-N. HUANG: 'set-orinted Propagation of Updates into Transitively Closed Relations', In Proceedings 2nd Int'l Conf. on DOOD, Munich, Germany, Dec. 1991.
J.-P. CHEINEY, Y.-N. HUANG: ‘Efficient Maintenance of Explicit Transitive Closures with Set-oriented Update Propagation and Parallel Processing', to appear in Data and Knowledge Engineering.
J.W. FLOYD: ‘Foundations of Logic Programming', Spring-Verlag Germany, 1987.
A. GUPTA, I.S. MUMICK, V.S. SUBRAHMANIAN: ‘Maintaining Views Incrementally', In Proceedings ACM SIGMOD 1993 International Conference on Management of Data, Washington, DC, USA, May 1993.
J. HAN, L. LIU: ‘Efficient Evaluation of Multiple Linear Recursions', In T.K.D.E, Vol. 17, No. 12, Dec. 1991.
Y.N. HUANG, J.P. CHEINEY: ‘Differential Maintenance of a Transitively Closed Relation', In Proceedings 5th International Symposium on Computer and Information Sciences, Nevsehir Cappadocia, Turkey, November 1990.
Y.N. HUANG, V. DAHL, J. HAN: ‘Fact Updates in Logic Databases', Technical report of Simon Fraser University, CSS/LCCR TR94-06, 1994.
J.D. ULLMAN: 'Principles of Database and Knowledge-Base Systems', Vol1 and Vol2, Computer Science Press, New York, USA, 1988.
L. VIEILLE: ‘Recursive Axioms in Deductive Databases: the Query sub-Query Approach', In Proceeding 1st Int'l Conf. on Expert Database Systems, Charleston, South Carolina, USA, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Huang, YN., Dahl, V., Han, J. (1994). Incremental processing of logic database relations. In: RaÅ›, Z.W., Zemankova, M. (eds) Methodologies for Intelligent Systems. ISMIS 1994. Lecture Notes in Computer Science, vol 869. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58495-1_56
Download citation
DOI: https://doi.org/10.1007/3-540-58495-1_56
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58495-7
Online ISBN: 978-3-540-49010-4
eBook Packages: Springer Book Archive