Data subset selection by Boolean calculation (Q1057787)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Data subset selection by Boolean calculation |
scientific article; zbMATH DE number 3898649
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Data subset selection by Boolean calculation |
scientific article; zbMATH DE number 3898649 |
Statements
Data subset selection by Boolean calculation (English)
0 references
1984
0 references
In ''The theory of TAXIR accessioner.'' ibid. 5, 327-340 (1969), the authors described an unconventional method, based on concepts from systematic biology, for storing and retrieving data, whose salient features are: (1) data are stored in such a manner that the space required for their storage is close to the information-theoretic minimum; and (2) the selection of data subsets for retrieval is effected by performing Boolean arithmetic directly on the stored data. Here we describe new algorithms to increase the power of data subset selection in the context of this method and describe their potential for parallel processing.
0 references
TAXIR
0 references
retrieval
0 references
Boolean arithmetic
0 references
algorithms
0 references
data subset selection
0 references
parallel processing
0 references