#van-emde-boas-layout
Wiki
›
Algorithms
›
01. Searching and Sorting
›
12. Specialized Search and Sorted-Order Procedures
›
Van Emde Boas Layout Search
Van Emde Boas Layout Search Van Emde Boas layout search stores a binary search tree in recursive memory order. The layout is cache oblivious, which means it does not need to know the cache line size or memory block size in advance. The main idea is to split the tree into a top subtree and several bottom subtrees, then store each part recursively. Nodes that are close in the search...