Data structure used to represent a very large set.
Format of files stored as data rather than text.
Of an input or output stream, waiting until it has a large chunk of data before actually sending it.
Of a file, stored in a format that uses fewer bits. Compressing or uncompressing a file takes time but saves space on disk or transmission time over a network.
Sorting performed using files, for use when the data set is too large to fit in memory.
Any encoding, such as ASCII, in which each character is represented by the same number of bits.
Force a buffered stream to send data.
Of a B-tree node, having the largest allowable number of elements (one more than twice as many as in a minimal node).
Encoding in which more frequent characters are represented by shorter bit sequences.
Encoding in which each code may represent a long string of characters.
Join two minimal B-tree nodes, plus an element pulled down from the parent, into a full node.
Of a B-tree node, having the smallest allowable number of elements.
Sorted sequence of elements used in external sorting.
Process of storing a directed graph of objects in memory in a linear file on disk.
Of a B-tree node, one more than the number of elements in the node.
Divide a full B-tree node into two minimal nodes and one extra element, which is moved up into the parent.
Part I: Object-Oriented Programming
Part II: Linear Structures
Stacks and Queues
Part III: Algorithms
Analysis of Algorithms
Searching and Sorting
Part IV: Trees and Sets
Part V: Advanced Topics
Advanced Linear Structures
Out to the Disk
Part VI: Appendices
A. Review of Java
B. Unified Modeling Language
C. Summation Formulae
D. Further Reading