Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Answering label-constraint reachability in large graphs
Proceedings of the 20th ACM international conference on Information and knowledge management
Capturing topology in graph pattern matching
Proceedings of the VLDB Endowment
Distributed graph pattern matching
Proceedings of the 21st international conference on World Wide Web
Query languages for graph databases
ACM SIGMOD Record
Graph pattern matching revised for social network analysis
Proceedings of the 15th International Conference on Database Theory
Chromatic correlation clustering
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Regular path queries on large graphs
SSDBM'12 Proceedings of the 24th international conference on Scientific and Statistical Database Management
Efficient algorithms for generalized subgraph query processing
Proceedings of the 21st ACM international conference on Information and knowledge management
Semantic acyclicity on graph databases
Proceedings of the 32nd symposium on Principles of database systems
Trial for RDF: adapting graph query languages for RDF data
Proceedings of the 32nd symposium on Principles of database systems
A trichotomy for regular simple path queries on graphs
Proceedings of the 32nd symposium on Principles of database systems
SynopSys: large graph analytics in the SAP HANA database through summarization
First International Workshop on Graph Data Management Experiences and Systems
Expressive languages for selecting groups from graph-structured data
Proceedings of the 22nd international conference on World Wide Web
Incremental graph pattern matching
ACM Transactions on Database Systems (TODS)
Computing weight constraint reachability in large networks
The VLDB Journal — The International Journal on Very Large Data Bases
BNCOD'13 Proceedings of the 29th British National conference on Big Data
Strong simulation: Capturing topology in graph pattern matching
ACM Transactions on Database Systems (TODS)
Efficient simrank-based similarity join over large graphs
Proceedings of the VLDB Endowment
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
Querying Regular Graph Patterns
Journal of the ACM (JACM)
Efficient processing of label-constraint reachability queries in large graphs
Information Systems
Hi-index | 0.00 |
It is increasingly common to find graphs in which edges bear different types, indicating a variety of relationships. For such graphs we propose a class of reachability queries and a class of graph patterns, in which an edge is specified with a regular expression of a certain form, expressing the connectivity in a data graph via edges of various types. In addition, we define graph pattern matching based on a revised notion of graph simulation. On graphs in emerging applications such as social networks, we show that these queries are capable of finding more sensible information than their traditional counterparts. Better still, their increased expressive power does not come with extra complexity. Indeed, (1) we investigate their containment and minimization problems, and show that these fundamental problems are in quadratic time for reachability queries and are in cubic time for pattern queries. (2) We develop an algorithm for answering reachability queries, in quadratic time as for their traditional counterpart. (3) We provide two cubic-time algorithms for evaluating graph pattern queries based on extended graph simulation, as opposed to the NP-completeness of graph pattern matching via subgraph isomorphism. (4) The effectiveness, efficiency and scalability of these algorithms are experimentally verified using real-life data and synthetic data.