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 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
Regular path queries with constraints
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Dual Labeling: Answering Graph Reachability Queries in Constant Time
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Yago: a core of semantic knowledge
Proceedings of the 16th international conference on World Wide Web
Efficiently Querying Large XML Data Repositories: A Survey
IEEE Transactions on Knowledge and Data Engineering
Efficiently answering reachability queries on very large directed graphs
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Proceedings of the 25th international conference on Machine learning
Hoeffding and Bernstein races for selecting policies in evolutionary direct policy search
ICML '09 Proceedings of the 26th Annual International Conference on Machine Learning
3-HOP: a high-compression indexing scheme for reachability query
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Patterns of influence in a recommendation network
PAKDD'06 Proceedings of the 10th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
Path-tree: An efficient reachability indexing scheme for large directed graphs
ACM Transactions on Database Systems (TODS)
Efficiently evaluating graph constraints in content-based publish/subscribe
Proceedings of the 20th international conference on World wide web
Answering label-constraint reachability in large graphs
Proceedings of the 20th ACM international conference on Information and knowledge management
Skynets: searching for minimum trees in graphs with incomparable edge weights
Proceedings of the 20th ACM international conference on Information and knowledge management
Efficient association discovery with keyword-based constraints on large graph data
Proceedings of the 20th ACM international conference on Information and knowledge management
Conkar: constraint keyword-based association discovery
Proceedings of the 20th ACM international conference on Information and knowledge management
Journal of Biomedical Informatics
Reconstructing unsound data provenance view in scientific workflow
APWeb'12 Proceedings of the 14th international conference on Web Technologies and Applications
Access control in social networks: a reachability-based approach
Proceedings of the 2012 Joint EDBT/ICDT Workshops
Chromatic correlation clustering
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
K-reach: who is in your small world
Proceedings of the VLDB Endowment
Regular path queries on large graphs
SSDBM'12 Proceedings of the 24th international conference on Scientific and Statistical Database Management
A trichotomy for regular simple path queries on graphs
Proceedings of the 32nd symposium on Principles of database systems
Computing weight constraint reachability in large networks
The VLDB Journal — The International Journal on Very Large Data Bases
Minimizing data transfers for regular reachability queries on distributed graphs
Proceedings of the Fourth Symposium on Information and Communication Technology
Proceedings of the VLDB Endowment
Efficient processing of label-constraint reachability queries in large graphs
Information Systems
Hi-index | 0.00 |
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graphs, i.e., each edge has a label that denotes the relationship between the two vertices connected by the edge. A fundamental research problem on these labeled graphs is how to handle the label-constraint reachability query: Can vertex u reach vertex v through a path whose edge labels are constrained by a set of labels? In this work, we introduce a novel tree-based index framework which utilizes the directed maximal weighted spanning tree algorithm and sampling techniques to maximally compress the generalized transitive closure for the labeled graphs. An extensive experimental evaluation on both real and synthetic datasets demonstrates the efficiency of our approach in answering label-constraint reachability queries.