SINGS: Similarity Search in Large Graph Databases
| dc.contributor.author | WANG, Xiaoli | en_US |
| dc.contributor.author | DING, Xiaofeng | en_US |
| dc.contributor.author | TUNG, Anthony K.H. | en_US |
| dc.contributor.author | YING, Shanshan | en_US |
| dc.contributor.author | JIN, Hai | en_US |
| dc.date.accessioned | 2010-06-29T01:55:49Z | en_US |
| dc.date.accessioned | 2017-01-23T07:00:13Z | |
| dc.date.available | 2010-06-29T01:55:49Z | en_US |
| dc.date.available | 2017-01-23T07:00:13Z | |
| dc.date.issued | 2010-06-29T01:55:49Z | en_US |
| dc.description.abstract | Graphs are popular models for representing complex structured data and similarity search for graphs has become a fundamental research problem. Many techniques have been proposed to support similarity search on graphs based on the graph edit distance. However, they all suffer from certain drawbacks: high computational complexity, poor scalability in terms of the number of graphs and the size of the graph, or not taking full advantage of indexes. To address these problems, in this paper, we propose SINGS, an indexing and query processing framework for graph similarity search. An effective two-level index based on star structures is constructed and a novel search strategy based on the new indexing structure is also proposed. Two algorithms adapted from the TA and CA algorithms are seamlessly integrated into this proposed strategy for speeding up graph search. Extensive experiments are conducted on both real and synthetic datasets to evaluate the effectiveness and scalability of our approaches. | en_US |
| dc.format.extent | 519228 bytes | en_US |
| dc.format.mimetype | application/pdf | en_US |
| dc.identifier.uri | https://dl.comp.nus.edu.sg/xmlui/handle/1900.100/3234 | en_US |
| dc.language.iso | en | en_US |
| dc.relation.ispartofseries | TRA6/10 | en_US |
| dc.title | SINGS: Similarity Search in Large Graph Databases | en_US |
| dc.type | Technical Report | en_US |