Fast string searching and indexing using a search tree having a plurality of linked nodes
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
Apr 4, 2000
Grant Date -
N/A
app pub date -
Feb 26, 1998
filing date -
Feb 26, 1998
priority date (Note) -
In Force
status (Latency Note)
Importance
Abstract
A fast string indexing method efficiently stores, searches, and removes alphanumeric or binary strings utilizing a compacted search tree. The number of levels in the search tree is minimized by having a node represent more than one character when possible. Each inner node of the tree contains a hash table array for successive hashing, which also minimizes the time required to traverse a given node. Searches may be performed for partial matches, such as wild cards at the character level. Multiple indices may be opened independently and concurrently on the same table of string entries.
First Claim
Family
International Classification(s)
Cited Art Landscape
Patent Citation Ranking
Recipient Email Address
Recipient Email Address
Comment
Recipient Email Address
Add to Portfolio(s)
To add this patent to one, or more, of your portfolios, simply click the add button.
This Patent is in these Portfolios:
Add to additional portfolios:
Last Refreshed On:
Changes done successfully