| Document Date: 2015-02-18 01:45:02
Open Document File Size: 584,68 KBShare Result on Facebook
City Indianapolis / / Company Tokutek Inc. / Oracle / / Country United States / / Currency USD / / / Facility BUILDING AN ATOMIC KEY B-TREE / / IndustryTerm worstcase search cost / search performance / search bounds / static search tree / Then search / root-to-leaf search path / search trees / deletion algorithms / greedy algorithm / basic search / search procedure / worst-case search cost / construction algorithm / search cost / search probabilities / minimal expected search cost / file systems / search tree / basic search algorithm / cache-oblivious solution / expected search cost / search space / search algorithm / naive solution / expected search cost elements / search probabilities p1 / / OperatingSystem Microsoft Windows / / Organization National Science Foundation / MIT / Singapore-MIT Alliance / / Person Michael A. Bender / / Position representative / / ProvinceOrState Indiana / / Technology B-tree rebalancing algorithms / dynamicprogramming algorithm / RAM / search algorithm / LCA algorithms / greedy algorithm / same basic search algorithm / construction algorithm / deletion algorithms / /
SocialTag |
Performance Guarantees for B-trees with Different-Sized Atomic Keys∗ Michael A. Bender Dept. of Computer Science Stony Brook University