Font Size: a A A

Relational database algorithms and their optimization for graph mining

Posted on:2004-09-26Degree:M.S.C.S.EType:Thesis
University:The University of Texas at ArlingtonCandidate:Beera, RamjiFull Text:PDF
GTID:2468390011965329Subject:Computer Science
Abstract/Summary:
Data mining aims at discovering important and previously unknown patterns from the datasets. Database mining performs mining directly on data stored in Data Base Management Systems. Several SQL-based approaches for graph mining have been studied in the literature.; The main focus of this thesis is on the design and development of algorithms for graph mining (SUBDUE) using relational DBMS, We develop several approaches for discovering the repetitive substructures in a graph. Each approach is analyzed and optimized further to improve its performance. Two approaches, cursor-based and User Defined approaches are used in this thesis. The experiments evaluate these approaches and compare their performance with the main memory algorithm for graph based data mining (SUBDUE). The larger goal of this thesis is to achieve scalability.
Keywords/Search Tags:Mining, Data, Graph
Related items