Answering label-constraint reachability in large graphs

Authors:
Kun Xu;Lei Zou;Jeffery Xu Yu;Lei Chen;Yanghua Xiao;Dongyan Zhao
Affiliations:
Peking University, Beijing, China;Peking University, Beijing, China;The Chinese University of Hong Kong, Hong Kong, China;Hong Kong University of Science and Technology, Hong Kong, China;Fudan University, Shanghai, China;Peking University, Beijing, China
Venue:
Proceedings of the 20th ACM international conference on Information and knowledge management
Year:
2011

Citing 13
Cited 2

A compression technique to materialize transitive closure

ACM Transactions on Database Systems (TODS)
Reachability and Distance Queries via 2-Hop Labels

SIAM Journal on Computing
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
Finding Pathway Structures in Protein Interaction Networks

Algorithmica
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
Efficiently answering reachability queries on very large directed graphs

Proceedings of the 2008 ACM SIGMOD international conference on Management of data
StatSnowball: a statistical approach to extracting entity relationships

Proceedings of the 18th international conference on World wide web
3-HOP: a high-compression indexing scheme for reachability query

Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
RDFKB: efficient support for RDF inference queries and knowledge management

IDEAS '09 Proceedings of the 2009 International Database Engineering & Applications Symposium
Incremental Maintenance of 2-Hop Labeling of Large Graphs

IEEE Transactions on Knowledge and Data Engineering
Computing label-constraint reachability in graph databases

Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Adding regular expressions to graph reachability and pattern queries

ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering

Chromatic correlation clustering

Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Computing weight constraint reachability in large networks

The VLDB Journal — The International Journal on Very Large Data Bases

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study a variant of reachability queries, called label-constraint reachability (LCR) queries, specifically,given a label set S and two vertices u1 and u2 in a large directed graph G, we verify whether there exists a path from u1 to u2 under label constraint S. Like traditional reachability queries, LCR queries are very useful, such as pathway finding in biological networks, inferring over RDF (resource description f ramework) graphs, relationship finding in social networks. However, LCR queries are much more complicated than their traditional counterpart.Several techniques are proposed in this paper to minimize the search space in computing path-label transitive closure. Furthermore, we demonstrate the superiority of our method by extensive experiments.