Efficient Matching and Indexing of Graph Models in Content-Based Retrieval
IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
Algorithmics and applications of tree and graph searching
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
APEX: an adaptive path index for XML data
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Geometric Hashing: An Overview
IEEE Computational Science & Engineering
Similarity Searching in Medical Image Databases
IEEE Transactions on Knowledge and Data Engineering
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
A Fast Index for Semistructured Data
Proceedings of the 27th International Conference on Very Large Data Bases
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
An Efficient Algorithm for Mining Association Rules in Large Databases
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Sampling Large Databases for Association Rules
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Mining Molecular Fragments: Finding Relevant Substructures of Molecules
ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
Computing Frequent Graph Patterns from Semistructured Data
ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
gSpan: Graph-Based Substructure Pattern Mining
ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
D(k)-index: an adaptive structural summary for graph-structured data
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
CloseGraph: mining closed frequent graph patterns
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Fast vertical mining using diffsets
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
State of the art of graph-based data mining
ACM SIGKDD Explorations Newsletter
A platform based on the multi-dimensional data modal for analysis of bio-molecular structures
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
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
On incremental maintenance of 2-hop labeling of graphs
Proceedings of the 17th international conference on World Wide Web
Substructure similarity measurement in chinese recipes
Proceedings of the 17th international conference on World Wide Web
Constructing visual phrases for effective and efficient object-based image retrieval
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Efficient query processing on graph databases
ACM Transactions on Database Systems (TODS)
GConnect: a connectivity index for massive disk-resident graphs
Proceedings of the VLDB Endowment
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Enhancing graph database indexing by suffix tree structure
PRIB'10 Proceedings of the 5th IAPR international conference on Pattern recognition in bioinformatics
iGraph: a framework for comparisons of disk-based graph indexing techniques
Proceedings of the VLDB Endowment
Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism
Journal of Experimental Algorithmics (JEA)
Selecting materialized views for RDF data
ICWE'10 Proceedings of the 10th international conference on Current trends in web engineering
Efficient algorithms for supergraph query processing on graph databases
Journal of Combinatorial Optimization
Towards efficient subgraph search in cloud computing environments
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications
Dual active feature and sample selection for graph classification
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Fast graph query processing with a low-cost index
The VLDB Journal — The International Journal on Very Large Data Bases
Querying large graph databases
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part II
EGDIM: evolving graph database indexing method
Proceedings of the 6th International Conference on Ubiquitous Information Management and Communication
Turboiso: towards ultrafast and robust subgraph isomorphism search in large graph databases
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Frequent subgraph summarization with error control
WAIM'13 Proceedings of the 14th international conference on Web-Age Information Management
Querying business process model repositories
World Wide Web
| Hi-index | 0.01 |
Graphs have become increasingly important in modelling complicated structures and schemaless data such as chemical compounds, proteins, and XML documents. Given a graph query, it is desirable to retrieve graphs quickly from a large database via indices. In this article, we investigate the issues of indexing graphs and propose a novel indexing model based on discriminative frequent structures that are identified through a graph mining process. We show that the compact index built under this model can achieve better performance in processing graph queries. Since discriminative frequent structures capture the intrinsic characteristics of the data, they are relatively stable to database updates, thus facilitating sampling-based feature extraction and incremental index maintenance. Our approach not only provides an elegant solution to the graph indexing problem, but also demonstrates how database indexing and query processing can benefit from data mining, especially frequent pattern mining. Furthermore, the concepts developed here can be generalized and applied to indexing sequences, trees, and other complicated structures as well.