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
A compression technique to materialize transitive closure
ACM Transactions on Database Systems (TODS)
A graph generation software package
SIGCSE '91 Proceedings of the twenty-second SIGCSE technical symposium on Computer science education
Finding Regular Simple Paths in Graph Databases
SIAM Journal on Computing
Query containment for conjunctive queries with regular expressions
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
Introduction to algorithms
Reachability and distance queries via 2-hop labels
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
On path selection for traffic with bandwidth guarantees
ICNP '97 Proceedings of the 1997 International Conference on Network Protocols (ICNP '97)
A fully dynamic reachability algorithm for directed graphs with an almost linear update time
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Compact reachability labeling for graph-structured data
Proceedings of the 14th ACM international conference on Information and knowledge management
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
Fast computing reachability labelings for large graphs with high compression rate
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
On incremental maintenance of 2-hop labeling of graphs
Proceedings of the 17th international conference on World Wide Web
Efficiently answering reachability queries on very large directed graphs
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
An Efficient Algorithm for Answering Graph Reachability Queries
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
3-HOP: a high-compression indexing scheme for reachability query
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
On the evolution of user interaction in Facebook
Proceedings of the 2nd ACM workshop on Online social networks
Computing label-constraint reachability in graph databases
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
GRAIL: scalable reachability index for large graphs
Proceedings of the VLDB Endowment
A memory efficient reachability data structure through bit vector compression
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Distance-constraint reachability computation in uncertain graphs
Proceedings of the VLDB Endowment
Adding regular expressions to graph reachability and pattern queries
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
Answering label-constraint reachability in large graphs
Proceedings of the 20th ACM international conference on Information and knowledge management
Hi-index | 0.00 |
Reachability is a fundamental problem on large-scale networks emerging nowadays in various application domains, such as social networks, communication networks, biological networks, road networks, etc. It has been studied extensively. However, little existing work has studied reachability with realistic constraints imposed on graphs with real-valued edge or node weights. In fact, such weights are very common in many real-world networks, for example, the bandwidth of a link in communication networks, the reliability of an interaction between two proteins in PPI networks, and the handling capacity of a warehouse/storage point in a distribution network. In this paper, we formalize a new yet important reachability query in weighted undirected graphs, called weight constraint reachability (WCR) query that asks: is there a path between nodes $$a$$ and $$b$$ , on which each real-valued edge (or node) weight satisfies a range constraint. We discover an interesting property of WCR, based on which, we design a novel edge-based index structure to answer the WCR query in $$O(1)$$ time. Furthermore, we consider the case when the index cannot entirely fit in the memory, which can be very common for emerging massive networks. An I/O-efficient index is proposed, which provides constant I/O (precisely four I/Os) query time with $$O(|V|\log |V|)$$ disk-based index size. Extensive experimental studies on both real and synthetic datasets demonstrate the efficiency and scalability of our solutions in answering the WCR query.