This Article 
 Bibliographic References 
 Add to: 
Moving Selections into Linear Least Fixpoint Queries
December 1989 (vol. 1 no. 4)
pp. 424-432

Efficient least-fixpoint query evaluation is crucial to using logic as the query language for relational databases. The authors present a selection transposition algorithm that allows selections that are conjunctions of the predicates of the form column theta value to be evaluated ahead of the least-fixpoint operator while processing linear recursive queries. It is also shown that the algorithm transposes the strongest possible selection.

[1] R. Agrawal, "Alpha: An expression of relational algebra to express a class of recursive queries," inProc. IEEE 3rd Int. Conf. Data Eng., Los Angeles, CA, Feb. 1987, pp. 580-590; also inIEEE Trans. Software Eng., vol. 14, pp. 879-885, July 1988.
[2] R. Agrawal and P. Devanbu, "Moving selections into linear logic programs,"AT&T Bell Labs., Tech. Memo., 1988.
[3] A. Aho and J. Ullman, "Universality of data retrieval languages," inProc. 6th ACM Symp: Principles of Programming Languages, San Antonio, TX, Jan. 1979.
[4] F. Bancilhon, "Naive evaluation of recursively defined relations," MCC, Austin, TX, Tech. Rep. DB-004-85, 1985.
[5] F. Bancilhon and R. Ramakrishnan, "An amateur's introduction to recursive query processing strategies," inProc. 1986 ACM-SIGMOD Conf. Management of Data(Washington, DC), May 1986, pp. 16-52.
[6] F. Bancilhon, D. Maier, Y. Sagiv, and J. D. Ullman, "Magic sets and other strange ways to implement logic programs," inProc. 5th ACM Symp. Principles of Database Syst.(Cambridge, MA), Mar. 1986, pp. 1-15.
[7] C. Beeri and R. Ramakrishnan, "On the power of magic," inProc. 6th ACM Symp. Principles of Database Syst.(San Diego, CA), Mar. 1987, pp. 269-283.
[8] C. Beeri, P. Kanellakis, F. Bancilhon, and R. Ramakrishnan, "Bounds on the propagation of selection into logic programs," inProc. 6th ACM Symp. Principles of Database Syst., San Diego, CA, Mar. 1987, pp. 214-226.
[9] M. L. Brodie, Ed.,Proc. Islamorada Workshop Large Scale Knowledge Base and Reasoning Systems, Islamorada, FL, Feb. 1985.
[10] A. K. Chandra and D. Harel, "Horn clauses and the fixpoint query hierarchy," inProc. 1st Symp. Principles of Database Syst., 1982, pp. 158-163.
[11] W. F. Clocksin and C. S. Mellish,Programming in Prolog. New York: Springer-Verlag, 1984.
[12] E. F. Codd, "Relational completeness of data sublanguages," inDatabase Systems, R. Rustin, Ed. Englewood Cliffs, NJ: Prentice-Hall, 1972, pp. 65-98.
[13] P. Devanbu, M. Freeland, and S. Naqvi, "A procedural approach to search control in Prolog," inProc. 7th European Conf. Artificial Intell., Brighton, England, 1986.
[14] H. Gallaire and C. Lasserre, "Metalevel control for logic programs," inLogic Programming, K. Clark and S. Tarnlund, Eds. New York: Academic, 1982.
[15] H. Gallaire, J. Minker, and J. Nicolas, "Logic and databases: A deductive approach,"ACM Comput. Surveys, vol. 16, pp. 153-185,1984.
[16] Y. E. Ioannidis, "A time bound on the materialization of some recursively defined views," inProc. 11th Int. Conf. Very Large Databases, Stockholm, Sweden, Aug. 1985, pp. 219-226.
[17] Y. E. Ioannidis and E. Wong, "An algebraic approach to recursive inference," inProc. 1st Int. Conf. Expert Database Syst., Charleston, SC, Apr. 1986, pp. 209-224.
[18] H. V. Jagadish and R. Agrawal, "A study of transitive closure as a recursion mechanism," inProc. 1987 ACM SIGMOD Conf. (San Francisco, CA), 1987, pp. 331-334.
[19] L. Kerschberg, Ed.,Proc. 1st Int. Workshop Expert Database Syst., Kiawah Island, SC, Oct. 1984.
[20] L. Kerschberg,Proc. 1st Int. Conf. Expert Database Syst., Charleston, SC, Apr. 1986.
[21] M. Kifer and E. L. Lozinskii, "A framework for an efficient implementation of deductive database systems," inProc. 6th Advanced Database Symp., Tokyo, Japan, Aug. 1986.
[22] M. Kifer and E. L. Lozinskii, "Filtering data flow in deductive databases"Int. Conf. Data-base Theory, Rome, Italy, Sept. 1986.
[23] M. Kifer and E. L. Lozinskii, "On compile-time query optimization in deductive databases by means of static filtering," unpublished manuscript, 1988.
[24] S. Kunifuji and H. Yokota, "Prolog and relational databases for fifth-generation computer systems," inProc. Workshop Logical Bases Database, Toulouse, Dec. 1982.
[25] D. Maier,The Theory of Relational Databases. New York: Computer Science Press, 1983.
[26] J. Naughton, "Data independent recursion in deductive databases," inProc. 5th Symp. Principles Database Syst., Cambridge, MA, Mar. 1986, pp. 267-279.
[27] E. Neuhold and M. Stonebraker, "Future directions in DBMS research," Int. Comput. Sci. Inst., Berkeley, CA, Tech. Rep. 88-001, May 1988.
[28] L. M. Pereira and M. Bruynooghe, "Logic control in logic," inImplementation of Prolog, J. A. Campbell, Ed. New York: Wiley, 1984.
[29] Sacca' and C. Zaniolo, "Magic counting methods," inProc. ACM-SIGMOD Conf., San Francisco, CA, May 1987.
[30] J. Ullman, "Implementation of logical query languages for data bases," inProc. 1985 ACM-SIGMOD Int. Conf. Management Data, Austin, TX, May 1985.
[31] J. D. Ullman,Principles of Databases Systems. Rockville, MD: Computer Science Press, 1982.

Index Terms:
moving selections; linear least fixpoint queries; query language; relational databases; selection transposition algorithm; predicates; least-fixpoint operator; linear recursive queries; information retrieval; query languages; relational databases
R. Agrawal, P. Devanbu, "Moving Selections into Linear Least Fixpoint Queries," IEEE Transactions on Knowledge and Data Engineering, vol. 1, no. 4, pp. 424-432, Dec. 1989, doi:10.1109/69.43418
Usage of this product signifies your acceptance of the Terms of Use.