Engineering a Sorted List Data Structure for 32 Bit Key

Dementiev, Roman; Kettner, Lutz; Mehnert, Jens; Sanders, Peter; Arge, Lars; Italiano, Giuseppe F.; Sedgewick, Robert

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

会議論文

Engineering a Sorted List Data Structure for 32 Bit Key

MPS-Authors

/persons/resource/persons44293

Dementiev, Roman
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44766

Kettner, Lutz
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45022

Mehnert, Jens
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45344

Sanders, Peter
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

There are no locators available

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

Dementiev, R., Kettner, L., Mehnert, J., & Sanders, P. (2004). Engineering a Sorted List Data Structure for 32 Bit Key. In Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics (ALENEX-04) (pp. 142-151). Philadelphia, USA: SIAM.

引用: https://hdl.handle.net/11858/00-001M-0000-000F-2929-8

要旨

Search tree data structures like van Emde Boas trees are a theoretically attractive alternative to comparison based search trees because they have better asymptotic performance for small integer keys and large inputs. This paper studies their practicability using 32 bit keys as an example. While direct implementations of van Emde Boas trees cannot compete with good implementations of comparison based data structures, our tuned data structure significantly outperforms comparison based implementations for searching and shows at least comparable performance for insertion and deletion.