International Journal of Innovative Research in Computer Science and Technology
Year: 2013, Volume: 1, Issue: 1
First page : ( 6) Last page : ( 11)
Online ISSN : 2347-5552
Arun Pratap Srivastava , Prof.(Dr) Mohd. Hussain
Most of the itemset mining approaches are memory-like and run outside of the database. On the other hand, when we deal with data warehouse the size of tables is extremely huge for memory copy. In addition, using a pure SQL-like approach is quite inefficient. Actually, those implementations rarely take advantages of database programming. Furthermore, RDBMS vendors offer a lot of features for taking control and management of the data. We purpose a pattern growth mining approach by means of database programming for finding all frequent itemsets. The main idea is to avoid one-at-a-time record retrieval from the database, saving both the copying and process context switching, expensive joins, and table reconstruction. The empirical evaluation of our approach shows that runs competitively with the most known itemset mining implementations based on SQL. Our performance evaluation was made with SQL Server 2000 (v.8) and T-SQL, throughout several synthetical datasets.
Ph.D. Student, NIMS University, Jaipur, India, (e-mail: arun019@yahoo.com)
No. of Downloads: 13 | No. of Views: 4488
Manali Shukla, Ishika Goyal, Bhavya Gupta, Jhanvi Sharma.
July 2024 - Vol 12, Issue 4
Dipti Prajapati, Samishtarani Sabat, Sanika Bhilare, Rashmi Vishe, Prof. Suman Bhujbal.
March 2024 - Vol 12, Issue 2
Anu Sharma, Vivek Kumar.
May 2023 - Vol 11, Issue 3
