A message passing framework for logical query evaluation

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A message passing framework for logical query evaluation

Full text

Pdf (1.13 MB)

Source

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

Washington, D.C., United States

Pages: 155 - 165

Year of Publication: 1986

ISBN:0-89791-191-1

Also published in ...

Author

Allen Van Gelder

Stanford University

Sponsor

SIGMOD: ACM Special Interest Group on Management of Data

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 16, Citation Count: 17

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/16894.16870 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.

	AU79	Alfred V. Aho , Jeffrey D. Ullman, Universality of data retrieval languages, Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.110-119, January 29-31, 1979, San Antonio, Texas [doi>10.1145/567752.567763]
	BFM*81	Catriel Beeri , Ronald Fagin , David Maier , Alberto Mendelzon , Jeffrey Ullman , Mihalis Yannakakis, Properties of acyclic database schemes, Proceedings of the thirteenth annual ACM symposium on Theory of computing, p.355-362, May 11-13, 1981, Milwaukee, Wisconsin, United States [doi>10.1145/800076.802489]
	HN84	Lawrence J. Henschen , Shamim A. Naqvi, On compiling queries in recursive first-order databases, Journal of the ACM (JACM), v.31 n.1, p.47-85, Jan. 1984 [doi>10.1145/2422.2423]
	Loz85	E L Lozmsku Evaluating queries m deductive databases by generating In Proc 9th int loznt Con/ on A rtzficsal lntelhgence, pages 173-177, 1985
	MS81	D MeKay and S Shapiro Using active connection graphs for reasoning with recursive rules In Proc 7th lnt Josnt Conf on Artzficsal Intelhgence, pages 368-374, 1981
	Por85	H H Porter, III Earley Deduction Techmeal Report , Oregon Graduate Center, Beaverton, OR, 1985
	Rei78	tt Relter On closed world databases In Gallalre and Mmker, editors, I, ogsc and Databases, pages 55-76, Plenum Press, New York, 1978
	Sag83	Yehoshua Sagiv, A characterization of globally consistent databases and their correct access paths, ACM Transactions on Database Systems (TODS), v.8 n.2, p.266-286, June 1983 [doi>10.1145/319983.319988]
	Ull82	J D Ullman Prmcsples o/Database Systems Computer Science press, Roekvdle, Md, 1982
	Ull84	J D Ullman lmplementatzon o/logical query languages /or databases Techmeal Report STAN-CS-84-1000, Dept of Computer Science, Stanford Umverslty, Stanford, CA, May 1984
	Var82	Moshe Y. Vardi, The complexity of relational query languages (Extended Abstract), Proceedings of the fourteenth annual ACM symposium on Theory of computing, p.137-146, May 05-07, 1982, San Francisco, California, United States [doi>10.1145/800070.802186]
	VEK76	M. H. Van Emden , R. A. Kowalski, The Semantics of Predicate Logic as a Programming Language, Journal of the ACM (JACM), v.23 n.4, p.733-742, Oct. 1976 [doi>10.1145/321978.321991]
	Vie85	L Vledle Recurssre azsoms :n deducfzre databases various solul,ons Techmeal Report KB-6, European Computer- Industry Research Center, Mumch, Germany, 1985
	Wal81	A Walker Syllog A Knowledge Based Data Management System Techmca} Report 034, Dept of Computer Science, New York Umverstty, 1981
	Yan81	M Yannakakls Algorithms for acychc database schemes In Proc 7th Int Conf on Very Large Databases, pages 82-94, Cannes, France, Sep 1981

CITED BY 17

	J. D. Ullman, Bottom-up beats top-down for datalog, Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.140-149, March 1989, Philadelphia, Pennsylvania, United States
	Allen van Gelder, Deriving constraints among argument sizes in logic programs (extended abstract), Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.47-60, April 02-04, 1990, Nashville, Tennessee, United States
	Raghu Ramakrishnan, Parallelism in logic programs, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.246-260, December 1989, San Francisco, California, United States
	Seppo Sippu , Eljas Soisalon-Soininen, An analysis of magic sets and related optimization strategies for logic queries, Journal of the ACM (JACM), v.43 n.6, p.1046-1088, Nov. 1996
	Jeffrey F. Naughton, Minimizing function-free recursive inference rules, Journal of the ACM (JACM), v.36 n.1, p.69-91, Jan. 1989
	Y. Sagiv, Optimizing datalog programs, Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.349-362, March 23-25, 1987, San Diego, California, United States
	J. Shao , D. A. Bell , M. E. C. Hull, An experimental performance study of a pipelined recursive query processing strategy, Proceedings of the second international symposium on Databases in parallel and distributed systems, p.30-43, July 02-04, 1990, Dublin, Ireland
	K. -C. Guh , C. Yu, Efficient Management of Materialized Generalized Transitive Closure in Centralized and Parallel Environments, IEEE Transactions on Knowledge and Data Engineering, v.4 n.4, p.371-381, August 1992
	K. -C. Guh , C. Yu, Efficient Query Processing for a Subset of Linear Recursive Binary Rules, IEEE Transactions on Knowledge and Data Engineering, v.6 n.5, p.842-849, October 1994
	W. Nejdl , S. Ceri , G. Wiederhold, Evaluating Recursive Queries in Distributed Databases, IEEE Transactions on Knowledge and Data Engineering, v.5 n.1, p.104-121, February 1993
	Werner Kießling , Helmut Schmidt , Werner Strauß , Gerhard Dünzinger, DECLARE and SDS: early efforts to commercialize deductive database technology, The VLDB Journal — The International Journal on Very Large Data Bases, v.3 n.2, April 1994
	Serge Abiteboul , Zoë Abrams , Stefan Haar , Tova Milo, Diagnosis of asynchronous discrete event systems: datalog to the rescue!, Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, June 13-15, 2005, Baltimore, Maryland
	Trevor Jim , Dan Suciu, Dynamically distributed query evaluation, Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, p.28-39, May 2001, Santa Barbara, California, United States
	G. Hulin, Parallel processing of recursive queries in distributed architectures, Proceedings of the 15th international conference on Very large data bases, p.87-96, July 1989, Amsterdam, The Netherlands
	Christophe de Maindreville , Eric Simon, Modelling Non Deterministic Queries and Updates in Deductive Databases, Proceedings of the 14th International Conference on Very Large Data Bases, p.395-406, August 29-September 01, 1988
	Eliezer L. Lozinskii, Computing Facts in Non-Horn Deductive Systems, Proceedings of the 14th International Conference on Very Large Data Bases, p.273-279, August 29-September 01, 1988
	Kyu-Young Whang , Shamkant B. Navathe, An Extended Disjunctive Normal Form Approach for Optimizing Recursive Logic Queries in Loosely Coupled Environments, Proceedings of the 13th International Conference on Very Large Data Bases, p.275-287, September 01-04, 1987