Kurzbeschreibung
Hashing, a commonly used technique for arranging data to facilitate rapid searches, is discussed from several different perspectives as an efficient solution to the classical problem of information storage and retrieval. The underlying theme is close cooperation between the analysis of algorithms and the computer world. To increase the work's accessibility to computer scientists, algorithms are given both in English and in a variant of the well-known language Pascal. Designed to appeal to as wide an audience as possible, this book serves both as a graduate text in analysis of algorithms and as a professional reference for computer scientists and programmers.
Synopsis
The underlying theme in this book is close cooperation between analysis of algorithms and the computing world. The everyday issues arising from program design and optimization provide researchers with a wealth of interesting problems to analyze. Computer programmers, in turn, can use the results of the analysis to decide which algorithms to use in various situations. The book explores the coalesced hashing method, an efficient solution to the classic problem of information storage and retrieval. The first chapter provides a basic explanation of the algorithms and issues. Subsequent chapters investigate coalesced hashing from a variety of theoretical and practical points of view, offering a comprehensive and self-contained coverage of the method. Topics include analysis of the search time, tuning to achieve optimum performance, comparisons with other methods, lower bounds, deletion algorithms, and generalizations. The authors present their algorithms in English and in a variant of the well-known language Pascal.
Designed to appeal to as wide an audience as possible, this book serves both as a graduate text in analysis of algorithms and as a professional reference for computer scientists and programmers.
