Strategies for Static Tables

Strategies for Static Tables

Dean Kelley (Minnesota State University, Mankato, USA)
DOI: 10.4018/978-1-59904-887-1.ch011
OnDemand PDF Download:
$37.50

Abstract

This chapter presents three alternatives for structuring static tables—those tables in which the collection of keys remains unchanged and in which the FIND operation is optimized. Each alternative provides performance guarantees for the FIND operation which can help those who design and/or implement systems achieve performance guarantees of their own. The chapter provides clear and concise algorithms for construction and/or usage and simple guidelines for choosing among the strategies. It is intended that this presentation will help inform system design decisions. It is further intended that this chapter will assist implementation activities for systems which make use of static tables.

Complete Chapter List

Search this Book:
Reset