Please use this identifier to cite or link to this item:
|Title:||TP-index: a dynamic and efficient indexing mechanism for temporal databases|
|Authors:||Shen, Han |
Ooi, Beng Chin
|Source:||Shen, Han,Ooi, Beng Chin,Lu, Hongjun (1994). TP-index: a dynamic and efficient indexing mechanism for temporal databases. Proceedings - International Conference on Data Engineering : 274-281. ScholarBank@NUS Repository.|
|Abstract:||To support temporal operators efficiently, indexing based on temporal attributes must be supported. In this paper, we propose a dynamic and efficient index scheme called the time polygon (TP-index) for temporal databases. In the scheme, temporal data are mapped into a two-dimensional temporal space, where the data can be clustered based on time. The data space is then partitioned into time polygons where each polygon corresponds to a data page. The time polygon directory can be organized as a hierarchical index. The index handles long duration temporal data elegantly and efficiently. Our performance analysis indicates that the time polygon index is efficient both in storage utilization and query search.|
|Source Title:||Proceedings - International Conference on Data Engineering|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 23, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.