In this paper, we present an efficient data structure for storing large database to support incremental mining. Incremental algorithms are used to modify the results of earlier mining to derive the results for the incremented database. Various business databases are incremental in nature and knowledge is required from the updated database to infer some decisions and predictions. At times it is needed to ignore the previous knowledge obtained from the old database. Thus incremental algorithm

more »

... ld be able to manipulate the inferred rules when some part of the present database is deleted. To implement algorithms for incremental mining, first of all, an efficient data structure to store the data is needed. An easiest and most understandable way of storing the data is in the relational form. But in case of incremental implementation relational form of the data will incur high complexity. Varieties of tree based data structures are proposed by different researchers in [1] , [2] , [3 ] . In this paper we will present a novel tree based data structure for storing incremental database and its comparison with the existing ones.