5,337
edits
Parallel Algorithms: Difference between revisions
→2-3 trees; Technique: Pipelining
| Line 221: | Line 221: | ||
==2-3 trees; Technique: Pipelining== | ==2-3 trees; Technique: Pipelining== | ||
Dictionary: Search, insert, delete<br> | |||
Problem: How to parallelize to handle batches of queries<br> | |||
===2-3 tree=== | |||
A 2-3 tree is a rooted tree which has the properties: | |||
* Each node has 2-3 ordered children | |||
* For any internal node, every directed path to a leaf is the same length | |||
==Resources== | ==Resources== | ||