Strategies for Static Tables

View Sample PDF

Author(s): Dean Kelley (Minnesota State University, Mankato, USA)
Copyright: 2009
Pages: 13
Source title: Handbook of Research on Modern Systems Analysis and Design Technologies and Applications
Source Author(s)/Editor(s): Mahbubur Rahman Syed (Minnesota State University Mankato, USA)and Sharifun Nessa Syed (Minnesota State University - Mankato, USA)
DOI: 10.4018/978-1-59904-887-1.ch011

Keywords: Computer Science & IT / Information Science Reference / Systems & Software Design / Systems and Software Engineering

Purchase

View Strategies for Static Tables on the publisher's website for pricing and purchasing information.

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.

The IRMA Community

Research IRM

Strategies for Static Tables

Purchase

Abstract

Related Content

IRMA Sponsors