Efficient algorithms for answering queries with unsorted multilists

Three algorithms are given in this paper, each one increasing in complexity and efficiency, for parallel tracing of unsorted multilists. These algorithms avoid multiple record accessing for disjunctive queries, and they attempt to reduce the amount of seek action required to access all the records that satisfy a query. The algorithms are more efficient and no more complex than the general algorithm of Hsiao and Harary. The algorithms can enable, in some cases, the same querying efficiency obtainable with sorted multilists. Hence, efficiencies in on-line querying and updating are simultaneously accomplished.