Storage space is divided into pages which are numbered in a sequence. It is a basic unit for input-output operation. It has a header which stores all the information about the page. The space is divided in 8 pages. The rows are divided into a series of partitions of a user defined size. B-tree or any heap structure is used to store the row in each partition. The leaf node store the data and the data reachable from these are stored in other nodes.