No CrossRef data available.
Published online by Cambridge University Press: 06 March 2019
Over the past fifteen years two basic computer search/match strategies have evolved. The exhaustive search approach of Johnson and Vand (1) uses a sequential file structure whereas Nichols (2) developed a strategy which uses an inverted file, examining only those patterns containing lines of interest. Frevel (3) was the first to attempt to relate the quality of the reference patterns to the search strategy using a very restricted data base. These “first generation” search/match algorithms were forced to use very wide d and I windows due to the poor quality of the unknown and reference patterns.
Snyder (4) wrote the first “second generation” search/match procedure which takes advantage of high quality of data in the JCPDS data base when it is present. Recently, a minicomputer optimized version of the Johnson-Vand strategy has been incorporated into this search system enabling a chance to compare these two strategies under similar conditions.