Search results for: George Mavritsakis
chapter
Lecture Notes in Computer Science > Algorithms and Computation > Algorithmic Problems in Wireless Ad Hoc Networks > 318-327
We present the interpolation search tree (ISB-tree), a new cache-aware indexing scheme that supports update operations (insertions and deletions) in O(1) worst-case (w.c.) block transfers and search operations in O(log B log n) expected block transfers, where B represents the disk block size and n denotes the number of stored elements. The expected search bound holds with high...
article
Journal of Discrete Algorithms > 2010 > 8 > 4 > 373-387
We present the interpolation search B-tree (ISB-tree), a new cache-aware indexing scheme that supports update operations (insertions and deletions) in O(1) worst-case block transfers and search operations in O(logBlogn) expected block transfers, where B represents the disk block size and n denotes the number of stored elements. The expected search bound holds with high probability for a large class...
