Patentable/Patents/US-6012057
US-6012057

High speed data searching for information in a computer system

PublishedJanuary 4, 2000
Assigneenot available in USPTO data we have
Inventorsnot available in USPTO data we have
Technical Abstract

Patent Claims
16 claims

Legal claims defining the scope of protection, as filed with the USPTO.

1

1. A method of searching information in a computer system comprising the steps of: identifying a parent string and a child string from data input, and a first value that represents the number of initial characters that said parent string and said child string have in common; comparing a subsequent string with said parent string to generate a second value that represents the number of initial characters that said parent and said subsequent string have in common; examining said first and second values to identify the extent of the comparison between said subsequent string and said child string; identifying a next string for comparison with said subsequent string when said first value is not equal to said second value; selecting a grandchild string using a first branch of a dictionary tree associated with said child string when said first value is greater than said second value.

2

2. A method of searching information in a computer system comprising the steps of: identifying a parent string and a child string from data input, and a first value that represents the number of initial characters that said parent string and said child string have in common; comparing a subsequent string with said parent string to generate a second value that represents the number of initial characters that said parent and said subsequent string have in common; examining said first and second values to identify the extent of the comparison between said subsequent string and said child string; identifying a next string for comparison with said subsequent string when said first value is not equal to said second value; selecting a grandchild string using a second branch of a dictionary tree associated with said child string when said first value is less than said second value.

3

3. The method of claim 1 wherein a pointer to said child string in said data input is stored in an entry of an array accessible using the position of said parent string in said data input.

4

4. An article of manufacture comprising: a computer usable medium having computer readable program code embodied therein for searching information in a computer system comprising: computer readable program code configured to cause a computer to identify a parent string and a child string from data input, and a first value that represents the number of initial characters that said parent string and said child string have in common; computer readable program code configured to cause a computer to compare a subsequent string with said parent string to generate a second value that represents the number of initial characters that said parent and said subsequent string have in common; computer readable program code configured to cause a computer to examine said first and second values to identify the extent of the comparison between said subsequent string and said child string; computer readable program code configured to cause a computer to identify a next string for comparison with said subsequent string when said first value is not equal to said second value; computer readable program code configured to cause a computer to select a grandchild string using a first branch of a dictionary tree when said first value is greater than said second value.

5

5. An article of manufacture comprising: a computer usable medium having computer readable program code embodied therein for searching information in a computer system comprising: computer readable program code configured to cause a computer to identify a parent string and a child string from data input, and a first value that represents the number of initial characters that said parent string and said child string have in common; computer readable program code configured to cause a computer to compare a subsequent string with said parent string to generate a second value that represents the number of initial characters that said parent and said subsequent string have in common; computer readable program code configured to cause a computer to examine said first and second values to identify the extent of the comparison between said subsequent string and said child string; computer readable program code configured to cause a computer to identify a next string for comparison with said subsequent string when said first value is not equal to said second value; computer readable program code configured to cause a computer to select a grandchild string using a second branch of said dictionary tree when said first value is less than said second value.

6

6. The article of manufacture of claim 4 wherein a pointer to said child string in said data input is stored in an entry of an array accessible using the position of said parent string in said data input.

7

7. A method of searching information in a computer system comprising the steps of: creating a first array of pointers to strings contained in an input buffer; creating a second array of pointers to strings that include a high occurrence sequence; said step comprising the steps of: determining whether a first sequence of bits of one of said strings matches said high occurrence sequence; accessing an entry in said second array using a second sequence of bits of said one of said strings; determining whether a pointer exists in said entry of said second array; and storing in said entry a pointer to said one of said strings, if a pointer does not exist in said entry; accessing said first array of pointers to identify a previous string, if a current string does not contain said high occurrence sequence; accessing said second array of pointers to identify said previous string, if said current string does contain said high occurrence sequence; comparing said previous string and said current string to determine whether a match exists; and generating a compressed representation that includes a pointer to said previous string, if a match does exist.

8

8. The method of claim 7 further comprising the steps of: identifying another previous string; comparing said another previous string and said current string to determine the number of initial characters in said another previous string and said current string that match.

9

9. The method of claim 8 wherein said step of identifying further comprises the steps of: creating a lower array, an entry in said lower array is capable of storing a pointer to a lower-value string, said lower-value string being lower in value than said previous string; creating a higher array, an entry in said higher array is capable of storing a pointer to a higher-value string, said higher-value string being higher in value than said previous string; retrieving said another previous string using said pointer to said higher-value string in said higher array, if said current string is higher in value than said previous string; and retrieving said another previous string using said pointer to said lower-value string in said lower array, if said current string is lower in value than said previous string.

10

10. The method of claim 9 wherein said entry in said lower array and said entry in said higher array include a count, said count in said lower array entry identifying the number of initial bits in common between said previous string and said lower-value string and said count in said higher array entry identifying the number of initial bits in common between said previous string and said higher-value string.

11

11. An article of manufacturing comprising: a computer usable medium having computer readable program code embodied therein for searching information comprising: computer readable program code configured to cause a computer to create a first array of pointers to strings contained in an input buffer; computer readable program code configured to cause a computer to create a second array of pointers to strings that include a high occurrence sequence; computer readable program code configured to cause a computer to access said first array of pointers to identify a previous string, if a current string does not contain said high occurrence sequence; computer readable program code configured to cause a computer to access said second array of pointers to identify said previous string, if said current string does contain said high occurrence sequence; computer readable program code configured to cause a computer to compare said previous string and said current string to determine whether a match exists; computer readable program code configured to cause a computer to generate a compressed representation that includes a pointer to said previous string, if a match does exist; computer readable program code configured to cause a computer to determine whether a first sequence of bits of said current string matches said high occurrence sequence; computer readable program code configured to cause a computer to access an entry in said second array using a second sequence of bits of said current string; and computer readable program code configured to cause a computer to retrieve from said entry a pointer to said previous string.

12

12. An article of manufacturing comprising: a computer usable medium having computer readable program code embodied therein for searching information comprising: computer readable program code configured to cause a computer to create a first array of pointers to strings contained in an input buffer; computer readable program code configured to cause a computer to create a second array of pointers to strings that include a high occurrence sequence; computer readable program code configured to cause a computer to access said first array of pointers to identify a previous string, if a current string does not contain said high occurrence sequence; computer readable program code configured to cause a computer to access said second array of pointers to identify said previous string, if said current string does contain said high occurrence sequence; computer readable program code configured to cause a computer to compare said previous string and said current string to determine whether a match exists; computer readable program code configured to cause a computer to generate a compressed representation that includes a pointer to said previous string, if a match does exist; computer readable program code configured to cause a computer to identify another previous string; and computer readable program code configured to cause a computer to compare said another previous string and said current string to determine the number of initial characters in said another previous string and said current string.

13

13. The article of manufacture of claim 12 wherein said computer readable program code configured to cause a computer to identify further comprises: computer readable program code configured to cause a computer to create a lower array, an entry in said lower array is capable of storing a pointer to a lower-value string, said lower-value string being lower in value than said previous string; computer readable program code configured to cause a computer to create a higher array, an entry in said higher array is capable of storing a pointer to a higher-value string, said higher-value string being higher in value than said previous string; computer readable program code configured to cause a computer to retrieve said another previous string using said pointer to said higher-value string in said higher array, if said current string is higher in value than said previous string; and computer readable program code configured to cause a computer to retrieve said another previous string using said pointer to said lower-value string in said lower array, if said current string is lower in value than said previous string.

14

14. The article of manufacture of claim 13 wherein said entry in said lower array and said entry in said higher array includes a count, said count in said lower array entry identifying the number of initial bits in common between said previous string and said lower-value string and said count in said higher array entry identifying the number of initial bits in common between said previous string and said higher-value string.

15

15. The article of manufacture of claim 12 wherein said computer readable program code configured to cause a computer to compare further comprises computer readable program code configured to cause a computer to compare the bits in said current string and said another previous string excluding the bits represented by said count.

16

16. An article of manufacturing comprising: a computer usable medium having computer readable program code embodied therein for searching information comprising: computer readable program code configured to cause a computer to create a first array of pointers to strings contained in an input buffer; computer readable program code configured to cause a computer to create a second array of pointers to strings that include a high occurrence sequence; computer readable program code configured to cause a computer to access said first array of pointers to identify a previous string, if a current string does not contain said high occurrence sequence; computer readable program code configured to cause a computer to access said second array of pointers to identify said previous string, if said current string does contain said high occurrence sequence; computer readable program code configured to cause a computer to compare said previous string and said current string to determine whether a match exists; and computer readable program code configured to cause a computer to generate a compressed representation that includes a pointer to said previous string, if a match does exist, wherein said compressed representation includes a header field, said header field having a variable length and identifying the type for an associated content field.

Detailed Description

Complete technical specification and implementation details from the patent document.

DETAILED DESCRIPTION OF THE INVENTION

Classification Codes (CPC)

Cooperative Patent Classification codes for this invention. Click any code to explore related patents in that topic.

Patent Metadata

Filing Date

Unknown

Publication Date

January 4, 2000

Want to explore more patents?

Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.

Citation & reuse

Analysis on this page is generated by Patentable — an AI-powered patent intelligence platform. AI-generated summaries, explanations, and analysis may be reused with attribution and a visible link back to the canonical URL below. Patent abstracts and claims are USPTO public domain.

Cite as: Patentable. “High speed data searching for information in a computer system” (US-6012057). https://patentable.app/patents/US-6012057

© 2026 Patentable. All rights reserved.

Patentable is a research and drafting-assistant tool, not a law firm, and does not provide legal advice. Documents we generate are drafts for review by a licensed patent attorney.