Method and apparatus for comparing strings using hash values

Communications: electrical – Digital comparator systems

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

G06F 702

Patent

active

048991287

ABSTRACT:
To facilitate the comparison of strings in logic programming, a hash code is added to each string having a value that depends on the contents of the string. Typically, this hash code is made part of the header for the string along with a string identification number, a number specifying the length of the string and a bit specifying whether the string is a run time string or a compile time string.

REFERENCES:
patent: 4295124 (1981-10-01), Roybal
patent: 4558302 (1985-12-01), Welch
patent: 4575795 (1986-03-01), Boothroyd et al.
patent: 4651300 (1987-03-01), Suzuki et al.
patent: 4655620 (1987-04-01), Adams et al.
patent: 4671684 (1987-06-01), Kojima et al.
patent: 4672571 (1987-06-01), Bass et al.
patent: 4728925 (1988-03-01), Randle et al.
Amsbury, "Data Structures from Arrays to Priority Queues", pp. 48-49, 337-346, Wadsworth Publishing Company, 1985.
Clocksin et al., "Programming in Prolog", pp. 245-249, Springer--Verlag, 2nd Edition, 1984.
Shapiro, "A Subset of Concurrent Prolog and Its Interpreter", Technical Report TR-003, ICOT, Tokyo, 1983.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Method and apparatus for comparing strings using hash values does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method and apparatus for comparing strings using hash values, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for comparing strings using hash values will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-443878

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.