The relational model with relation-valued attributes
Information Systems
Naive evaluation of recursively defined relations
On knowledge base management systems: integrating artificial intelligence and d atabase technologies
An amateur's introduction to recursive query processing strategies
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Traversal recursion: a practical approach to supporting recursive applications
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
SQL/NF: a query language for ¬ 1NF relational databases
Information Systems
A graphical query language supporting recursion
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Efficient evaluation of right-, left-, and multi-linear rules
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Linearising nonlinear recursions in polynomial time
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Finding regular simple paths in graph databases
VLDB '89 Proceedings of the 15th international conference on Very large data bases
Extending the relational algebra to capture complex objects
VLDB '89 Proceedings of the 15th international conference on Very large data bases
Direct transitive closure algorithms: design and performance evaluation
ACM Transactions on Database Systems (TODS)
The input/output complexity of transitive closure
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Hybrid transitive closure algorithms
Proceedings of the sixteenth international conference on Very large databases
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Overbound and right-linear queries
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Mixed-approach algorithms for transitive closure (extended abstract)
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
GraphLog: a visual formalism for real life recursion
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A generalized transitive closure for relational queries
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Universality of data retrieval languages
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Evaluating Recursive Queries in CAD Using an Extended Projection Function
Proceedings of the Third International Conference on Data Engineering
Alpha: An Extension of Relational Algebra to Express a Class of Recursive Queries
Proceedings of the Third International Conference on Data Engineering
Non First Normal Form Relations and Recursive Queries: An SQL-Based Approach
Proceedings of the Third International Conference on Data Engineering
Aggregative Closure: An Extension of Transitive Closure
Proceedings of the Fifth International Conference on Data Engineering
A Suitable Algorithm for Computing Partial Transitive Closures in Databases
Proceedings of the Sixth International Conference on Data Engineering
Optimization of Generalized Transitive Closure Queries
Proceedings of the Seventh International Conference on Data Engineering
A Spanning Tree Transitive Closure Algorithm
Proceedings of the Eighth International Conference on Data Engineering
Design Overview of the NAIL! System
Proceedings of the Third International Conference on Logic Programming
Designing A Generalized NF2 Model with an SQL-Type Language Interface
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
On the Computation of the Transitive Closure of Relational Operators
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Efficient Transitive Closure Algorithms
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
New Strategies for Computing the Transitive Closure of a Database Relation
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
PRIMA - a DBMS Prototype Supporting Engineering Applications
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
New features for a relational database system to support computer aided design
New features for a relational database system to support computer aided design
View materialization techniques for complex hierarchical objects
CIKM '97 Proceedings of the sixth international conference on Information and knowledge management
Database Graph Views: A Practical Model to Manage Persistent Graphs
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Data Models for Metrics-Based Project Management Systems
COMPSAC '96 Proceedings of the 20th Conference on Computer Software and Applications
Advanced query language for manipulating complex entities
Information Processing and Management: an International Journal
Querying web metadata: Native score management and text support in databases
ACM Transactions on Database Systems (TODS)
PSE: An Object-Oriented Representation for Modeling and Managing Part-of Relationships
Journal of Intelligent Information Systems
The expressivity of XPath with transitive closure
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A data model for trip planning in multimodal transportation systems
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
| Hi-index | 0.00 |
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.