Abstract: In one embodiment, the present invention includes a method for performing a plurality of read operations on a nonvolatile array of a memory according to a single read command, and storing data from the plurality of read operations in a volatile array of the memory. In some embodiments, the nonvolatile array may be a flash-based array and the volatile array may be a random access memory.

Abstract: A block-alterable memory, e.g., a flash memory, having substantially zero erase time is coupled to host. The block-alterable memory includes a controller that reads block information from the memory on power up to determine if a block of the memory is usable. The controller updates block map latches only if the block is usable. The controller also updates block status latches according to the block information. Thus, information about each block of the memory is easily accessible in the latches when the block alterable memory becomes ready for use on power up.

Abstract: In high-density mode, data may be stored in consecutive byte blocks. In low-density mode, a codeword of memory space may have the capacity to store two bytes of data, but may be used to store only a single byte of data. In a multi-level cell architecture where two or more bits may be stored in a single cell, memory address translation circuitry (or other system component) may translate data to be stored in low-density mode. Memory address translation circuitry may adjust the bit ordering of data to be stored to compensate for the consequences of low-density mode. A single flash memory device may have data stored in one portion in low-density mode and data stored in another portion in high-density mode. Error correcting code (ECC) may be applied in high-density mode and not in low-density mode.

Abstract: In one embodiment, the present invention includes a method for performing a plurality of read operations on a nonvolatile array of a memory according to a single read command, and storing data from the plurality of read operations in a volatile array of the memory. In some embodiments, the nonvolatile array may be a flash-based array and the volatile array may be a random access memory. Other embodiments are described and claimed.

Abstract: A method and apparatus to read information from a content addressable memory (CAM) cell of a nonvolatile memory is provided. The apparatus may be a nonvolatile memory that may include a first content addressable memory (CAM) cell, wherein the first CAM cell comprises a latch to store volatile binary information and to provide the volatile binary information to an output terminal of the first CAM cell. Other embodiments are described and claimed.

Abstract: An electronic spreadsheet consists of an array of cells into which a user can enter formulas and values. The contents of the spreadsheet cells are translated into a query in a high-level logic language such as the Pure Logic Language (PLL). The query is then re-written according to the rules of the logic language, to produce an answer. The answer is then translated back into formulas and values which can be displayed on the spreadsheet. The system provides a number of facilities not available on conventional electronic spreadsheets: it provides the ability to give generalised answers containing formulas rather than simply numbers, and provides the ability to solve goal-seeking problems, working backwards from a desired result.

Abstract: Hash-coding storage arrangements are known which are capable of storing data values efficiently and permitting rapid testing of whether a given data value is stored. However, such arrangements may produce erroneous outputs. The invention reduces or eliminates these erroneous outputs by providing a further store (which may itself be a hash-coding storage arrangement) which identifies the erroneous outputs, and is used to suppress them.

Abstract: A data processing system in which a sequence of records, each record containing data items of various types, is processed. The system is operable in a "remember" mode in which, if a data item of a particular type is not present in a particular record, the result of the last time that type of data item was processed is used as the result for the current record. This permits data files to be stored in a compressed form in which repeated data items are omitted.

Abstract: A data file searching system in which data is compared with a search key, and the results of the comparison are then analysed by a processing unit. The action of the processing unit is initiated by an end-of-record signal which is generated in accordance with an end-of-record criterion. This criterion can be varied, and this permits the boundaries between records to be effectively varied.

Abstract: An information retrieval system in which each record in a file is scanned and a hit signal is produced if it matches a search criterion. The hits are stored in a plurality of bit maps. Each record has an identifying index, which is transformed in a number of different ways to produce addresses for the bit maps. The outputs of the bit maps are combined to produce a stored hit signal. The number of hits is compared with the number of stored hits to determine whether any spurious stored hits have been recorded and, if so, the transformations are modified.