Segment indexes: dynamic indexing techniques for multi-dimensional interval data
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
The Time Index: An Access Structure for Temporal Data
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
The HV-tree: a memory hierarchy aware version index
Proceedings of the VLDB Endowment
Making updates disk-I/O friendly using SSDs
Proceedings of the VLDB Endowment
| Hi-index | 0.89 |
The time index [4] is an index structure built to speed up the access of data with valid times satisfying some given conditions. Unfortunately its space complexity is O(n^2) where n is the number of time intervals being stored. As a result, high disk I/O overhead is experienced in various operations such as the insertion and deletion of a time interval (O(n)) and the interval intersection operation (O(n^2)). A new index structure is proposed using a B^+-tree as the underlying structure. Its space complexity is reduced from O(n^2) to O(n). The time complexity of insertion and deletion of an interval is reduced from O(n) to O(log n), and that of interval intersection is reduced from O(n^2) to O(log n + F) where F is the time used to report intersections.