Abstract: A technique for organizing data to facilitate data deduplication includes dividing a block-based set of data into multiple “chunks”, where the chunk boundaries are independent of the block boundaries (due to the hashing algorithm). Metadata of the data set, such as block pointers for locating the data, are stored in a tree structure that includes multiple levels, each of which includes at least one node. The lowest level of the tree includes multiple nodes that each contain chunk metadata relating to the chunks of the data set. In each node of the lowest level of the buffer tree, the chunk metadata contained therein identifies at least one of the chunks. The chunks (user-level data) are stored in one or more system files that are separate from the buffer tree and not visible to the user.

Abstract: Provided is a method and system for reducing duplicate buffers in buffer cache associated with a storage device. Reducing buffer duplication in a buffer cache includes accessing a file reference pointer associated with a file in a deduplicated filesystem when attempting to load a requested data block from the file into the buffer cache. To determine if the requested data block is already in the buffer cache, aspects of the invention compare a fingerprint that identifies the requested data block against one or more fingerprints identifying a corresponding one or more sharable data blocks in the buffer cache. A match between the fingerprint of the requested data block and the fingerprint from a sharable data block in the buffer cache indicates that the requested data block is already loaded in buffer cache. The sharable data block in buffer cache is used instead thereby reducing buffer duplication in the buffer cache.

Abstract: An intelligent web site information aggregation method and system is disclosed. Embodiments automatically extract information form a web page being currently viewed. A search query is formulated based on the extracted information. Web pages that have been returned in previous searched an also be merged with information extracted from the current page to formulate a search query. The user can specify disliked items as well as desired items. The user can specify preferences that are saved for later searches. A user interface displays webpages that have been found as well as the current page for side-by-side comparison. Users can share search results with others so that collaborative shopping can occur.

Abstract: A method and system for estimating space in a compressed volume to enable a storage server to respond to write requests before actually compressing and/or allocating data on disk. In some embodiments, in response to receiving a request to store data, the storage server estimates the amount of storage space required to store the data on disk. The storage server compares the estimated amount with the amount of available disk space. When the amount of available disk space is less than the estimated space, the storage server sends a response indicating that the request failed. Otherwise, when the amount of available disk space is greater than or equal to the estimate space, the storage server sends a response indicating that the request succeeded. The response is sent before the storage server allocates any disk space in connection with the request.

Abstract: Described are methods and apparatus for reducing latency of read and write requests for a set of storage system sites having a shared data set. An owner site may directly write to the shared data set and contains current data regarding the shared data set. The remote sites may experience substantial latency when accessing the shared data set stored at the owner site. Synchronizing and caching methods may reduce overall read latency experienced at remote sites by periodically transmitting images of the shared data set to the remote sites. Also, a migration method may be used to change ownership of the shared data set from a current owner site (that may be receiving a relatively low number of read/write requests) to a new owner site (that may be receiving a relatively high number of read/write requests) to reduce the overall read and write latency experienced in the sites.

Abstract: Described are methods and apparatus for reducing latency of read and write requests for a set of storage system sites having a shared data set. An owner site may directly write to the shared data set and contains current data regarding the shared data set. The remote sites may experience substantial latency when accessing the shared data set stored at the owner site. Synchronizing and caching methods may reduce overall read latency experienced at remote sites by periodically transmitting images of the shared data set to the remote sites. Also, a migration method may be used to change ownership of the shared data set from a current owner site (that may be receiving a relatively low number of read/write requests) to a new owner site (that may be receiving a relatively high number of read/write requests) to reduce the overall read and write latency experienced in the sites.

Abstract: Described are methods and apparatus for reducing latency of read and write requests for a set of storage system sites having a shared data set. An owner site may directly write to the shared data set and contains current data regarding the shared data set. The remote sites may experience substantial latency when accessing the shared data set stored at the owner site. Synchronizing and caching methods may reduce overall read latency experienced at remote sites by periodically transmitting images of the shared data set to the remote sites. Also, a migration method may be used to change ownership of the shared data set from a current owner site (that may be receiving a relatively low number of read/write requests) to a new owner site (that may be receiving a relatively high number of read/write requests) to reduce the overall read and write latency experienced in the sites.

Abstract: A method and system for estimating space in a compressed volume to enable a storage server to respond to write requests before actually compressing and/or allocating data on disk. In some embodiments, in response to receiving a request to store data, the storage server estimates the amount of storage space required to store the data on disk. The storage server compares the estimated amount with the amount of available disk space. When the amount of available disk space is less than the estimated space, the storage server sends a response indicating that the request failed. Otherwise, when the amount of available disk space is greater than or equal to the estimate space, the storage server sends a response indicating that the request succeeded. The response is sent before the storage server allocates any disk space in connection with the request.

Abstract: A technique for organizing data to facilitate data deduplication includes dividing a block-based set of data into multiple “chunks”, where the chunk boundaries are independent of the block boundaries (due to the hashing algorithm). Metadata of the data set, such as block pointers for locating the data, are stored in a tree structure that includes multiple levels, each of which includes at least one node. The lowest level of the tree includes multiple nodes that each contain chunk metadata relating to the chunks of the data set. In each node of the lowest level of the buffer tree, the chunk metadata contained therein identifies at least one of the chunks. The chunks (user-level data) are stored in one or more system files that are separate from the buffer tree and not visible to the user.

Abstract: A method may involve assigning each of a plurality of freelists and a plurality of hashlists used to implement a cache to one of a plurality of lock groups and acquiring one of a plurality of locks. Objects on each freelist and hashlist that are assigned to the same lock group are allocated from the same one of a plurality of memory allocation pools. Each lock group is associated with a respective one of the plurality of locks. Acquiring the lock locks a freelist and several hashlists included in an associated lock group of the plurality of lock groups.

Abstract: The invention provide a method for verification of receipt of services delivered in person to a buyer in an online service sales transaction prior to release of funds by a service sales system to the seller of a service. An electronic buyer's voucher generated by the service sales system is issued to the buyer upon obtaining funds from the buyer in a financial transaction. The funds are not released to the seller until the service is dispensed to the buyer. The buyer's electronic voucher contains both a transaction identification code which identifies the commercial transaction between the seller and the buyer, and a funds release authorization code. An electronic seller's voucher is also issued by the service sales system to the seller, the seller's electronic voucher containing the transaction identification code. In order to receive services the buyer must provide the seller with the transaction identification code.

Abstract: A method may involve assigning each of a plurality of freelists and a plurality of hashlists used to implement a cache to one of a plurality of lock groups and acquiring one of a plurality of locks. Objects on each freelist and hashlist that are assigned to the same lock group are allocated from the same one of a plurality of memory allocation pools. Each lock group is associated with a respective one of the plurality of locks. Acquiring the lock locks a freelist and several hashlists included in an associated lock group of the plurality of lock groups.