sequential search

sequential search

[si′kwen·chəl ′sərch] (computer science) A procedure for searching a table that consists of starting at some table position (usually the beginning) and comparing the file-record key in hand with each table-record key, one at a time, until either a match is found or all sequential positions have been searched.

sequential search

A search for data that compares each item in a list or each record in a file, one after the other. Contrast with direct search and indexed search.