Please use this identifier to cite or link to this item:
|Title:||The interval B-tree|
|Authors:||Ang, C.-H. |
|Source:||Ang, C.-H., Tan, K.-P. (1995-01-27). The interval B-tree. Information Processing Letters 53 (2) : 85-89. ScholarBank@NUS Repository. https://doi.org/10.1016/0020-0190(94)00176-Y|
|Abstract:||The time index  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(n2) 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(n2)). A new index structure is proposed using a B+-tree as the underlying structure. Its space complexity is reduced from O(n2) 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(n2) to O(log n + F) where F is the time used to report intersections. © 1995 Elsevier Science B.V. All rights reserved.|
|Source Title:||Information Processing Letters|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 13, 2018
WEB OF SCIENCETM
checked on Feb 19, 2018
checked on Feb 18, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.