Abstract: A method, computer program product, and computing system for loading a first chunk of data from a user data page into a first buffer. Each successive chunk of data from the user data page may be iteratively loaded into a second buffer. The first chunk of data in the first buffer may be iteratively compared with each successive chunk of data in the second buffer. In response to determining that the first chunk of data in the first buffer is equivalent to each successive chunk of data in the second buffer, the first chunk of data may be defined as a pattern.

Abstract: A method, computer program product, and computing system for loading a first chunk of data from a user data page into a first buffer. Each successive chunk of data from the user data page may be iteratively loaded into a second buffer. The first chunk of data in the first buffer may be iteratively compared with each successive chunk of data in the second buffer. In response to determining that the first chunk of data in the first buffer is equivalent to each successive chunk of data in the second buffer, the first chunk of data may be defined as a pattern.

Abstract: Updates are applied to a multi-entry bucket of a persistent multi-bucket hash table indexed by a hash index having a bucket portion and a collision portion, each entry of each bucket storing a corresponding value. The bucket is initially stored in a buffer and both a hash lookup structure and value lookup structure are generated for the bucket, the hash lookup structure usable to identify an entry of the bucket based on collision portion, the value lookup structure usable to identify an entry of the bucket based on value. For each update, a value of the update is applied to the value lookup structure to identify a corresponding entry, and the entry in the buffer is modified as required by the update. Subsequently the bucket in the buffer is persisted back to the hash table using the hash lookup structure.

Abstract: Updates are applied to a multi-entry bucket of a persistent multi-bucket hash table indexed by a hash index having a bucket portion and a collision portion, each entry of each bucket storing a corresponding value. The bucket is initially stored in a buffer and both a hash lookup structure and value lookup structure are generated for the bucket, the hash lookup structure usable to identify an entry of the bucket based on collision portion, the value lookup structure usable to identify an entry of the bucket based on value. For each update, a value of the update is applied to the value lookup structure to identify a corresponding entry, and the entry in the buffer is modified as required by the update. Subsequently the bucket in the buffer is persisted back to the hash table using the hash lookup structure.