Neocore, Inc.

Xpriori, LLC

Other

Neo-Lore

Christopher Lockton Brandin

Harry George Direen

Kevin Huck

Robert Lewis Moore

Linda Lee Grimaldi

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.

Method of performing a search of a numerical document object model

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

Method and system for generating a transform

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.

Method of storing and flattening a structured data document

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.

Method for forming a hashing code

The memory management system (,) includes a transform generator (,) capable of generating an address (,) and a confirmer (,) from a key. A controller (,) is connected to the transform generator (,) and sends the key to the transform generator (,) and receives the address (,) and the confirmer (,). A store (,) is connected to the controller (,) and has a plurality of addresses (,), each of the plurality of addresses (,) has a confirmer location (,), a forward pointer location (,), a primary flag (,), an allocated flag (,) and an association location (,).

Memory management system and method

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.

Method of performing a sliding window search

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.

Method and system of network packet accounting

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.

Method and apparatus for generating a transform

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).

Client server network and method of operation

Digital data storage methods and apparatus in which the addresses or records stored in a storage memory are themselves stored in corresponding entries in a catalog memory, each entry in the catalog memory also includes a confirmer derived from a key extracted from the corresponding record in the storage memory, and a limited number of the entries in the catalog memory are enchained with chainhead entries.

Growing community of inventors

Colorado Springs, CO, United States of America

Christopher Lockton Brandin