This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Alpha: An Extension of Relational Algebra to Express a Class of Recursive Queries
July 1988 (vol. 14 no. 7)
pp. 879-885

An extension of E.F. Codd's relational algebra (1970) with an alpha operator is presented that allows a large class of natural and useful recursive queries to be expressed, and yet has the property of being efficiently implementable. Formally, this class is a superset of linear recursive queries. Intuitively, this class comprises queries that examine transitive relationships between various instances of an entity. It is believed that this class covers many natural and interesting recursive queries. Examples of such queries include determining parts requirements for manufacturing a product, finding the critical path in a project management network, finding the shortest path between two cities, verifying connectivity between two points of a circuit, etc.

[1] R. Agrawal and H. V. Jagadish, "Direct algorithms for computing the transitive closure of database relations," inProc. 13th Int. Conf. Very Large Data Bases, Brighton, England, Sept. 1987, pp. 255-266.
[2] R. Agrawal and H. V. Jagadish, "An efficient method for encoding path information in the transitive closure of a database relation," Tech. Memo., AT&T Bell Lab., Murray Hill, NJ, Nov. 1987.
[3] R. Agrawal and H. V. Jagadish, "Efficient search in very large databases," inProc. 14th Int. Conf. Very Large Data Bases, Los Angeles, CA, Aug-Sept. 1988, to be published.
[4] R. Agrawal and P. Devanbu, "Moving selections into linear least fixpoint queries," inProc. IEEE 4th Int. Conf. Data Eng., Los Angeles, CA, Feb. 1988.
[5] A. Aho and J. Ullman, "Universality of data retrieval languages," inProc. 6th ACM Symp: Principles of Programming Languages, San Antonio, TX, Jan. 1979.
[6] F. Bancilhon, "Naive evaluation of recursively defined relations," Tech. Rep. DB-004-85, MCC, Austin, TX, 1985.
[7] 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.
[8] J. Bocca, "EDUCE--A marriage of convenience: Prolog and a relational DBMS," inProc. 1986 Symp. Logic Programming, Salt Lake City, UT, Sept. 1986, pp. 36-45.
[9] B. Carre,Graphs and Networks. Oxford: Clarendon, 1978.
[10] S. Ceri, G. Gottlob, and G. Wiederhold, "Interfacing relational databases, and prolog efficiency," inProc. 1st Int. Conf. Expert Database Sys., Charleston, SC, Apr. 1986, pp. 141-153.
[11] A. K. Chandra and D. Harel, "Horn clauses and the fixpoint query hierarchy," inProc. 1st Symp. Principles of Database Syst., 1982, pp. 158-163.
[12] E. Clemons, "Design of an external schema facility to define and process recursive structures,"ACM Trans. Database Syst., vol. 6, no. 2, pp. 295-311, 1981.
[13] E. F. Codd, "A relational model of data for large shared data banks,"Commun. ACM, pp. 377-387, June 1970.
[14] E. F. Codd, "Relational completeness of data base sublanguages," inData Base Systems, R. Rustin, Ed. Englewood Cliffs, NJ: Prentice-Hall, 1972, pp. 65-98.
[15] U. Dayal and J. M. Smith, "PROBE: A knowledge-oriented database management system," inProc. Islamorada Workshop Large Scale Knowledge Base and Reasoning Syst., Islamorada, FL, Feb. 1985, pp. 103-137.
[16] H. Gallaire, J. Minker, and J. Nicolas, "Logic and databases: A deductive approach,"ACM Comput. Surveys, vol. 16, pp. 153-185,1984.
[17] A. Guttman, "New features for relational database systems to support CAD applications," Ph.D. dissert., Comput. Sci. Dept., Univ. California, Berkley, June 1984.
[18] J. Han, "Pattern-based and knowledge-directed query compilation for recursive databases," Comput. Sci. Tech. Rep. 629, Univ. Wisconsin, Madison, Ph.D. dissertation, Jan. 1986.
[19] S. Heiler and A. Rosenthal, "G-WHIZ, A visual interface for the functional model with recursion," inProc. 11th Int. Conf. Very Large Data Bases, Stockholm, Sweden, Aug. 1985, pp. 209-218.
[20] L. J. Henschen and S. Naqvi, "On compiling queries in recursive first-order databases,"J. ACM, vol. 1, no. 1, pp. 47-85, 1984.
[21] 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.
[22] G. James and W. Stoeller, "Operations on tree-structured tables," X3H2-26-15 Standards Comm. Working Paper, 1982.
[23] M. Jarke, J. Clifford, and Y. Vassiliou, "An optimizing prolog front-end to a relational query system," inProc. ACM-SIGMOD 1984 Int. Conf. Management of Data, Boston, MA, June 1984, pp. 296-306.
[24] A. Klug, "Equivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate Functions,"J. ACM, Vol. 29, No. 3, July 1982, pp. 699-717.
[25] S. Kunifuji and H. Yokota, "PROLOG and relational databases for fifth-generation computer systems," inProc. Workshop Logical Bases for Data Bases, Toulouse, France, Dec. 1982.
[26] D. Maier,The Theory of Relational Database. Computer Science Press, 1983.
[27] T. H. Merrett,Relational Information System. Reston, VA: Reston Publishing, 1984.
[28] S. Naqvi, "A logic for negation in database systems," presented at the XP 7.52/Workshop on Database Theory, Austin, TX, Aug. 1986.
[29] 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.
[30] J. D. Ullman,Principles of Databases Systems. Rockville, MD: Computer Science Press, 1982.
[31] L. Vieille, "Recursive axioms in deductive databases: The query/ subquery approach," inProc. 1st Int. Conf. Expert Database Syst., Charleston, SC, Apr. 1986, pp. 179-193.
[32] M. M. Zloof, "Query-by-example: Operations on the transitive closure," RC 5526, IBM, Yorktown Heights, NY, 1975.

Index Terms:
Codd; alpha operator; deductive databases; relational algebra; recursive queries; transitive relationships; critical path; project management network; database theory; query languages; recursive functions; relational databases
Citation:
R. Agrawal, "Alpha: An Extension of Relational Algebra to Express a Class of Recursive Queries," IEEE Transactions on Software Engineering, vol. 14, no. 7, pp. 879-885, July 1988, doi:10.1109/32.42731
Usage of this product signifies your acceptance of the Terms of Use.