Prefix Tree with Encryption of Data and Itemsets
Ramkishore Bhattacharyya · Conference on Management of Data · 2006
The principal criterion of any mining algorithm is to welcome influx of huge data that poses a real challenge to space-time requirement. Unless data are arranged in a compact and efficient way, algorithms, with limited primary storage, fail to produce output within reasonable time. In this paper, we present an encryption technique for data leading to construction of a highly compact and storage efficient prefix tree with little overhead. In the representation, transactions with a common prefix can be arranged together, thereby increasing processing capability of mining algorithms. We also introduce a new data structure, Binary Search Prefix Tree (BSPT), for systematic management of encrypted itemsets. Experimental results show that incorporation of the new data structures makes an algorithm scalable to a large extent.