Abstract: A method of performing a search of a numerical DOM (document object model), includes the steps of receiving a query. When the query is a fully qualified query, the target string is transformed to form a fully qualified hashing code. An associative lookup is performed in a map index using the fully qualified hashing code. A map offset is returned. The map offset points to a couplet that can be converted into a standard portion of a structured data document. Finally, a data couplet is returned.

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 flattening a structured data document includes the steps of receiving a structured data document. Next, a first data entry is searched for by the system. When the first data entry is found, it is determining if an attribute is defined before the first data entry. When the attribute is defined before the first data entry, a first line containing all open tags before the attribute and the attribute is created. A record indicator is stored on the first line.

Abstract: A control method for an extensible markup language file, includes the step of receiving a query from a user (702). Next, an control rule associated with the user is determined (704). A query search on the extensible markup language file is performed (706). A query search result is stored (708). An access search on the extensible markup language file is performed (710). A control search result is stored (712). Finally, the query search result and the control search result are compared to determine an allowed search result (714).

Abstract: A universal information base system has an associative information system. A structured data input system is coupled to the associative information system. A search and behavioral operations engine is coupled to the associative information system.

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 for handling a structured data document in a extensible markup language database comprises a document flattener receiving the structured data document and forming a flattened document; a transform generator connected to a parser, the transform generator creating a data transform for each of a plurality of data entries and creating a tag string transform for a plurality of associated tags; a map store connected to the transform generator and having a plurality of cells each containing a pointer to an index; and an associative map index having a plurality of map addresses, each of the plurality of addresses having a pointer to the map store.

Abstract: A method of performing a search of a numerical DOM (document object model), includes the steps of receiving a query. When the query is a fully qualified query, the target string is transformed to form a fully qualified hashing code. An associative lookup is performed in a map index using the fully qualified hashing code. A map offset is returned. The map offset points to a couplet that can be converted into a standard portion of a structured data document. Finally, a data couplet is returned.

Abstract: A method of storing a structured data document includes the step of first flattening the structured data document to provide a plurality of tags, a data entry and a plurality of format characters in a single line. The plurality of tags, the data entry and the plurality of format characters are stored. Flattening the document generally significantly reduces the number of lines used to describe the document. In addition, a dictionary is created for the tags and the data entries. A map store only stores pointers to the tags and the data entries.

Abstract: A method of storing a flattened structured data document, includes the steps of receiving the flattened structured data document. The flattened structured data document has a number of lines, each of the lines has a tag, a data entry and a format character. The tag is stored in a dictionary store. The data entry is stored in a dictionary store. The format character, a tag dictionary offset and a data dictionary offset are stored in a 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 flattening a structured data document includes the steps of receiving a structured data document. Next, a first data entry is searched for by the system. When the first data entry is found, it is determining if an attribute is defined before the first data entry. When the attribute is defined before the first data entry, a first line containing all open tags before the attribute and the attribute is created. A record indicator is stored on the first line.

Abstract: A system (330) for implementing behavioral operations includes a search engine (332) connected to an input data. An associative match memory (334) is connected to the search engine (332). A behavioral operation unit (336) is connected to the associative match memory.

Abstract: A system (270) for associative processing has an icon generator (272) (transform generator; polynomial code generator). An associative memory controller (276) is connected to the icon generator (272). An associative processing unit (280) is connected to the associative memory controller (276). A memory (278) is connected to the associative memory controller (276). This system (270) can be configured to perform the sliding search routine described in FIGS. 1-6, or as a CAM (content address memory) or as an extensible markup language database system or as virus scanner or a packet accounting system or a variety of other functions.

Abstract: The memory management system (20) includes a transform generator (22) capable of generating an address (28) and a confirmer (30) from a key. A controller (24) is connected to the transform generator (22) and sends the key to the transform generator (22) and receives the address (28) and the confirmer (30). A store (26) is connected to the controller (24) and has a plurality of addresses (28), each of the plurality of addresses (28) has a confirmer location (30), a forward pointer location (34), a primary flag (36), an allocated flag (38) and an association location (32).

Abstract: The memory management system (20) includes a transform generator (22) capable of generating an address (28) and a confirmer (30) from a key. A controller (24) is connected to the transform generator (22) and sends the key to the transform generator (22) and receives the address (28) and the confirmer (30). A store (26) is connected to the controller (24) and has a plurality of addresses (28), each of the plurality of addresses (28) has a confirmer location (30), a forward pointer location (34), a primary flag (36), an allocated flag (38) and an association location (32).

Abstract: A method of performing a sliding window search includes the steps of: (a) creating an associative database of a plurality of data strings; (b) receiving a first window of a data block; (c) iconizing the first window of the data block to form a first icon; (d) determining if the first icon has a match in the associative database; (e) determining a first byte icon of a first byte of data in the first window; (f) executing an icon shift function to form a shifted first byte icon; (g) exclusive ORing the shifted first byte icon with the first icon to form a seed icon; (h) determining a second icon for a second window using the seed icon and transforming a new byte of data onto the seed icon; and (i) determining if the second icon has a match in the associative database.

Abstract: A system (50) for network packet accounting includes a network interface card (52) connected to a network connection and detecting a packet. A processor (56) is connected to the network interface card (52) and extracts a network address from the packet. A transform generator (58) is connected to the processor (56) and determines an icon for the network address. An index (60) is connected to the processor (56) and relates the icon to a store location. A store (62) is connected to the processor (56) and holds a plurality of parameters related to a group at the store location.

Abstract: A transform generator (20) has an input/output port (22). Coupled to the input/output port (22) is a controller (24). The input/output port (22) receives input transforms and data strings and outputs new transforms. A look up memory (26) is coupled to the controller (24) and is used to determine the new transforms. A shift module (28) and a combiner (30) are also coupled to the controller (24) and are used in combination with the memory (26) to determine a new transform.

Abstract: A client server network (10) has a number of clients (12, 14,16), each having a client transform generator (18, 20, 22). The clients (12, 14,16) transmit a number of messages each of which contains an address (38, 54) and a confirmer (40, 56). The clients (12, 14, 16) are all connected to a communication network (24, 26) that carries the messages. A server (28) has a server transform generator (44) and is coupled to the communication network (24, 26). The server (28) receives the messages containing the address (38, 54) and the confirmer (40, 56).