Algorithmics and applications of tree and graph searching
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Fast discovery of connection subgraphs
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Substructure similarity search in graph databases
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Graph indexing based on discriminative frequent structure analysis
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2004
Closure-Tree: An Index Structure for Graph Queries
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Measuring and extracting proximity in networks
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Center-piece subgraphs: problem definition and fast solutions
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Fg-index: towards verification-free query processing on graph databases
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Correlation search in graph databases
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Fast best-effort pattern matching in large attributed graphs
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Towards graph containment search and indexing
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
A novel spectral coding in a large graph database
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Taming verification hardness: an efficient algorithm for testing subgraph isomorphism
Proceedings of the VLDB Endowment
A novel approach for efficient supergraph query processing on graph databases
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
TALE: A Tool for Approximate Large Graph Matching
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Context-Aware Object Connection Discovery in Large Graphs
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Efficient Discovery of Frequent Correlated Subgraph Pairs
ICDM '09 Proceedings of the 2009 Ninth IEEE International Conference on Data Mining
Structure and attribute index for approximate graph matching in large graphs
Information Systems
Efficient retrieval of similar workflow models based on behavior
APWeb'12 Proceedings of the 14th Asia-Pacific international conference on Web Technologies and Applications
Efficient Multiview Maintenance under Insertion in Huge Social Networks
ACM Transactions on the Web (TWEB)
Querying business process model repositories
World Wide Web
| Hi-index | 0.00 |
Graph exists ubiquitously in a wide spectrum of application domains, such as protein structures in biology, chemical compounds in chemistry, food webs in ecology, social networks, Web graphs, P2P networks, and many more. With the increasing popularity of graph databases, how to assess graph data effectively and efficiently becomes an important research problem. Considerable research efforts have been devoted to developing advanced query processing techniques on graph databases. This tutorial presents a comprehensive survey on methodologies and techniques for querying large graph databases, including subgraph and supergraph query processing, structural similarity query processing, correlation search in transaction graph databases, connection query processing and approximate matching in large graphs. The tutorial is prepared for database and data mining researchers who are interested in complex data types that can be generally modeled as graphs.