Abstract
Inverted lists and tree structures are compared in terms of their efficiency as indexes for document retrieval. The relative efficiency of search is shown to depend on the structure of the information file, the form of queries posed to it and the interaction between them. Formulas are developed for computing the amount of search required in each case and examples are provided.
| Original language | English |
|---|---|
| Pages (from-to) | 87-108 |
| Number of pages | 22 |
| Journal | INFOR |
| Volume | 12 |
| Issue number | 1 |
| DOIs | |
| State | Published - 1974 |