Please download the dossier by clicking on the dossier button x
×

DATA SEARCH AND STORAGE WITH HASH TABLE-BASED DATA STRUCTURES

  • US 20140337375A1
  • Filed: 12/11/2013
  • Published: 11/13/2014
  • Est. Priority Date: 05/07/2013
  • Status: Abandoned Application
First Claim
Patent Images

1. A method of searching a query key in a data storage, comprising:

  • (a) Accessing, by a computer, a binary tree comprising a plurality of nodes,wherein at least one of the nodes is a root node, each node has no more than two child nodes, a left child node and a right child node, and at least one node that is not the root node has both child nodes, andwherein each node comprises a hash table to store one or more keys, all of which are greater than all keys stored in the left child node, if any, thereof, and are smaller than all keys stored in the right child node, if any, thereof;

    (b) determining, starting at the root node, whether the query key is between the largest key and the smallest key stored in the node; and

    (c) if the query key is greater than the largest key in the node, (i) repeating steps (b) and (c) at the right child node thereof or (ii) terminating the search if no right child node exists, thereby determining that the query key does not exist in the binary tree,if the query key is smaller than the smallest key in the node, (i) repeating steps (b) and (c) at the left child node thereof or (ii) terminating the search if no left child node exists, thereby determining that the query key does not exist in the binary tree,if the query key is not greater than the largest key and not smaller than the smallest key in the node, searching the node to (i) find the query key or (ii) determine that the query does not exist in the binary tree if the query key is not found in the node.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×