Abstract: A hierarchical structured data document system having a duplicated tree structure includes a map store (350, 352). A map index (354) has a map pointer pointing to a location in the map store in one of the map index's locations. A duplicate array (364) contains a second map pointer. The map index (354) has an array pointer that points to the duplicate array. The duplicate array stores map pointers pointing to duplicates of tags or data stored in the map store.

Abstract: A system (10) for generating a transform includes a first transform lookup table (12) and second transform lookup table (28). A transform exclusive OR array (26) is connected to an output (24) of the first transform lookup table (12) and an output (32) of the second transform lookup table (28). The system (10) allows transforms (polynomial codes, CRCs) to be generated using two or more tables.

Abstract: A method of performing set operations on ordered sets includes the steps of receiving a first ordered set and a second ordered set. A set operation request between the first ordered set and the second ordered set is received. A modified binary search is performed between the first ordered set and the second ordered set to find an intersection set.

Abstract: A method of forming a hashing code includes the steps of: first selecting a first linear feedback transform generator that is perfect over a first range. A maximum key length is determined next. When the maximum key length is greater than the first range for a transform, it is determined if a no collisions allowed condition exists. When the no collisions allowed condition exists, it is determined if the maximum key length is less than double the first range. When the maximum key length is less than double the first range, a first transform for a first part of a key is determined. A second transform for the key is then calculated. Next, a first-second combined transform is formed by concatenating the first transform and the second transform, wherein a first portion of the first-second combined transform is an address and a second portion of the first-second combined transform is a confirmer.

Abstract: A system (10) for generating a transform includes a first transform lookup table (12) and second transform lookup table (28). A transform exclusive OR array (26) is connected to an output (24) of the first transform lookup table (12) and an output (32) of the second transform lookup table (28). The system (10) allows transforms (polynomial codes, CRCs) to be generated using two or more tables.

Abstract: A search engine system (110) includes an associative memory (112). A first search engine (114) is connected to the associative memory (112) and has first data input (116). A second search engine (118) is connected to the associative memory (112) and has a second data input (120). The search engine system may include a proximity search engine connected to the first search engine.

Abstract: A hierarchical structured data document system having a duplicated tree structure includes a map store (350, 352). A map index (354) has a map pointer pointing to a location in the map store in one of the map index's locations. A duplicate array (364) contains a second map pointer. The map index (354) has an array pointer that points to the duplicate array. The duplicate array stores map pointers pointing to duplicates of tags or data stored in the map store.