The most memory required will be for AVC-set for the root of the tree. To an acronym the AVC-set for the root node, we scan the database once and construct the AVC-list for each of the 50 attributes. The size of each AVC-list is 100 × C. The total size of the AVC-set is then 100 × C × 50, which will easily fit into the 512 MB of memory for a reasonable C. The computation of other AVC-sets is done in a similar way but they will be smaller because there will be less attributes available. To reduce the number of scans we can an acronym the AVC-set for nodes at the same level of the tree in parallel. With such small AVC-sets per node, we can probably fit the level in memory
đang được dịch, vui lòng đợi..
