Abstract: An intelligent data storage system, comprising: one or more intelligent storage devices each comprising one or more processors, a memory, and a storage medium configured to store source data; and one or more application hosts each comprising one or more processors and a memory, communicatively coupled to said one or more intelligent storage devices and configured to generate an execution plan, comprising at least one data filtering parameter, to divide said execution plan into one or more fragments comprising said at least one data filtering parameter, and to provide said one or more fragment to said one or more intelligent storage devices, wherein said intelligent storage device is configured to execute said execution plan fragment on the source data to generate result data selected from the source data based on said at least one data filtering parameter.

Abstract: A disclosed method includes maintaining redo log blocks in a disk array cache and filtering the redo log records using a data block written flag (DBWF), and generating a recovery set that in the disk array cache that is a subset of redo log records generated by a failed database instance. A database cluster providing database cluster recovery is also disclosed.

Abstract: Methods and systems for providing a flexible protection model in a computer system by decoupling protection from privilege are described. Information describing a relationship between the two or more domains that define types of protection and portions of code is received. The portions of code with the multiple domains that provide fine granularities of protection can be executed in the same privilege level. The relationship is not required to be linear. In addition, the overhead associated with crossing protection domains is relatively low with respect to traditional operating system context switching overhead.

Abstract: A method and apparatus for replacing data in a list of buffers is provided. The list of buffers has a hot end and a cold end. The buffers at the hot end are maintained in a FIFO list and the buffers at the cold end are maintained in an LRU list. Requested data is located and, if the requested data is located in the LRU portion of the buffer list, the buffer containing the requested data is moved to the head of the FIFO list. If the data is located in a buffer in the FIFO portion of the buffer list, no rearrangement is required. If the requested data is not located in the buffer list, the data is stored into the buffer at the tail end of the LRU list, then the buffer is moved to the head of the FIFO list.