Abstract: Techniques for lossless database recovery using logical replay in a multi-volume database environment are described. Techniques for fast database recovery in a multi-volume database environment via transactional awareness are described. In the event of a failure associated with a first volume storing database page data, the first volume can be restored to a point in time and transactions occurring at/after that point in time can be identified and replayed via use of a second volume that tracks logical change data for the database.

Abstract: Techniques for fast database recovery in a multi-volume database environment via transactional awareness are described. In the event of a failure associated with a first volume storing database page data, the first volume can be restored to a point in time and transactional metadata from a second volume storing logical change data can be obtained for a limited number of transactions occurring at/after that point in time, as opposed to analyzing extremely large change log files. These transactions can be checked to ensure that they have all been persisted, and if not, change data for those transactions can be obtained from the second volume and used to replay these transactions on the restored first volume.

Abstract: Techniques for volume durable log sequence number movement in a multi-volume database environment are described. Blocks of database updates are persisted in an atomic and durable manner, where the blocks may include updates to a first volume, a second volume, or both. Backlinks from one block of updates to the previous block of updates may be set, in addition to backlinks between updates to the first volume and backlinks between updates to the second volume. Upon durably persisting a block, the block backlinks can be followed to help verify that all contiguous blocks—of changes to one or both volumes—have all been persisted. Thereafter, a volume durable log sequence number (VDL) pointer value can be updated to point to a known “last” durably persisted log update.

Abstract: A server includes a memory and a processor coupled to the memory. The memory stores shared documents used for collaboration, with each shared document having respective keywords associated therewith. The processor receives a user-selected portion of a web page displayed on at least one client device, matches keywords from the shared documents to keywords associated with the user-selected portion of the displayed web page, and selects at least one of the shared documents based upon the matching. The selected portion of the displayed web page is appended to the selected at least one shared document.

Abstract: A server includes a memory and a processor coupled to the memory. The memory stores shared documents used for collaboration, with each shared document having respective keywords associated therewith. The processor receives a user-selected portion of a web page displayed on at least one client device, matches keywords from the shared documents to keywords associated with the user-selected portion of the displayed web page, and selects at least one of the shared documents based upon the matching. The selected portion of the displayed web page is appended to the selected at least one shared document.

Abstract: Systems, methods, and/or devices are used to store metadata in a storage system. In one aspect, a first user space module sends a logical memory request to a memory management module of a kernel space module. The logical memory request includes data and metadata. A second user space module obtains the metadata of the logical memory request. A storage engine of the second user space module determines, in accordance with the obtained metadata, a location in non-volatile memory for the data. A second user space module generates a physical memory request including an indication of the non-volatile memory for the data. The second user space module transmits the physical memory request to the kernel space memory management module.

Abstract: A computing system includes a client computing device and a server. The client computing device interfaces with a browser for accessing a web page, and includes a display associated therewith for displaying the web page, with a portion of the displayed web page being selected by a user of the client computing device. The server store shared documents used for collaboration, with each shared document having respective keywords associated therewith. Responsive to selection of the portion of the displayed web page, the server matches keywords from the shared documents to keywords associated with the portion of the displayed web page, and selects one of the shared documents based upon the matching. Then server then appends the selected portion of the displayed web page to the selected shared document.

Abstract: An apparatus includes a non-volatile memory and a controller coupled to the non-volatile memory. The controller is configured to receive a command from a device to perform a write operation at the non-volatile memory. The command indicates a plurality of logical addresses, data associated with the plurality of logical addresses, and a number of write operations associated with the command.

Abstract: A method includes accessing, in response to initiating an operation targeting data, auxiliary mapping data to determine whether the auxiliary mapping data includes an indication of a key associated with a node of a hierarchical data structure that is associated with the data. In response to the auxiliary mapping data including the indication of the key, the data is accessed from a memory using a node identification associated with the key. In response to the auxiliary mapping data not including the indication of the key, the data is accessed from the memory using a search operation.

Abstract: A computing system includes a client computing device and a server. The client computing device interfaces with a browser for accessing a web page, and includes a display associated therewith for displaying the web page, with a portion of the displayed web page being selected by a user of the client computing device. The server store shared documents used for collaboration, with each shared document having respective keywords associated therewith. Responsive to selection of the portion of the displayed web page, the server matches keywords from the shared documents to keywords associated with the portion of the displayed web page, and selects one of the shared documents based upon the matching. Then server then appends the selected portion of the displayed web page to the selected shared document.

Abstract: An apparatus includes a non-volatile memory and a controller coupled to the non-volatile memory. The controller is configured to receive a command from a device to perform a write operation at the non-volatile memory. The command indicates a plurality of logical addresses, data associated with the plurality of logical addresses, and a number of write operations associated with the command.

Abstract: An apparatus includes a data sequencing engine configured to receive first data and an identification of a first data container associated with the first data and to allocate the first data to a first data stream of multiple data streams based on the identification. The apparatus further includes at least one memory configured to store the first data container. The data sequencing engine is further configured to cause the at least one memory to send data in the first data stream to a flash memory in response to detecting a data size of the first data stream satisfies a threshold.

Abstract: An apparatus includes a data sequencing engine configured to receive first data and an identification of a first data container associated with the first data and to allocate the first data to a first data stream of multiple data streams based on the identification. The apparatus further includes at least one memory configured to store the first data container. The data sequencing engine is further configured to cause the at least one memory to send data in the first data stream to a flash memory in response to detecting a data size of the first data stream satisfies a threshold.

Abstract: A method includes accessing, in response to initiating an operation targeting data, auxiliary mapping data to determine whether the auxiliary mapping data includes an indication of a key associated with a node of a hierarchical data structure that is associated with the data. In response to the auxiliary mapping data including the indication of the key, the data is accessed from a memory using a node identification associated with the key. In response to the auxiliary mapping data not including the indication of the key, the data is accessed from the memory using a search operation.

Abstract: Systems, methods, and/or devices are used to store metadata in a storage system. In one aspect, a first user space module sends a logical memory request to a memory management module of a kernel space module. The logical memory request includes data and metadata. A second user space module obtains the metadata of the logical memory request. A storage engine of the second user space module determines, in accordance with the obtained metadata, a location in non-volatile memory for the data. A second user space module generates a physical memory request including an indication of the non-volatile memory for the data. The second user space module transmits the physical memory request to the kernel space memory management module.

Abstract: A computer system detects a request to access a first data object stored in a tiered data structure, that includes internal nodes and leaf nodes, where data objects in the leaf nodes include unique key information and corresponding values, and the first data object is uniquely identified by a first key. In response to detecting the request to access the first data object, the computer system retrieves a leaf node that includes the first data object and identifies the first data object in the leaf node by combining unique key information of the first data object with a key prefix that is stored separately in the leaf node to generate a combined key and determining that the combined key matches the first key that uniquely identifies the first data object. After identifying the first data object, the computer system provides access to the first data object.

Abstract: A computer system detects a request, from a requestor, to access a first data object stored in a tiered data structure that includes internal nodes and leaf nodes. In response to detecting the request to access the first data object, the computer system retrieves a leaf node that includes the first data object and locks the leaf node that includes the first data object. While the leaf node that includes the first data object is locked, the computer system transmits, to the requestor, a first conditional-update communication and detecting a first conditional-update response in response to the first conditional-update communication. In response to detecting the first conditional-update response corresponding to the first data object, the computer system performs one or more operations based on the first conditional-update response corresponding to the first data object before unlocking the leaf node that includes the first data object.

Abstract: A computer system detects a request to access a first data object stored in a tiered data structure, that includes internal nodes and leaf nodes, where data objects in the leaf nodes include unique key information and corresponding values, and the first data object is uniquely identified by a first key. In response to detecting the request to access the first data object, the computer system retrieves a leaf node that includes the first data object and identifies the first data object in the leaf node by combining unique key information of the first data object with a key prefix that is stored separately in the leaf node to generate a combined key and determining that the combined key matches the first key that uniquely identifies the first data object. After identifying the first data object, the computer system provides access to the first data object.

Abstract: A computer system detects a request, from a requestor, to access a first data object stored in a tiered data structure that includes internal nodes and leaf nodes. In response to detecting the request to access the first data object, the computer system retrieves a leaf node that includes the first data object and locks the leaf node that includes the first data object. While the leaf node that includes the first data object is locked, the computer system transmits, to the requestor, a first conditional-update communication and detecting a first conditional-update response in response to the first conditional-update communication. In response to detecting the first conditional-update response corresponding to the first data object, the computer system performs one or more operations based on the first conditional-update response corresponding to the first data object before unlocking the leaf node that includes the first data object.

Abstract: The present invention provides appropriately substituted chalcones, such as, for example, represented by the structural formula as shown herein below Wherein R1, R2 and R3 are selected from the group consisting of H, OH, O-alkyl, O-phenyl and O-substituted phenyl; B represents Ar—Z—O or RO; where Z is an alkane having up to 5 carbon atoms; R is substituted propanol amino, wherein substituted amino groups are selected from the group consisting of t-butyl, n-butyl, i-butyl, i-propyl, 4-phenyl piperazine-1-yl, 4-(2-methoxyphenyl)-piperazin-1-yl and 3,4-dimethoxy phenethyl; and Ar is thiazolidine-dione methylene phenoxy. The compounds prepared have been demonstrated to exhibit significant antidiabetic effect in various animal models indicating potential for further exploitation.