Multidimensional Search Trees and Search Tries

Abstract

In Chapter 8, comparative-based search tree and digital-based radix search trie objects were introduced. All these structures were accessed on the basis of a single or primary key. That is, for a given set of data objects or records, each record contains a single element or attribute designated as the key upon which all insert, delete, and general query operations are based. All attributes of a record, aside from the designated key, are processed as data. In the present chapter, these concepts are extended to a treatment of search tree and search trie structures that provide for multi-key access.