Abstract
In the previous chapter we have discussed some well-known techniques used to support simple and complex files. It was quite clear that complex data structures, permitting a record to participate in a number of A-sets, can be implemented only by the extensive use of pointers. In this chapter we wish to examine the implementation techniques of such pointers, including advanced indexes at a depth adequate for an understanding of the efficiency-related issues of databases as discussed later in this book. With this end in view, we shall cover here the types of pointers, methods of organising them, and some advanced indexing techniques.
Preview
Unable to display preview. Download preview PDF.
References
Corner, D. (1979). The ubiquitous B-tree. ACM Computing Surveys, Vol. (11:2), June, p. 121
Date, C. J. (1985). Introduction to Database Systems, Vol. 1, 4th edition, Addison-Wesley (this discusses some advanced tuple placement techniques)
Deen, S. M. (1985). A tuple placement technique for databases. Computer Journal, Vol. (28:3), July
Knuth, D. E. (1973). The Art of Computer Programming, Vol. 3, Sorting and Searching, Addison-Wesley, section 6.2.4, pp. 471–9
Author information
Authors and Affiliations
Copyright information
© 1985 S. M. Deen
About this chapter
Cite this chapter
Deen, S.M. (1985). Pointers and Advanced Indexes. In: Principles and Practice of Database Systems. Macmillan Computer Science Series. Palgrave, London. https://doi.org/10.1007/978-1-349-17958-9_3
Download citation
DOI: https://doi.org/10.1007/978-1-349-17958-9_3
Publisher Name: Palgrave, London
Print ISBN: 978-0-333-37100-8
Online ISBN: 978-1-349-17958-9
eBook Packages: Computer ScienceComputer Science (R0)