nearly optimal n-ary search tree
As the scale and importance of data increases, so does the task of information retrieval. Currently, the best methodology for index based structures offers a near constant search cost by ensuring all data exists within the same number of IO operations. However research has shown that data, especiall...
| Published: |
|
|---|---|
| Online Access: | http://hdl.handle.net/2047/D20253673 |