Extending SQL with Generalized Transitive Closure Functionality

We present SQL/TC, an extension of SQL, to allow the expression of generalized transitive closure queries. The extension permits the user to pose queries that compute paths between two points and information associated with these paths. Such queries may specify selections on arcs, paths, or sets of paths, The output of a query may include the aggregation of information for different paths between the same endpoints. Our notation is declarative, preserves the spirit of SQL, and allows a declarative and concise formulation of transitive closure queries. >

[1]  Håkan Jakobsson,et al.  Mixed-approach algorithms for transitive closure (extended abstract) , 1991, ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems.

[2]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[3]  Jeffrey F. Naughton,et al.  Efficient evaluation of right-, left-, and multi-linear rules , 1989, SIGMOD '89.

[4]  Jiawei Han,et al.  Path: An Approach to Incorporate List Processing in A Relational Database , 1990, SEKE.

[5]  François Bancilhon,et al.  Naive Evaluation of Recursively Defined Relations , 1986, On Knowledge Base Management Systems.

[6]  H. V. Jagadish,et al.  Direct Algorithms for Computing the Transitive Closure of Database Relations , 1987, VLDB.

[7]  Hamid Pirahesh,et al.  Overbound and right-linear queries , 1991, PODS.

[8]  I. Anderson,et al.  Graphs and Networks , 1981, The Mathematical Gazette.

[9]  Peter Pistor,et al.  Designing A Generalized NF2 Model with an SQL-Type Language Interface , 1986, VLDB.

[10]  Hamid Pirahesh,et al.  Magic conditions , 1990, PODS.

[11]  H. V. Jagadish,et al.  A spanning tree transitive closure algorithm , 1992, [1992] Eighth International Conference on Data Engineering.

[12]  Alberto O. Mendelzon,et al.  GraphLog: a visual formalism for real life recursion , 1990, PODS '90.

[13]  Alberto O. Mendelzon,et al.  A graphical query language supporting recursion , 1987, SIGMOD '87.

[14]  George Samaras,et al.  Evaluating recursive queries in CAD using an extended projection function , 1987, 1987 IEEE Third International Conference on Data Engineering.

[15]  Seppo Sippu,et al.  A generalized transitive closure for relational queries , 1988, PODS '88.

[16]  H. V. Jagadish,et al.  Optimization of generalized transitive closure queries , 1991, [1991] Proceedings. Seventh International Conference on Data Engineering.

[17]  Theodore S. Norvell,et al.  Aggregative closure: an extension of transitive closure , 1989, [1989] Proceedings. Fifth International Conference on Data Engineering.

[18]  Patrick Valduriez,et al.  Evaluation of Recursive Queries Using Join Indices , 1986, Expert Database Conf..

[19]  Hans-Jörg Schek,et al.  The relational model with relation-valued attributes , 1986, Inf. Syst..

[20]  Bernhard Mitschang,et al.  Extending the Relational Algebra to Capture Complex Objects , 1989, VLDB.

[21]  Henry F. Korth,et al.  SQL/NF: a query language for ¬1 NF relational databases , 1987, Inf. Syst..

[22]  Divesh Srivastava,et al.  Pushing constraint selections , 1992, J. Log. Program..

[23]  Antonin Guttman.  New features for a relational database system to support computer aided design , 1984 .

[24]  Klaus Meyer-Wegener,et al.  PRIMA - a DBMS Prototype Supporting Engineering Applications , 1987, VLDB.

[25]  H. V. Jagadish,et al.  Hybrid Transitive Closure Algorithms , 1990, VLDB.

[26]  Volker Linnemann.  Non first normal form relations and recursive queries: An SQL-based approach , 1987, 1987 IEEE Third International Conference on Data Engineering.

[27]  Raghu Ramakrishnan,et al.  Efficient Transitive Closure Algorithms , 1988, VLDB.

[28]  Hongjun Lu,et al.  New Strategies for Computing the Transitive Closure of a Database Relation , 1987, VLDB.

[29]  Rakesh Agrawal.  Alpha: An Extension of Relational Algebra to Express a Class of Recursive Queries , 1988, IEEE Trans. Software Eng..

[30]  Håkan Jakobsson,et al.  Mixed-approach algorithms for transitive closure (extended abstract) , 1991, PODS '91.

[31]  Yannis E. Ioannidis,et al.  On the Computation of the Transitive Closure of Relational Operators , 1986, VLDB.

[32]  Hamid Pirahesh,et al.  Magic is relevant , 1990, SIGMOD '90.

[33]  Umeshwar Dayal,et al.  Traversal recursion: a practical approach to supporting recursive applications , 1986, SIGMOD '86.

[34]  Alfred V. Aho,et al.  Universality of data retrieval languages , 1979, POPL.

[35]  Clement T. Yu,et al.  A necessary condition for a doubly recursive rule to be equivalent to a linear recursive rule , 1987, SIGMOD '87.

[36]  Jeffrey D. Ullman,et al.  Design Overview of the NAIL! System , 1986, ICLP.

[37]  Yatin P. Saraiya.  Linearising nonlinear recursions in polynomial time , 1989, PODS.

[38]  H. V. Jagadish,et al.  Direct transitive closure algorithms: design and performance evaluation , 1990, TODS.

[39]  Alberto O. Mendelzon,et al.  G+: Recursive Queries Without Recursion , 1988, Expert Database Conf..

[40]  Bin Jiang,et al.  A suitable algorithm for computing partial transitive closures in databases , 1990, [1990] Proceedings. Sixth International Conference on Data Engineering.