DocumentCode :
3805803
Title :
List Retrieval for Computer-Associative Analyzers
Author :
Branko Soucek
Author_Institution :
Brookhaven National Laboratory Upton, N. Y.
Volume :
13
Issue :
3
fYear :
1966
Firstpage :
571
Lastpage :
577
Abstract :
At the end of a high resolution measuring chain, data are stored in the computer-associative megachannel analyzer For sorting of data, two basically different techniques may be used: tree search or hash coding. Features of the two techniques are compared. A new technique - the standard analysis of parameter X and associative analysis of parameter Y - is presented. This procedure allows efficient use of a small computer as a hybrid analyzer. The memory contains three lists, called X, Y and count. X digits of a descriptor are used to directly address the X list, where the pointer to the associative Y list is found. Using this technique, more than 80% of the memory space can be devoted to the count list. The procedure is useful for spectra which present continuous "mountains" in the X-Y field.
Keywords :
"Information retrieval","Laboratories","Sorting","Data processing","Spectroscopy","Dispersion","Content addressable storage","Hardware","Instruments","Information analysis"
Journal_Title :
IEEE Transactions on Nuclear Science
Publisher :
ieee
ISSN :
0018-9499
Type :
jour
DOI :
10.1109/TNS.1966.4324143
Filename :
4324143
Link To Document :
بازگشت