An improved algorithm for transitive closure on acyclic digraphs
Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
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
Introduction to algorithms
A compression technique to materialize transitive closure
ACM Transactions on Database Systems (TODS)
Reachability and distance queries via 2-hop labels
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Stack-based algorithms for pattern matching on DAGs
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Dual Labeling: Answering Graph Reachability Queries in Constant Time
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Fast and practical indexing and querying of very large graphs
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
Fast computation of reachability labeling for large graphs
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
On-line exact shortest distance query processing
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
A Uniform Framework for Ad-Hoc Indexes to Answer Reachability Queries on Large Graphs
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
A Uniform Framework for Ad-Hoc Indexes to Answer Reachability Queries on Large Graphs
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
3-HOP: a high-compression indexing scheme for reachability query
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Evaluating Reachability Queries over Path Collections
SSDBM 2009 Proceedings of the 21st International Conference on Scientific and Statistical Database Management
Techniques for efficiently querying scientific workflow provenance graphs
Proceedings of the 13th International Conference on Extending Database Technology
How to authenticate graphs without leaking
Proceedings of the 13th International Conference on Extending Database Technology
TEDI: efficient shortest path query answering on graphs
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Computing label-constraint reachability in graph databases
Proceedings of the 2010 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
Fast and accurate estimation of shortest paths in large graphs
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Fast top-k simple shortest paths discovery in graphs
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
Efficient graph reachability query answering using tree decomposition
RP'10 Proceedings of the 4th international conference on Reachability problems
GRAIL: scalable reachability index for large graphs
Proceedings of the VLDB Endowment
On graph query optimization in large networks
Proceedings of the VLDB Endowment
Path-tree: An efficient reachability indexing scheme for large directed graphs
ACM Transactions on Database Systems (TODS)
R2DF framework for ranked path queries over weighted RDF graphs
Proceedings of the International Conference on Web Intelligence, Mining and Semantics
Labeling recursive workflow executions on-the-fly
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
A memory efficient reachability data structure through bit vector compression
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Efficient topological OLAP on information networks
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
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
A family of graph-theory-driven algorithms for managing complex probabilistic graph data efficiently
Proceedings of the 15th Symposium on International Database Engineering & Applications
A framework for SQL-Based mining of large graphs on relational databases
PAKDD'10 Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part II
Managing large dynamic graphs efficiently
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Query preserving graph compression
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
SCARAB: scaling reachability computation on large graphs
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Adaptive optimizations of recursive queries in teradata
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
Pay-as-you-go maintenance of precomputed nearest neighbors in large graphs
Proceedings of the 21st ACM international conference on Information and knowledge management
The exact distance to destination in undirected world
The VLDB Journal — The International Journal on Very Large Data Bases
G-path: flexible path pattern query on large graphs
Proceedings of the 22nd international conference on World Wide Web companion
Computing weight constraint reachability in large networks
The VLDB Journal — The International Journal on Very Large Data Bases
Fast and scalable reachability queries on graphs by pruned labeling with landmarks and paths
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Shortest-path queries in static networks
ACM Computing Surveys (CSUR)
Minimizing data transfers for regular reachability queries on distributed graphs
Proceedings of the Fourth Symposium on Information and Communication Technology
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 |
Efficiently processing queries against very large graphs is an important research topic largely driven by emerging real world applications, as diverse as XML databases, GIS, web mining, social network analysis, ontologies, and bioinformatics. In particular, graph reachability has attracted a lot of research attention as reachability queries are not only common on graph databases, but they also serve as fundamental operations for many other graph queries. The main idea behind answering reachability queries in graphs is to build indices based on reachability labels. Essentially, each vertex in the graph is assigned with certain labels such that the reachability between any two vertices can be determined by their labels. Several approaches have been proposed for building these reachability labels; among them are interval labeling (tree cover) and 2-hop labeling. However, due to the large number of vertices in many real world graphs (some graphs can easily contain millions of vertices), the computational cost and (index) size of the labels using existing methods would prove too expensive to be practical. In this paper, we introduce a novel graph structure, referred to as path-tree, to help labeling very large graphs. The path-tree cover is a spanning subgraph of G in a tree shape. We demonstrate both analytically and empirically the effectiveness of our new approaches.