A benchmark calculation for retrieval by confluence of binary attributes in a random‐access computer

Glenn K. Manacher

American Documentation, 1969, vol. 20, issue 2, 168-169

Abstract: It is imagined that items are stored in a random‐access memory along with binary‐valued attributes. The problem of looking up all items having at least a particular subset of attributes is attacked by representing the attributes in a bit vector, then “or‐merging” bit vectors pairwise into a binary tree. The efficiency of this method increases with the size of the lookup subset. However, the increase is disappointingly slow, and the overall efficiency is about equal to that associated with a conventional inverted file.

Date: 1969
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/asi.4630200211

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:bla:amedoc:v:20:y:1969:i:2:p:168-169

Ordering information: This journal article can be ordered from
https://doi.org/10.1002/(ISSN)1936-6108

Access Statistics for this article

American Documentation is currently edited by Javed Mostafa

More articles in American Documentation from Wiley Blackwell
Bibliographic data for series maintained by Wiley Content Delivery ().