This Article 
 Bibliographic References 
 Add to: 
Efficient Query Processing for a Subset of Linear Recursive Binary Rules
October 1994 (vol. 6 no. 5)
pp. 842-849

We study the complexity of processing a class of rules called simple binary rule sets. The data referenced by the rules are stored in secondary memory. A necessary and sufficient condition that a simple binary rule set can be processed in a single pass of a file containing the base relations is given. Because not all simple binary rule sets can be processed in a single pass, a necessary and sufficient condition that a simple binary rule set can be processed by a constant number of passes is also given.

[1] A. Aho and J. Ullman, "Universality of data retrieval languages," inProc. 6th ACM Symp: Principles of Programming Languages, San Antonio, TX, Jan. 1979.
[2] R. Agrawalet al., "Efficient management of transitive relationships in large data and knowledge bases," in [42], pp. 253-262, 1989.
[3] R. Agrawal, "Alpha: An Extension of Relational Algebra to Express a Class of Recursive Queries,"Proc. Third Int'l Conf. Data Eng., CS Press, Los Alamitos, Calif., Order No. FN762, 1987, pp. 580-590.
[4] 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.
[5] 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.
[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. Chang, "On evaluation of queries containing derived relations in a relational data," in H. Gallaire, J. Minker, and J. M. Nicolas, Eds.,Advances in Data Base Theory, vol. 1, New York: Plenum, 1981.
[8] N. Deo,Graph Theory with Application to Engineering and Computer Science. Englewood Cliffs, NJ: Prentice-Hall, 1974.
[9] H. Gallaire, J. Minker, and J. Nicolas, "Logic and databases: A deductive approach,"ACM Comput. Surveys, vol. 16, pp. 153-185,1984.
[10] A. Ghafoor and P. B. Berra, "An efficient communication structure for distributed commit protocols,"IEEE J. Selected Areas Commun., vol. 7, pp. 375-389, Apr. 1989.
[11] G. Grahne, S. Sippu, and E. Soisalon-Soininen, "Efficient evaluation for a subset of recursive queries,"6th ACM Symp. Principles of Database Syst., 1987, pp. 284-293.
[12] K. C. Guh, "Efficient processing of transitive closure for cyclic data," Tech. Rep., Univ. of Wisconsin--Milwaukee, USA, 1992.
[13] G. Gardarin and C. De Maindreville, "Evaluation of database recursive logic programs as recurrent function series," inProc. ACM-SIGMOD Conf., Washington, DC, May 1986.
[14] K. C. Guh and C. T. Yu, "Efficient query processing for a subset of linear recursive binary rules," Tech. Rep., Univ. of Wisconsin--Milwaukee, USA, 1990.
[15] J. Han and W. Lu, "Asynchronous chain recursions,"IEEE Trans. Knowl. Data Eng., vol. 1, pp. 185-195, June 1989.
[16] L. J. Henschen and S. Naqvi, "On compiling queries in recursive first-order databases,"J. ACM, vol. 1, no. 1, pp. 47-85, 1984.
[17] K. A. Hua and S. S. Hannenhalli, "Parallel transitive closure computations using topological sort,"1st Int. Conf. Parallel Distrib. Inform. Syst., 1991, pp. 122-129.
[18] Y. E. Ioannidis and R. Ramakrishnan, "Efficient transitive closure algorithms," inProc. 14th Int. Conf. on Very Large Data Bases, Los Angeles, Aug. 1988, pp. 382-394.
[19] Y. E. Ioannidis and E. Wong, "Transforming nonlinear recursion to linear recursion,"2nd Int. Conf. Expert Database Syst., 1988, pp. 187-207.
[20] 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.
[21] H. V. Jagadish, "A compressed transitive closure technique for efficient fixed-point query processing,"Proc. 2nd Int. Conf. Expert Database Syst., 1988, pp. 209-223.
[22] M. Kifer and E. L. Lozinskii, "A frame work for an efficient implementation of deductive database," inProc. Advanced Database Symp., Tokyo, Japan, 1986.
[23] P. A. Larson and V. Deshpande, "A file structure supporting traversal recursion,"ACM SIGMOD 1989, pp. 243-252.
[24] H. Lu, K. Mikkilineni, and J. P. Richardson, "Design and evaluation of algorithms to compute the transitive closure of a database relation," inProc. Third Int. Conf. on Data Engineering, Los Angeles, Feb. 3-5, 1987, pp. 112-119.
[25] A. O. Mendelzon and P. T. Wood, "Finding regular simple paths in graph databases," inProc. Int. Conf. Very Large Databases, Amsterdam, The Netherlands, 1989.
[26] J. F. Naughton, R. Ramakrishnan, Y. Sagiv, and J. D. Ullman, "Efficient evaluation of right-, left-, and multi-linear rules," inProc. 1989 ACM-SIGMOD Conf. Management of Data(Portland, OR), June 1989, pp. 235-242.
[27] L. Raschid and S. Y. W. Su, "A parallel processing strategy for evaluating recursive queries," inProc. 12th Int. Conf. on Very Large Data Bases, Kyoto, Japan, Aug. 25-28, 1986, pp. 412-419.
[28] A. Rosenthal, S. Heiler, U. Dayal, and F. Manola, "Traversal recursion: a practical approach to supporting recursive applications," inProc. 1986 ACM SIGMOD Conf.(Washington, DC), 1986, pp. 166-176.
[29] Y. Sagiv, "Optimizing Datalog programs," inProc. ACM 1987 SIGMOD-SIGACT Symp. Principles Database Syst., San Diego, CA, Mar. 1987.
[30] D. Troy, C. T. Yu, and W. Zhang, "Linearization of nonlinear recursive rules,"IEEE Trans. Software Eng., vol. 15, pp. 1109-1119, Sept. 1989.
[31] J. D. Ullman, "Implementation of logical query languages for databases,"ACM TODS, vol. 10, no. 3, pp. 289-321, 1985.
[32] J. D. Ullman,Principles of Databases Systems. Rockville, MD: Computer Science Press, 1982.
[33] W. Zhang, C. T. Yu, and D. Troy, "A necessary and sufficient condition for a doubly recursive rule to be equivalent to a linear recursive rule,"ACM Trans. Database Syst., vol. 15, no. 3, pp. 459-482, Sept. 1990.

Index Terms:
query processing; computational complexity; expert systems; query processing; linear recursive binary rules; complexity; binary rule sets; secondary memory; necessary and sufficient condition
K.-C. Guh, C. Yu, "Efficient Query Processing for a Subset of Linear Recursive Binary Rules," IEEE Transactions on Knowledge and Data Engineering, vol. 6, no. 5, pp. 842-849, Oct. 1994, doi:10.1109/69.317712
Usage of this product signifies your acceptance of the Terms of Use.