Abstract
In this introductory section an informal outline of the major problems, solution concepts and evaluation criteria is given. Additionally, a number of terminological issues are discussed. The subsequent sections of this chapter contain refinement material on the main points addressed in this overview section.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Notes
The term persistent can be read as to be kept on mass storage in this context.
If the context is not ambigous, all strings are written without quotation marks in the sequel.
The term set implies that there are no two records with exactly the same values in all attributes.
Interestingly, in UNIX systems the corresponding system data structure is usually called “index node” or just inode for short
In practice, any assumptions about raw data distributions or query profiles are hard to state. It goes without saying that any use of ad-hoc query interfaces in addition to canned transactions increases these problems.
There are also proposals using the d most significant bits of y which is only feasible if a reasonable function u is found. Without any distribution function u, i.e., using the d most significant bits of the raw data values could yield problems if there are few records with high data values and many records with small data values. For the latter, the d most significant bits will be all zero even for relatively large d.
Finding a reasonable delete algorithm is more of a challenge
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Mueck, T.A., Polaschek, M.L. (1997). Data Structures and Indexing. In: Index Data Structures in Object-Oriented Databases. Advances in Database Systems, vol 7. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-6213-9_3
Download citation
DOI: https://doi.org/10.1007/978-1-4615-6213-9_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7849-5
Online ISBN: 978-1-4615-6213-9
eBook Packages: Springer Book Archive