Performance Improvements to Adaptive Query System for Small Storage Cpus
Original Publication Date: 1986-Jul-01
Included in the Prior Art Database: 2005-Mar-09
A performance improvement to an adaptive query system for small or limited storage central processing units (CPUs) decreases the delay time (response time) to receive answers from users' questions. By combining and redefining steps which compare character strings, storage required is reduced by not using a matrix. The matrix is no longer needed when processing matching character locations directly. The heart of the adaptive query system is an algorithm for evaluating the similarity of two character strings. The algorithm is implemented in four steps: . Form a matrix by assigning a 1 to the location I:J, where the Ith character of the first string equals the Jth character of the second string. . If a row or a column contains more than one 1, then retain only the one closest to the main diagonal.