On page 3 of Selected Papers on Computer Science, published by the Center for the Study of Language and Information (1996), Donald Knuth describes data structures as techniques of representing the relationships between discrete items of information. This description comes in the context of listing several important subfields of analysis of algorithms, the subfield of computer science that deals with the quantitative theory of program efficiency.