Top-k subgraph matching query in a large graph
Proceedings of the ACM first Ph.D. workshop in CIKM
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
Graphs-at-a-time: query language and access methods for graph databases
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
G-hash: towards fast kernel-based similarity search in large graph databases
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
Top-K Correlation Sub-graph Search in Graph Databases
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
Large-scale malware indexing using function-call graphs
Proceedings of the 16th ACM conference on Computer and communications security
Comparing stars: on approximating graph edit distance
Proceedings of the VLDB Endowment
Distance-join: pattern match query in a large graph database
Proceedings of the VLDB Endowment
Continuously matching episode rules for predicting future events over event streams
APWeb/WAIM'07 Proceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management
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
Connected substructure similarity search
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
MARGIN: Maximal frequent subgraph mining
ACM Transactions on Knowledge Discovery from Data (TKDD)
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
TPCTC'10 Proceedings of the Second TPC technology conference on Performance evaluation, measurement and characterization of complex systems
Efficient discovery of frequent subgraph patterns in uncertain graph databases
Proceedings of the 14th International Conference on Extending Database Technology
A tool for fast indexing and querying of graphs
Proceedings of the 20th international conference companion on World wide web
On nonmetric similarity search problems in complex domains
ACM Computing Surveys (CSUR)
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
Graph indexing and retrieval based on median graphs
MCPR'10 Proceedings of the 2nd Mexican conference on Pattern recognition: Advances in pattern recognition
Towards efficient subgraph search in cloud computing environments
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications
On-line rule matching for event prediction
The VLDB Journal — The International Journal on Very Large Data Bases
A flexible graph pattern matching framework via indexing
SSDBM'11 Proceedings of the 23rd international conference on Scientific and statistical database management
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
K-nn queries in graph databases using M-trees
CAIP'11 Proceedings of the 14th international conference on Computer analysis of images and patterns - Volume Part I
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
Clone detection in repositories of business process models
BPM'11 Proceedings of the 9th international conference on Business process management
DELTA: indexing and querying multi-labeled graphs
Proceedings of the 20th ACM international conference on Information and knowledge management
Answering pattern match queries in large graph databases via graph embedding
The VLDB Journal — The International Journal on Very Large Data Bases
A method for querying conserved subnetwork in a large-scale biomolecular network
HPCA'09 Proceedings of the Second international conference on High Performance Computing and Applications
Querying large graph databases
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part II
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
Efficient subgraph similarity all-matching
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part I
Querying subgraph sets with g-tries
DBSocial '12 Proceedings of the 2nd ACM SIGMOD Workshop on Databases and Social Networks
Efficient subgraph similarity search on large probabilistic graph databases
Proceedings of the VLDB Endowment
ECTree: an extended tree index for attributed subgraph queries
Proceedings of the 16th International Database Engineering & Applications Sysmposium
Review of bisonet abstraction techniques
Bisociative Knowledge Discovery
Efficient algorithms for generalized subgraph query processing
Proceedings of the 21st ACM international conference on Information and knowledge management
Comparing and fusing terrain network information
SUM'12 Proceedings of the 6th international conference on Scalable Uncertainty Management
Efficient querying of large process model repositories
Computers in Industry
Top-k Similar Graph Matching Using TraM in Biological Networks
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
A comparison between structural and embedding methods for graph classification
SSPR'12/SPR'12 Proceedings of the 2012 Joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
Graph database retrieval based on metric-trees
SSPR'12/SPR'12 Proceedings of the 2012 Joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
Component retrieval based on a database of graphs for Hand-Written Electronic-Scheme Digitalisation
Expert Systems with Applications: An International Journal
Fast detection of exact clones in business process model repositories
Information Systems
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
Lindex: a lattice-based index for graph databases
The VLDB Journal — The International Journal on Very Large Data Bases
Graph similarity search with edit distance constraint in large graph databases
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Mining frequent correlated graphs with a new measure
Expert Systems with Applications: An International Journal
SQBC: An efficient subgraph matching method over large and dense graphs
Information Sciences: an International Journal
Efficient processing of graph similarity queries with edit distance constraints
The VLDB Journal — The International Journal on Very Large Data Bases
Querying business process model repositories
World Wide Web
Hi-index | 0.00 |
Graphs have become popular for modeling structured data. As a result, graph queries are becoming common and graph indexing has come to play an essential role in query processing. We introduce the concept of a graph closure, a generalized graph that represents a number of graphs. Our indexing technique, called Closure-tree, organizes graphs hierarchically where each node summarizes its descendants by a graph closure. Closure-tree can efficiently support both subgraph queries and similarity queries. Subgraph queries find graphs that contain a specific subgraph, whereas similarity queries find graphs that are similar to a query graph. For subgraph queries, we propose a technique called pseudo subgraph isomorphism which approximates subgraph isomorphism with high accuracy. For similarity queries, we measure graph similarity through edit distance using heuristic graph mapping methods. We implement two kinds of similarity queries: K-NN query and range query. Our experiments on chemical compounds and synthetic graphs show that for subgraph queries, Closuretree outperforms existing techniques by up to two orders of magnitude in terms of candidate answer set size and index size. For similarity queries, our experiments validate the quality and efficiency of the presented algorithms.