作者: Sharma Chakravarthy , Ramji Beera , Ramanathan Balachandran
DOI: 10.1007/978-3-540-24775-3_42
关键词:
摘要: In contrast to mining over transactional data, graph is done structured data represented in the form of a graph. Data having structural relationships lends itself mining. Subdue one early main memory algorithms that detects best substructure compresses using minimum description length principle. Database approach presented this paper overcomes problems – performance and scalability inherent algorithms. The focus development (specifically Subdue) SQL stored procedures Relational database environment. We have not only shown how class can be translated SQL-based algorithms, but also demonstrated achieved without sacrificing performance.