Graph algorithms and NP-completeness
Graph algorithms and NP-completeness
Filtering data flow in deductive databases
Proceedings on International conference on database theory
An amateur's introduction to recursive query processing strategies
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Efficiently updating materialized views
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
The mathematics of inheritance systems
The mathematics of inheritance systems
Bounds on the propagation of selection into logic programs
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A study of transitive closure as a recursion mechanism
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
A performance analysis of view materialization strategies
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Amortized efficiency of a path retrieval data structure
Theoretical Computer Science
Semantic database modeling: survey, applications, and research issues
ACM Computing Surveys (CSUR)
Parallel evaluation of the transitive closure of a database relation
International Journal of Parallel Programming
Clustering a DAG for CAD Databases
IEEE Transactions on Software Engineering
Multiprocessor transitive closure algorithms
DPDS '88 Proceedings of the first international symposium on Databases in parallel and distributed systems
Incorporating hierarchy in a relational model of data
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Efficient management of transitive relationships in large data and knowledge bases
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Direct transitive closure algorithms: design and performance evaluation
ACM Transactions on Database Systems (TODS)
Alpha: An Extension of Relational Algebra to Express a Class of Recursive Queries
Proceedings of the Third International Conference on Data Engineering
Moving Selections into Linear Least Fixpoint Queries
Proceedings of the Fourth International Conference on Data Engineering
On the Computation of the Transitive Closure of Relational Operators
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Database Support for Knowledge-Based Image Evaluation
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Efficient Transitive Closure Algorithms
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
Benchmarking Database Systems A Systematic Approach
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
Materialization and Incremental Update of Path Information
Proceedings of the Fifth International Conference on Data Engineering
New Strategies for Computing the Transitive Closure of a Database Relation
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
Spatial data traversal in road map databases: a graph indexing approach
CIKM '94 Proceedings of the third international conference on Information and knowledge management
ACM Transactions on Database Systems (TODS)
On certificates and lookahead in dynamic graph problems
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Incremental algorithms for minimal length paths
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
A vision for management of complex models
ACM SIGMOD Record
HyperFile: a data and query model for documents
The VLDB Journal — The International Journal on Very Large Data Bases
Algorithms for Searching Massive Graphs
IEEE Transactions on Knowledge and Data Engineering
Path Signatures: A Way to Speed Up Recursion in Relational Databases
IEEE Transactions on Knowledge and Data Engineering
The Strong Partial Transitive-Closure Problem: Algorithms and Performance Evaluation
IEEE Transactions on Knowledge and Data Engineering
Description and Identification of Distributed Fragments of Recursive Relations
IEEE Transactions on Knowledge and Data Engineering
An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps
IEEE Transactions on Knowledge and Data Engineering
Implementations and experimental studies of dynamic graph algorithms
Experimental algorithmics
On the computation of recursion in relational databases
Effective databases for text & document management
On the transitive closure representation and adjustable compression
Proceedings of the 2006 ACM symposium on Applied computing
Optimization and evaluation of shortest path queries
The VLDB Journal — The International Journal on Very Large Data Bases
A new method for generating compressed representation of transitive closure
Proceedings of the 2008 C3S2E conference
Efficiently answering reachability queries on very large directed graphs
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Preserving confidentiality of security policies in data outsourcing
Proceedings of the 7th ACM workshop on Privacy in the electronic society
On-line exact shortest distance query processing
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
General spanning trees and reachability query evaluation
C3S2E '09 Proceedings of the 2nd Canadian Conference on Computer Science and Software Engineering
3-HOP: a high-compression indexing scheme for reachability query
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
An optimal labeling scheme for workflow provenance using skeleton labels
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Path-hop: efficiently indexing large graphs for reachability queries
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
A hierarchical approach to reachability query answering in very large graph databases
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
On-line preferential nearest neighbor browsing in large attributed graphs
DASFAA'10 Proceedings of the 15th international conference on Database systems for advanced applications
GRAIL: scalable reachability index for large graphs
Proceedings of the VLDB Endowment
Path-tree: An efficient reachability indexing scheme for large directed graphs
ACM Transactions on Database Systems (TODS)
Labeling recursive workflow executions on-the-fly
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
BMC: an efficient method to evaluate probabilistic reachability queries
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
Answering label-constraint reachability in large graphs
Proceedings of the 20th ACM international conference on Information and knowledge management
Journal of Biomedical Informatics
SCARAB: scaling reachability computation on large graphs
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
I/O cost minimization: reachability queries processing over massive graphs
Proceedings of the 15th International Conference on Extending Database Technology
K-reach: who is in your small world
Proceedings of the VLDB Endowment
Decomposing DAGs into disjoint chains
DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
TF-Label: a topological-folding labeling scheme for reachability querying in a large graph
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Scalable motif detection and aggregation
ADC '12 Proceedings of the Twenty-Third Australasian Database Conference - Volume 124
Computing weight constraint reachability in large networks
The VLDB Journal — The International Journal on Very Large Data Bases
Effective race detection for event-driven programs
Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications
Simple, fast, and scalable reachability oracle
Proceedings of the VLDB Endowment
Efficient processing of label-constraint reachability queries in large graphs
Information Systems
| Hi-index | 0.00 |
An important feature of database support for expert systems is the ability of the database to answer queries regarding the existence of a path from one node to another in the directed graph underlying some database relation. Given just the database relation, answering such a query is time-consuming, but given the transitive closure of the database relation a table look-up suffices. We present an indexing scheme that permits the storage of the pre-computed transitive closure of a database relation in a compressed form. The existence of a specified tuple in the closure can be determined from this compressed store by a single look-up followed by an index comparision. We show how to add nodes and arcs to the compressed closure incrementally. We also suggest how this compression technique can be used to reduce the effort required to compute the transitive closure.