Publication Type:

Journal Article

Source:

International Journal of Applied Engineering Research, Research India Publications, Volume 10, Number 55, p.2146-2149 (2015)

URL:

http://www.scopus.com/inward/record.url?eid=2-s2.0-84942465940&partnerID=40&md5=e28de1667ac049b1801e9163a5ea7a94

Abstract:

In data mining, Association rule mining performs a major role. It’s for finding the relationship between items in a transactional database. By finding such rules, the business industries can make decisions on customer behaviour, cross marketing, discount scheduling, cataloguing of items, layout of the store, etc. This task involves two sub processes: Frequent Itemsets Generation and Generation of Association Rules. The frequent itemsets generation is a time consuming one as it requires full scan of database many times for finding the support of candidate itemsets generated for each transaction. Here in this paper, we are comparing the two data structures – hash tree and hash group bitmap index. © Research India Publications.

Notes:

cited By 0

Cite this Research Publication

T. J. Amitha Elizabeth, Lakshmi, V., and Ranjidha, R., “Comparative study of hash tree and hash group bitmap index”, International Journal of Applied Engineering Research, vol. 10, pp. 2146-2149, 2015.