An Implementation Scheme of Relational Tables

AbstractAbstractAbstract In this paper, an implementation scheme for relational tables is proposed. Our scheme employs extendible chunked arrays. We are proposing an implementation scheme for relational tables named HORT(History Offset implementation scheme for Relational Tables) which exhibits good performance in space and time costs compared with conventional implementation. However, the problems of HORT include that its history-offset space will overflow when a large scale relational table is stored. While a subarray of elements is dynamically allocated in the usual HORT, in our scheme proposed, a subarray of chunks is allocated in order to utilize the history-offset space efficiently, Here, a chunk means a hyper-cube shaped subset of a extendible array. Using a constructed prototype system, the space and time performances of the usual HORT and the proposed scheme will be measured and compared. Key words Relational Database, Extendible array, Chunk

• Type: Conference
• Year: 2005
• Where: ICDE
• Authors: Masayuki Kuroda, Naoki Amma, K. M. Azharul Hasan, Tatsuo Tsuji, Ken Higuchi
• Keywords: Database, Extendible Chunked Arrays, ICDE 2005, Implementation Scheme, Relational Table