Space optimization in the bottom-up evaluation of logic programs

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Space optimization in the bottom-up evaluation of logic programs

Full text

Pdf (1.10 MB)

Source

International Conference on Management of Data archive
Proceedings of the 1991 ACM SIGMOD international conference on Management of data table of contents

Denver, Colorado, United States

Pages: 68 - 77

Year of Publication: 1991

ISBN:0-89791-425-2

Also published in ...

Authors

S. Sudarshan	Computer Sciences Department, University of Wisconsin-Madison, WI
Divesh Srivastava	Computer Sciences Department, University of Wisconsin-Madison, WI
Raghu Ramakrishnan	Computer Sciences Department, University of Wisconsin-Madison, WI
Jeffrey F. Naughton	Computer Sciences Department, University of Wisconsin-Madison, WI

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGMOD: ACM Special Interest Group on Management of Data

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 16, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/115790.115798 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	BR87	I. Balbin , K. Ramamohanarao, A generalization of the differential approach to recursive query evaluation, Journal of Logic Programming, v.4 n.3, p.259-262, Sept. 1987 [doi>10.1016/0743-1066(87)90004-5]
	Hir75	D. S. Hirschberg, A linear space algorithm for computing maximal common subsequences, Communications of the ACM, v.18 n.6, p.341-343, June 1975 [doi>10.1145/360825.360861]
	MR90	Michael J. Maher and Raghu Ramakrishnan. D~j~ vu in fixpoints of logic programs. In Proceedings of the Symposium on Logic Programming, Cleveland, Ohio, 1990.
	NR90	Jeffrey F. Naughton , Raghu Ramakrishnan, How to forget the past without repeating it, Proceedings of the sixteenth international conference on Very large databases, p.278-289, September 1990, Brisbane, Australia
	RSS90	Raghu Ramakrishnan , Divesh Srivastava, Rule ordering bottom-up fixpoint evaluation of logic programs, Proceedings of the sixteenth international conference on Very large databases, p.359-371, September 1990, Brisbane, Australia
	SSRN90	S. Sudarshan, Divesh Srivastava, Ra.ghu Ramakrishnan, and Jeff Naughton. Spa~e optimization in the bottom-up evaluation of logic programs. Technical Report Tech. Report (To appear), Univ. Wisconsin at Madison, Madison WI 53706, 1990.
	Ull89	Jeffrey D. Ullman, Principles of database and knowledge-base systems, Vol. I, Computer Science Press, Inc., New York, NY, 1988