Algorithms for approximate graph matching
Information Sciences—Informatics and Computer Science: An International Journal
An Algorithm for Subgraph Isomorphism
Journal of the ACM (JACM)
Holistic twig joins: optimal XML pattern matching
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Graph indexing: a frequent structure-based approach
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Substructure similarity search in graph databases
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Closure-Tree: An Index Structure for Graph Queries
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Searching Substructures with Superimposed Distance
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
A Binary Linear Programming Formulation of the Graph Edit Distance
IEEE Transactions on Pattern Analysis and Machine Intelligence
SAGA: a subgraph matching tool for biological graphs
Bioinformatics
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
Efficient query processing on graph databases
ACM Transactions on Database Systems (TODS)
TALE: A Tool for Approximate Large Graph Matching
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Comparing stars: on approximating graph edit distance
Proceedings of the VLDB Endowment
Connected substructure similarity search
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
SAPPER: subgraph indexing and approximate matching in large graphs
Proceedings of the VLDB Endowment
EGDIM: evolving graph database indexing method
Proceedings of the 6th International Conference on Ubiquitous Information Management and Communication
Fast exact graph matching using adjacency matrices
Proceedings of the The third workshop on Procedural Content Generation in Games
| Hi-index | 0.00 |
We present a tool called GiS for indexing and querying a large database of labeled, undirected graphs. Such graphs can model chemical compounds, represent contact maps constructed from 3D structure of proteins, and so forth. GiS supports exact subgraph matching and approximate graph matching queries. It adopts a suite of new techniques and algorithms for (a) fast construction of disk-based indexes with small index sizes, and (b) efficient query processing with high precision of matching. During the demo, the user can index real graph datasets using a recommendation facility in GiS, pose exact subgraph matching and approximate graph matching queries, and view matching graphs using the Jmol browser.