Abstract

AbstractThe abstraction based algorithms read databases in sequential order and then construct abstraction of the database in memory. Given any database with n attributes, it is possible to read the same in n! ways. These different n! ways lead to abstractions of different sizes. In this paper, for a given a set of transactions D, we find the sequence or order of the attributes in which the database is read, a representation which is compact than PC-tree, can be obtained in the memory.KeywordsAttributesCompactHeadsLinksSequence

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call