Please use this identifier to cite or link to this item: https://doi.org/10.1016/0020-0190(94)00176-Y
DC FieldValue
dc.titleThe interval B-tree
dc.contributor.authorAng, C.-H.
dc.contributor.authorTan, K.-P.
dc.date.accessioned2014-10-27T06:04:07Z
dc.date.available2014-10-27T06:04:07Z
dc.date.issued1995-01-27
dc.identifier.citationAng, 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
dc.identifier.issn00200190
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/99435
dc.description.abstractThe 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(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.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1016/0020-0190(94)00176-Y
dc.sourceScopus
dc.subjectData structures
dc.subjectInformation retrieval
dc.typeArticle
dc.contributor.departmentINFORMATION SYSTEMS & COMPUTER SCIENCE
dc.description.doi10.1016/0020-0190(94)00176-Y
dc.description.sourcetitleInformation Processing Letters
dc.description.volume53
dc.description.issue2
dc.description.page85-89
dc.description.codenIFPLA
dc.identifier.isiutA1995QD06800004
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

35
checked on Jan 19, 2022

WEB OF SCIENCETM
Citations

22
checked on Jan 19, 2022

Page view(s)

110
checked on Jan 20, 2022

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.