Filters








1,626 Hits in 3.7 sec

Cache-oblivious streaming B-trees

Michael A. Bender, Martin Farach-Colton, Jeremy T. Fineman, Yonatan R. Fogel, Bradley C. Kuszmaul, Jelani Nelson
2007 Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures - SPAA '07  
We present two cache-oblivious streaming B-trees, the shuttle tree, and the cache-oblivious lookahead array (COLA).  ...  A streaming B-tree is a dictionary that efficiently implements insertions and range queries.  ...  The B-tree, buffered-repository tree, and B ε -tree are not cache oblivious; they are parametrized by B. There already exist several cache-oblivious dictionaries.  ... 
doi:10.1145/1248377.1248393 dblp:conf/spaa/BenderFFFKN07 fatcat:axv5wsc54rcwfg7q75gggwssji

From Streaming B-Trees to Tokutek: How a Theoretician Learned to be VP of Engineering [chapter]

Michael A. Bender
2009 Lecture Notes in Computer Science  
Replacing B-trees with cache-oblivious streaming B-trees can remove some of these performance deficiencies.  ...  I present the cache-oblivious streaming B-tree, a high performance alternative to the traditional B-tree. Modern databases and file systems are based on B-trees.  ...  Replacing B-trees with cache-oblivious streaming B-trees can remove some of these performance deficiencies.  ... 
doi:10.1007/978-3-642-02011-7_2 fatcat:awjpjcwn4ffrdajfoccroapzdu

Funnel Heap-A Cache Oblivious Priority Queue [chapter]

Gerth Stølting Brodai, Rolf Fagerberg
2002 Lecture Notes in Computer Science  
Their structure uses cache oblivious sorting and selection as subroutines. In this paper, we devise an alternative optimal cache oblivious priority queue based only on binary merging.  ...  Arge et al. recently presented the first optimal cache oblivious priority queue, and demonstrated the importance of this result by providing the first cache oblivious algorithms for graph problems.  ...  Cache oblivious search trees which match the search cost of the standard (cache aware) B-trees [3] were presented in [4, 5, 6, 8] .  ... 
doi:10.1007/3-540-36136-7_20 fatcat:llhi64ahz5dx7fkxnyw5n3nkjq

Cache Oblivious Distribution Sweeping

Gerth Stølting Brodal, Rolf Fagerberg
2002 BRICS Report Series  
<p>We adapt the distribution sweeping method to the cache oblivious model.  ...  We demonstrate by a series of algorithms for specific problems the feasibility of the method in a cache oblivious setting.  ...  [7] , gave a proposal for cache oblivious search trees with search cost matching that of standard (cache aware) B-trees [5] .  ... 
doi:10.7146/brics.v9i18.21964 fatcat:ftr7saw3ajh6za5kb6faqsswh4

Cache Oblivious Distribution Sweeping [chapter]

Gerth Stølting Brodal, Rolf Fagerberg
2002 Lecture Notes in Computer Science  
We adapt the distribution sweeping method to the cache oblivious model.  ...  We demonstrate by a series of algorithms for specific problems the feasibility of the method in a cache oblivious setting.  ...  [7] , gave a proposal for cache oblivious search trees with search cost matching that of standard (cache aware) B-trees [5] .  ... 
doi:10.1007/3-540-45465-9_37 fatcat:wsgbza54a5a3dpjecatuyg5h4i

Engineering a cache-oblivious sorting algorithm

Gerth Stølting Brodal, Rolf Fagerberg, Kristoffer Vinther
2008 ACM Journal of Experimental Algorithmics  
and KRISTOFFER VINTHER Systematic Software Engineering A/S This paper is an algorithmic engineering study of cache-oblivious sorting.  ...  We investigate by empirical methods a number of implementation issues and parameter choices for the cache-oblivious sorting algorithm Lazy Funnelsort and compare the final algorithm with Quicksort, the  ...  Since then, quite a number of results for the model have appeared, including the following: Cache-oblivious dynamic search trees with search cost matching B-trees was given in Bender et al. [2000] .  ... 
doi:10.1145/1227161.1227164 fatcat:lsppepoiajf5dn4icisp23wmhe

A Cache Oblivious based GA Solution for Clustering Problem in IDS

R Vignesh, B Ganesh, G Aarthi, N Iyswarya
2010 International Journal of Computer Applications  
We propose the use of cache oblivious technique in our algorithm to provide efficient memory transfers.  ...  The complexity of this algorithm is O((N/B) log M/B N 1/3 /3 + N 1/ 3 ) which is very much lesser when compared to other sorting algorithms.  ...  Merge the sorted segments into the output stream using an N 1/3 -funnel. The K-funnel sorts these K lists using O((N/B)log (M/B) (N/B)) memory transfers.  ... 
doi:10.5120/235-389 fatcat:xguxiskwxjgfrlf43dmryxukka

Path Oblivious Heap: Optimal and Practical Oblivious Priority Queue

Elaine Shi
2020 2020 IEEE Symposium on Security and Privacy (SP)  
We propose Path Oblivious Heap, an extremely simple, practical, and optimal oblivious priority queue.  ...  Our construction also implies a practical and optimal oblivious sorting algorithm which we call Path Oblivious Sort.  ...  In Section V-B, we show how to leverage our Path Oblivious Heap algorithm to design an efficient oblivious streaming sampler, i.e., an algorithm that randomly samples k elements from an incoming stream  ... 
doi:10.1109/sp40000.2020.00037 dblp:conf/sp/Shi20 fatcat:iif2l2dzyrc5zcxjmv6smpxw4i

Path Oblivious Heap [article]

Elaine Shi
2019 IACR Cryptology ePrint Archive  
We propose Path Oblivious Heap, an extremely simple, practical, and optimal oblivious priority queue.  ...  Our construction also implies a practical and optimal oblivious sorting algorithm which we call Path Oblivious Sort.  ...  If we adopt our Circuit-variant in the above algorithm with the root bucket size set to |B root | = Θ(1/δ), then on a word-RAM with O(1) words of CPU cache, every item in the stream can be processed in  ... 
dblp:journals/iacr/Shi19 fatcat:p3ra5t5jyzbkdlfstl3ajlga2e

Cache-Oblivious Data Structures [chapter]

Lars Arge, Gerth Stølting Brodal, Rolf Fagerberg
2004 Handbook of Data Structures and Applications  
Cache-Oblivious kd-Tree Structure The cache-oblivious kd-tree is simply a normal kd-tree laid out in memory using the van Emde Boas layout.  ...  defining the √ N slabs, as well as a cache-oblivious B-tree for each of the N ) .  ... 
doi:10.1201/9781420035179.ch34 fatcat:mxgs5yde2bdvtppbfer3s5fbsi

Cache-Adaptive Algorithms [chapter]

Michael A. Bender, Roozbeh Ebrahimi, Jeremy T. Fineman, Golnaz Ghasemiesfeh, Rob Johnson, Samuel McCauley
2013 Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms  
We exhibit a cache-oblivious algorithm that is not cacheadaptive and a cache-adaptive algorithm for a problem having no optimal cache-oblivious solution.  ...  Moreover, Belady's algorithm remains optimal even when the cache size changes. Cache-obliviousness is distinct from cache-adaptivity.  ...  Each leaf has a sorted input stream, and the root has an output stream with capacity k d , where d ≥ 2 is a tuning parameter.  ... 
doi:10.1137/1.9781611973402.71 dblp:conf/soda/BenderEFGJM14 fatcat:4qu2tcwed5fu3mrkxpvhu7f6hq

Algorithms and Data Structures [chapter]

2009 Practical Guide to Computer Simulations  
Memory transfers occurring between consecutive levels of the memory hierarchy in modern computers are modeled in the I/O model and cache oblivious model, and the complexity of algorithms is given by the  ...  Finally, we show experimentally that for random queries perfectly balanced binary search trees can be outperformed by skewed binary search trees, i.e. trees for which at any given node there is a fixed  ...  The cache-oblivious selection algorithm from [16] performs O(N/B) I/Os and the cache-oblivious sorting algorithms [22, 52] perform O( N B log M B N B ) I/Os for M = Ω(B 2 ) .  ... 
doi:10.1142/9789812836632_0004 fatcat:5w2ix5xm35he7hv4oliyxcckzm

Algorithms and Data Structures [chapter]

2008 Robustness and Usability in Modern Design Flows  
Memory transfers occurring between consecutive levels of the memory hierarchy in modern computers are modeled in the I/O model and cache oblivious model, and the complexity of algorithms is given by the  ...  Finally, we show experimentally that for random queries perfectly balanced binary search trees can be outperformed by skewed binary search trees, i.e. trees for which at any given node there is a fixed  ...  The cache-oblivious selection algorithm from [16] performs O(N/B) I/Os and the cache-oblivious sorting algorithms [22, 52] perform O( N B log M B N B ) I/Os for M = Ω(B 2 ) .  ... 
doi:10.1007/978-1-4020-6536-1_3 fatcat:vksli6i5wjgfbfrg3ifeqxlkeu

Algorithms and data structures [chapter]

2015 Big Practical Guide to Computer Simulations  
Memory transfers occurring between consecutive levels of the memory hierarchy in modern computers are modeled in the I/O model and cache oblivious model, and the complexity of algorithms is given by the  ...  Finally, we show experimentally that for random queries perfectly balanced binary search trees can be outperformed by skewed binary search trees, i.e. trees for which at any given node there is a fixed  ...  The cache-oblivious selection algorithm from [16] performs O(N/B) I/Os and the cache-oblivious sorting algorithms [22, 52] perform O( N B log M B N B ) I/Os for M = Ω(B 2 ) .  ... 
doi:10.1142/9789814571784_0006 fatcat:i772srdlu5eq5eeoiqqytutg34

pLSM: A Highly Efficient LSM-Tree Index Supporting Real-Time Big Data Analysis

Jin Wang, Yong Zhang, Yang Gao, Chunxiao Xing
2013 2013 IEEE 37th Annual Computer Software and Applications Conference  
We designed a new plug-in system PuntStore with pLSM (Punt Log Structured Merge Tree) index engine. To improve read performance, Cache Oblivious Look-ahead Array (COLA) is adopted in our design.  ...  A widely used kind of Cache Oblivious Streaming B-Tree is Cache Oblivious Look-ahead Array (COLA).  ...  Cache Oblivious Streaming B-Tree is a dictionary that implements efficiently insertions and range queries [5] .  ... 
doi:10.1109/compsac.2013.40 dblp:conf/compsac/WangZGX13 fatcat:cebzjsca4nc6fpfnv37qsrelb4
« Previous Showing results 1 — 15 out of 1,626 results