Abstract: 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.

Abstract: 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 retrieva

Abstract: 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.

Abstract: 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 retrieva