Patent ID: 6952696

Claim:
A data structure, comprising: a root level having a node group, the node group having k number of nodes, each of the k number of nodes sharing a pointer, each of the k number of nodes stored contiguously in memory; a second level having one supernode, the supernode having k number of node groups, each of the k number of node groups includes k nodes, the k nodes of the supernode being stored contiguously in memory; a first level memory storing the root level node group; and a second level memory storing the second level supernode, wherein the first level memory and the second level memory are configured to be accessed simultaneously, wherein the pointer references the contiguously stored k nodes of the supernode and each of the first level memory and the second level memory are associated with corresponding comparator blocks, the comparator blocks configured to examine hole counters representing the number of holes in the supernode.