Algorithmics and applications of tree and graph searching
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
A Fast Index for Semistructured Data
Proceedings of the 27th International Conference on Very Large Data Bases
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
SPIN: mining maximal frequent subgraphs from graph databases
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Data Mining: Concepts and Techniques
Data Mining: Concepts and Techniques
Graph indexing based on discriminative frequent structure analysis
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2004
Fg-index: towards verification-free query processing on graph databases
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Substructure similarity measurement in chinese recipes
Proceedings of the 17th international conference on World Wide Web
Efficient query processing on graph databases
ACM Transactions on Database Systems (TODS)
Mining high utility patterns in incremental databases
Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication
Enhancing graph database indexing by suffix tree structure
PRIB'10 Proceedings of the 5th IAPR international conference on Pattern recognition in bioinformatics
Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism
Journal of Experimental Algorithmics (JEA)
A tool for fast indexing and querying of graphs
Proceedings of the 20th international conference companion on World wide web
| Hi-index | 0.00 |
Data mining is a relatively new and promising field of computer science. It is used for extracting valuable information or knowledge from large database. Data mining requires searching for frequent patterns from large database. Frequent substructure mining is also denoted by graph mining. Some of the graph mining algorithms were Apriori based and path based. gIndex is more robust algorithm for mining graphs. Given a query graph, this algorithm finds the supergraphs of that query graph from the graph database. gIndex maintains an index of graph database according to discriminative fragments. In this paper, a further improvement over the existing gIndex algorithm is proposed. More information is stored in the index data structure to quickly answer the graph query, discarding the unnecessary graphs. The proposed method in this paper handles sudden change in database graph patterns efficiently and is capable of processing queries in dynamic and evolving database which gIndex can not handle. It also ensures a good running time for processing graph queries.