Attempts to implement temporal databases till now extend current theoretical concepts. But, the main problem in the implementation of temporal databases is the ever-growing storage requirement, which leads to a poor performance for practical usage. So conventional storage structure and access methods are not adequate to temporal databases. We poropose a storage structure and access methods for temporal databases. At first, we focus on the data duplication to minimize the storage requirement. So Temporally Sequenced Data Set concept is introduced. Secondly, in order to manage the ever-growing storage, the stored data are divided into three states such as archieve, hitory, and current states and we propose the adequate storage schemes corresponding to each state. Also, we design the storage structure and access methods based on the key hierarchy of temporal databases.