System and method for text searching using an n-ary search tree

Boots – shoes – and leggings

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

36441913, 36441919, 364DIG1, 3642831, G06F 1540

Patent

active

054128072

ABSTRACT:
A system and method for searching a text file for the occurrence of user-selected text portions that satisfy user-specified conditions. The user-specified conditions are in the form of logical operator terms that interrelate user-selected word terms. The system uses a full text index describing the location of all word terms within a text file. The system accepts the user-selected word terms and the user-specified conditions and constructs an n-ary search tree where terminal nodes represent the user-selected text portions and the non-terminal nodes represent logical operator terms that interrelate the word terms. The system uses the full text index to construct index lists for each of the word terms and has an index pointer for each of the index lists. A Boolean evaluator analyzes each of the non-terminal nodes to determine if word terms represented by adjacent terminal nodes satisfies the logical operation term represented by the non-terminal nodes. The system determines which of the index pointers will be incremented by analyzing the location within the text file of the current occurrences of the words represented by terminal nodes and the next occurrences within the text file of the words represented by terminal nodes. Positive results of the non-terminal node analysis are temporarily saved and passed up the tree to the adjacent non-terminal node. When analysis of a non-terminal node is complete, the system will discard any index lists that have already been used in the completed non-terminal node analysis. The system and method require only a single pass through the full text index and do not require the use of intermediate files as are typical of a binary search tree. The system is easily implemented on a microcomputer with limited memory.

REFERENCES:
patent: 4468728 (1984-08-01), Wang
patent: 4611298 (1986-09-01), Schuldt
patent: 5175814 (1992-12-01), Anick et al.
patent: 5201048 (1993-04-01), Coulter et al.
patent: 5257365 (1993-10-01), Powers et al.
Cormen, T., "Intro to Algorithms", 1990 pp. 384-388.

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

System and method for text searching using an n-ary search tree does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with System and method for text searching using an n-ary search tree, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for text searching using an n-ary search tree will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-1145268

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