作者: Sharma Chakravarthy , Subhesh Pradhan
DOI: 10.1007/978-3-540-85654-2_59
关键词:
摘要: Mining frequent subgraphs (FSG) is one form of graph mining for which only main memory algorithms exist currently. There are many applications in social networks, biology, computer chemistry and the World Wide Web that require subgraphs. The focus this paper to apply relational database techniques support subgraph mining. Some computations, such as duplicate elimination, canonical labeling, isomorphism checking not straightforward using SQL. contribution efficiently map complex computations operators. Unlike counter parts FSG, our approach addresses most general representation including multiple edges between any two vertices, bi-directional edges, cycles. Experimental evaluation proposed also presented paper.