(data structure)
Definition: Lists that share items, but are structurally independent.
Aggregate parent (I am a part of or used in ...)
sparse matrix.
Aggregate child (... is a part of or used in me.)
list.
Note: The lists are interweaved through items. For instance, we may keep people on three orthogonal lists by hair color, gender, and country of residence or data values in a sparse matrix on two orthogonal lists by row and column. Inserting an item means inserting it into each list as appropriate.
Author: PEB
A lab exercise with four attributes. PowerPoint lecture notes of using orthogonal lists to implement a sparse matrix.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 3 November 2010.
HTML page formatted Mon Feb 2 13:10:40 2015.
Cite this as:
Paul E. Black, "orthogonal lists", in
Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 3 November 2010. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/orthogonalLists.html