Fast string searching and indexing using a search tree having a

Data processing: database and file management or data structures – Database design – Data structure types

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

707 2, 707 6, 707 8, 707200, G06F 1730

Patent

active

060472839

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.

REFERENCES:
patent: 5613110 (1997-03-01), Stuart
patent: 5745902 (1998-04-01), Miller et al.
patent: 5778361 (1998-07-01), Nanjo et al.
patent: 5845274 (1998-12-01), Chadha et al.
patent: 5893086 (1999-04-01), Schmuck et al.
Honishi et al., "An Index Structure for Parallel Database Processing", IEEE online, pp. 224-225, Feb. 1992.
Jurgens et al., "The R/sub a/*-tree: An Improved R*-tree with materialized data for supporting Range Queries on OLAP-Data", IEEE online, pp. 186-191, Aug. 1998.
Dundas III J A: "Implementating Dynamic Minimal-Prefix Tries", Software Practice & Experience, vol. 21, No. 10, Oct. 1, 1991, pp. 1027-1040.
Corman, Thomas H., Leiserson, C.E., Rivest, R.L., Introduction to Algorithms, 1990, pp. 219-223, 226-229, 244-253, MIT Press, Cambridge, Mass.
Knuth, Donald E., The Art of Computer Programming, vol. 3, "Sorting and Searching", 1973, pp. 490-493, Addison-Wesley Pub. Co., Reading, Mass.
Van Wyk, Christopher J., Data Structures and C Programs, 1988, pp. 101-107,194-199, Addison-Wesley Pub. Co., Reading, Mass.

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

Fast string searching and indexing using a search tree having a does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Fast string searching and indexing using a search tree having a , we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast string searching and indexing using a search tree having a will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-374155

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