Hywire Ltd.

Hywire Ltb.

Moshe Hershkovich

Moshe Stark

Shay Kastoriano

Ronen Reznik

Nira Shezaf

Yoram Stern

Guy Itzkovsky

Eyal Shachrai

Mor Levi

A computer-implemented method of compressing data entries in a database, including the steps of: (a) inputting a plurality of uncompressed data entries; (b) dividing a particular uncompressed data entry, in a pre-determined manner, into at least two sections of significant bits, the two sections including both a common section and a differentiating section with respect to other the uncompressed data entries; (c) determining, by comparison of the particular data entry with a monotonically-adjacent entry, if a match exists in the common section; and (d) providing a particular compressed entry for the particular data entry, the compressed entry including compressed data corresponding to the particular data entry, wherein if, in step (c), the match exists in the common section, the compressed data includes at least a portion of the differentiating section of the particular data entry.

Method of database compression for database entries having a pre-determined common part

A computer-implemented method for flexibly storing data in a database so as to allow facile updating and maintenance of the database, including the steps of: (a) providing a first array having rows and columns for storing a first plurality of key entries; (b) arranging the key entries within each of the rows in a monotonic order; (c) providing a second array for storing a second plurality of key entries having rows and at least one column, such that the first and second arrays form a hierarchical structure, wherein the second plurality of entries represents a higher level of the hierarchical structure with respect to the first plurality of entries; (d) identifying an update position for performing a database update operation, and (e) performing the update operation by rearranging a portion of the first plurality of entries.

Database storage and maintenance using row index ordering

A computer-implemented method of searching an ordered database using transformed key entries including the steps of: (a) providing a system having: (i) a memory for storing a plurality of key entries, and (ii) processing logic for transforming said key entries into coded entries, and for searching the coded entries; (b) performing a pre-determined transformation of each key entry so as to obtain a plurality of coded entries, and (c) performing a deterministic search in at least one data structure within the memory to obtain a match between an input key and a key entry.

Search method using coded keys

An associative search engine (ASE) including: (a) a search engine manager (SEM), disposed within a chip, including: (i) processing logic; (b) an external memory system, disposed outside of the chip, including: (i) a plurality of memory storage units, each memory storage unit of the memory storage units having at least a first array for storing a plurality of key entries; (c) at least a second array for storing a plurality of associated data entries, the data entries being associated with the key entries, and (d) an interface for data interfacing between the external memory system and the SEM, wherein the processing logic is designed and configured to search within each of the memory storage units, in response to an input key, so as to determine if the input key matches a particular key entry, and wherein the key entries are stored in the memory storage units as logical two-dimensional arrays (TDAs) arranged for a search tree having a plurality of levels, so as to provide an increased rate of the data retrieval from the external memory system to the processing logic.

Multi-dimensional associative search engine having an external memory

A method and system for storing arranged data in a memory, the system including: (a) a plurality of random access memories, each random access memory (RAM) of the plurality including: (i) a first array of cells, the first array having at least two dimensions and having rows and columns, the first array designed and configured to contain a plurality of key entries, each of the cells having a unique address including a row index and a column index, each of the key entries for matching with an input key, and (b) a processor designed and configured to search the plurality of key entries for a match, in response to the input key, the plurality of RAMs designed and configured such that: (i) at least one row in a second of the RAMs has a row index that is identical to a row index in a first of the RAMs, and (ii) the key entries are arranged within each of the plurality of RAMs in monotonic order.

Growing community of inventors

Netanya, Israel

Moshe Hershkovich