×

Compressed prefix matching database searching

  • US 6,014,659 A
  • Filed: 06/07/1995
  • Issued: 01/11/2000
  • Est. Priority Date: 07/12/1989
  • Status: Expired due to Term
First Claim
Patent Images

1. A method of conducting a search of reduced length through a stored database containing nodes and pointers leading from one of said nodes to another of said nodes in response to a search argument, said search argument defining a search path following pointers through said nodes, by eliminating an eliminated node that would otherwise occur between an immediately previous and an immediately following node in said search path, comprising the machine-implemented steps of:

  • storing information describing conditions under which, had said eliminated node been present, the search would have proceeded to said following node,following said search path through said nodes,when said search reaches said previous node,determining whether said search argument meets the conditions of said stored information, andcausing said search to effectively progress from said previous node directly to said following node if the comparison indicates that, had said eliminated node been present, said search would have proceeded to said following node.

View all claims
  • 13 Assignments
Timeline View
Assignment View
    ×
    ×