Dynamic non-dense indexes in relational databases

Indexes are a commonly used structure that provides fast access to the data. Their use imply storage and maintenance costs. This paper presents a technique to reduce index size, based on the elimination of tuple offsets in the classical B⁺ tree structure. It is shown that this technique gives advantages both in the tuple access and index maintenance.