An Algorithm for Subgraph Isomorphism
Journal of the ACM (JACM)
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
Covering indexes for branching path queries
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
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
GraphDB: Modeling and Querying Graphs in Databases
VLDB '94 Proceedings of the 20th 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
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
Scalable mining of large disk-based graph databases
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
SPIN: mining maximal frequent subgraphs from graph databases
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Mining compressed frequent-pattern sets
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Graph indexing based on discriminative frequent structure analysis
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2004
\delta-Tolerance Closed Frequent Itemsets
ICDM '06 Proceedings of the Sixth International Conference on Data Mining
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
Correlation search in graph databases
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Top-k subgraph matching query in a large graph
Proceedings of the ACM first Ph.D. workshop in CIKM
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
On incremental maintenance of 2-hop labeling of graphs
Proceedings of the 17th international conference on World Wide Web
Graphs-at-a-time: query language and access methods for graph databases
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Mining significant graph patterns by leap search
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Taming verification hardness: an efficient algorithm for testing subgraph isomorphism
Proceedings of the VLDB Endowment
Efficient query processing on graph databases
ACM Transactions on Database Systems (TODS)
GADDI: distance index based subgraph matching in biological networks
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
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
FOGGER: an algorithm for graph generator discovery
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Independent informative subgraph mining for graph information retrieval
Proceedings of the 18th ACM conference on Information and knowledge management
Distance-join: pattern match query in a large graph database
Proceedings of the VLDB Endowment
Summarization graph indexing: beyond frequent structure-based approach
DASFAA'08 Proceedings of the 13th international conference on Database systems for advanced applications
GBLENDER: towards blending visual query formulation and query processing in graph databases
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Towards proximity pattern mining in large graphs
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Connected substructure similarity search
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
An efficient features-based processing technique for supergraph queries
Proceedings of the Fourteenth International Database Engineering & Applications Symposium
PrefIndex: an efficient supergraph containment search technique
SSDBM'10 Proceedings of the 22nd international conference on Scientific and statistical database management
DSI: a method for indexing large graphs using distance set
WAIM'10 Proceedings of the 11th international conference on Web-age information management
Enhancing graph database indexing by suffix tree structure
PRIB'10 Proceedings of the 5th IAPR international conference on Pattern recognition in bioinformatics
On graph query optimization in large networks
Proceedings of the VLDB Endowment
iGraph: a framework for comparisons of disk-based graph indexing techniques
Proceedings of the VLDB Endowment
SAPPER: subgraph indexing and approximate matching in large graphs
Proceedings of the VLDB Endowment
Efficient algorithms for supergraph query processing on graph databases
Journal of Combinatorial Optimization
Efficient and accurate retrieval of business process models through indexing
OTM'10 Proceedings of the 2010 international conference on On the move to meaningful internet systems - Volume Part I
Efficient discovery of frequent subgraph patterns in uncertain graph databases
Proceedings of the 14th International Conference on Extending Database Technology
Computing subgraph isomorphic queries using structural unification and minimum graph structures
Proceedings of the 2011 ACM Symposium on Applied Computing
Structure and attribute index for approximate graph matching in large graphs
Information Systems
Neighborhood based fast graph search in large networks
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
iGraph in action: performance analysis of disk-based graph indexing techniques
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Towards efficient subgraph search in cloud computing environments
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications
Querying business process models based on semantics
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications: Part II
An edge-based framework for fast subgraph matching in a large graph
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
Aggregated search in graph databases: preliminary results
GbRPR'11 Proceedings of the 8th international conference on Graph-based representations in pattern recognition
Mining frequent closed graphs on evolving data streams
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
BR-index: an indexing structure for subgraph matching in very large dynamic graphs
SSDBM'11 Proceedings of the 23rd international conference on Scientific and statistical database management
A path-oriented RDF index for keyword search query processing
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part II
Fast graph query processing with a low-cost index
The VLDB Journal — The International Journal on Very Large Data Bases
Answering subgraph queries over large graphs
WAIM'11 Proceedings of the 12th international conference on Web-age information management
DELTA: indexing and querying multi-labeled graphs
Proceedings of the 20th ACM international conference on Information and knowledge management
CP-index: on the efficient indexing of large graphs
Proceedings of the 20th ACM international conference on Information and knowledge management
REX: explaining relationships between entity pairs
Proceedings of the VLDB Endowment
Knowledge hiding from tree and graph databases
Data & Knowledge Engineering
Answering pattern match queries in large graph databases via graph embedding
The VLDB Journal — The International Journal on Very Large Data Bases
NOVA: a novel and efficient framework for finding subgraph isomorphism mappings in large graphs
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part I
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
TreeSpan: efficiently computing similarity all-matching
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Finding top-k similar graphs in graph databases
Proceedings of the 15th International Conference on Extending Database Technology
Indexing and mining topological patterns for drug discovery
Proceedings of the 15th International Conference on Extending Database Technology
A relational-based approach for aggregated search in graph databases
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part I
K-reach: who is in your small world
Proceedings of the VLDB Endowment
ECTree: an extended tree index for attributed subgraph queries
Proceedings of the 16th International Database Engineering & Applications Sysmposium
Faster subgraph isomorphism detection by well-founded total order indexing
Pattern Recognition Letters
Efficient algorithms for generalized subgraph query processing
Proceedings of the 21st ACM international conference on Information and knowledge management
On efficient processing of BPMN-Q queries
Computers in Industry
Efficient querying of large process model repositories
Computers in Industry
Mining dense structures to uncover anomalous behaviour in financial network data
MSM'11 Proceedings of the 2011 international conference on Modeling and Mining Ubiquitous Social Media
An in-depth comparison of subgraph isomorphism algorithms in graph databases
Proceedings of the VLDB Endowment
Compressed feature-based filtering and verification approach for subgraph search
Proceedings of the 16th International Conference on Extending Database Technology
A similarity measure for approximate querying over RDF data
Proceedings of the Joint EDBT/ICDT 2013 Workshops
Lindex: a lattice-based index for graph databases
The VLDB Journal — The International Journal on Very Large Data Bases
A direct mining approach to efficient constrained graph pattern discovery
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Turboiso: towards ultrafast and robust subgraph isomorphism search in large graph databases
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Maximizing acceptance probability for active friending in online social networks
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Mining and indexing graphs for supergraph search
Proceedings of the VLDB Endowment
SQBC: An efficient subgraph matching method over large and dense graphs
Information Sciences: an International Journal
Querying business process model repositories
World Wide Web
Hi-index | 0.00 |
Graphs are prevalently used to model the relationships between objects in various domains. With the increasing usage of graph databases, it has become more and more demanding to efficiently process graph queries. Querying graph databases is costly since it involves subgraph isomorphism testing, which is an NP-complete problem. In recent years, some effective graph indexes have been proposed to first obtain a candidate answer set by filtering part of the false results and then perform verification on each candidate by checking subgraph isomorphism. Query performance is improved since the number of subgraph isomorphism tests is reduced. However, candidate verification is still inevitable, which can be expensive when the size of the candidate answer set is large. In this paper, we propose a novel indexing technique that constructs a nested inverted-index, called FG-index, based on the set of Frequent subGraphs (FGs). Given a graph query that is an FG in the database, FG-index returns the exact set of query answers without performing candidate verification. When the query is an infrequent graph, FG-index produces a candidate answer set which is close to the exact answer set. Since an infrequent graph means the graph occurs in only a small number of graphs in the database, the number of subgraph isomorphism tests is small. To ensure that the index fits into the main memory, we propose a new notion of δ-Tolerance Closed Frequent Graphs (δ-TCFGs), which allows us to flexibly tune the size of the index in a parameterized way. Our extensive experiments verify that query processing using FG-index is orders of magnitude more efficient than using the state-of-the-art graph index.