A robust scheme for multilevel extendible hashing

Sven Helmer, Thomas Neumann, Guido Moerkotte

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

5 Scopus citations

Abstract

Dynamic hashing, while surpassing other access methods for uniformly distributed data, usually performs badly for non-uniformly distributed data. We propose a robust scheme for multi-level extendible hashing, allowing efficient processing of skewed data as well as uniformly distributed data. In order to test our access method, we implemented it and compared it to several existing hashing schemes. The results of the experimental evaluation demonstrate the superiority of our approach in both index size and performance.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsAdnan Yazici, Cevat Sener
PublisherSpringer Verlag
Pages220-227
Number of pages8
ISBN (Print)3540204091, 9783540397373
DOIs
StatePublished - 2003
Externally publishedYes

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2869
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint

Dive into the research topics of 'A robust scheme for multilevel extendible hashing'. Together they form a unique fingerprint.

Cite this