LNCS 2748 Optimal Worst Case Operations for Implicit Cache Oblivious Search Trees 1st Edition by Gianni Franceschini, Roberto Grossi ISBN 3540450785 9783540450788

LNCS 2748 – Optimal Worst-Case Operations for Implicit Cache-Oblivious Search Trees 1st Edition by Gianni Franceschini, Roberto Grossi – Ebook PDF Instant Download/Delivery. 3540450785, 9783540450788

Full download LNCS 2748 – Optimal Worst-Case Operations for Implicit Cache-Oblivious Search Trees 1st Edition after payment

 

 

Product details:

ISBN 10: 3540450785

ISBN 13: 9783540450788

Author:  Gianni Franceschini, Roberto Grossi 

LNCS 2748 – Optimal Worst-Case Operations for Implicit Cache-Oblivious Search Trees 1st Edition: We close an open issue on dictionaries dating back to the sixthies. An array of n keys can be sorted so that searching takes O(log n) time. Alternatively, it can be organized as a heap so that inserting and deleting keys take O(log n) time. We show that these bounds can be simultaneously achieved in the worst case for searching and updating by suitably maintaining a permutation of the n keys in the array. The resulting data structure is called implicit as it uses just O(1) extra memory cells beside the n cells for the array. The data structure is also cache-oblivious, attaining O(log_B n) block transfers in the worst case for any (unknown) value of the block size B, without wasting any single cell of memory at any level of the memory hierarchy.

 

LNCS 2748 – Optimal Worst-Case Operations for Implicit Cache-Oblivious Search Trees 1st Edition Table of contents:

1 Introduction

2 Preliminary Algorithmic Tools

3 Districts of Chunks

4 Indirection with Dynamic Buckets

5 Synchronization between Layer D and Layer B

 

People also search for LNCS 2748 – Optimal Worst-Case Operations for Implicit Cache-Oblivious Search Trees 1st Edition:

best-case worst-case scenario planning
    
the optimal worst-case time-complexity for a comparison-based search is
    
the worst-case alternative is usually based on operations
    
best case worst case most likely
    
best case worst case algorithm