Patent application number | Description | Published |
20100169777 | Light Table for Editing Digital Media - A system in accordance with the present invention may include one or more processors, memory that receives instructions from the one or more processors according to a clock operating at a frequency, one or more programs stored in the memory, with instructions to: access media content, wherein the media content is associated with meta data, media characteristics, or other media-related data; couple certain of the media content to a style; and, organize the coupled certain of the media content according to the style and the meta data, media characteristics, or other media-related data. | 07-01-2010 |
20100169783 | Framework for Slideshow Object - A system in accordance with the present invention may include one or more processors, memory that receives instructions from the one or more processors according to a clock operating at a frequency, one or more programs stored in the memory, with instructions to: define a layer, wherein the layer comprises one or more effects; associate media content with the layer; aggregate the layer with one or more other layers; and, assemble the aggregated layers. | 07-01-2010 |
20100169784 | Slide Show Effects Style - A computer-implemented method for authoring media presentations is provided. The method includes steps for defining a style. The style comprises one or more style properties. The style is applied to a layer. The layer comprises one or more effects. The style may also be applied to a document, effect container, effect, or slide. A media presentation is automatically generated using the applied style and the layer. A media presentation is also automatically generated using the applied style and the document and at least one of the layer, the effect container, the effect, and the slide. | 07-01-2010 |
Patent application number | Description | Published |
20100306222 | CACHE-FRIENDLY B-TREE ACCELERATOR - A system and method for accelerating searches of B-trees. An auxiliary index that is optimized for use with a cache is used in conjunction with a B-tree. A hash type of auxiliary index maintains pointers to key entries in the B-tree leaf nodes. The hash type of index may be searched, and a resulting pointer is used to locate records of the B-tree, bypassing a search of the B-tree. A top level type of auxiliary index maintains pointers to leaf nodes or internal nodes of the B-tree. A top level index may be searched, and a search of the B-tree is performed beginning with the node found by using the top level index. A monitoring mechanism may automatically start, change, or discard the auxiliary index based on an amount of cache memory, types of searches, or other factors. The auxiliary index may be optimized for high performance in read only searches, while the B-tree provides transaction durability. | 12-02-2010 |
20110153566 | OPTIMISTIC SERIALIZABLE SNAPSHOT ISOLATION - The subject disclosure relates to a concurrency control technique that ensures isolation among concurrently execution transactions optimistically in a multiversion database by applying two optional tests at the end of a read-write transaction: validating the visibility of the read set of the read-write transaction(s) and phantom detection by re-scanning and confirming no new version have appeared in the view. Depending on desired level of isolation, both, one or none of the test are applied. Each version of a data record in an applicable database can be assigned two timestamps indicating the lifetime the version. The value of a version timestamp, though assigned, may be conditional on a transaction committing. | 06-23-2011 |
20110252000 | IN-MEMORY DATABASE SYSTEM - A computer system includes a memory and a processor coupled to the memory. The processor is configured to execute instructions that cause execution of an in-memory database system that includes one or more database tables. Each database table includes a plurality of rows, where data representing each row is stored in the memory. The in-memory database system also includes a plurality of indexes associated with the one or more database tables, where each index is implemented by a lock-free data structure. Update logic at the in-memory database system is configured to update a first version of a particular row to create a second version of the particular row. The in-memory database system includes a non-blocking garbage collector configured to identify data representing outdated versions of rows. | 10-13-2011 |
20120059798 | MIRRORING FILE DATA - The present invention extends to methods, systems, and computer program products for mirroring file data. Generally, high availability and disaster recovery (“HADRON”) is achieved within a database management system by detecting which parts of a file have changed and sending the changed parts to secondaries. Adjacent or partially overlapping parts of a file can coalesce to form larger chunks of changed data. Coalescing reduces the overall number of chunks that are tracked. | 03-08-2012 |
20120102006 | DISTRIBUTED TRANSACTION MANAGEMENT FOR DATABASE SYSTEMS WITH MULTIVERSIONING - The subject disclosure relates to a distributed transaction management technique that ensures synchronization between participating nodes in a global or distributed database transaction. The technique leverages a commit protocol that uses local clocks at the respective participating nodes. Participants in a global transaction are configured to utilize the same commit timestamp and logical read time and can advance their respective local clocks to establish this synchronization. In one embodiment, distributed commit utilizes a modified version of two-phase commit that includes an extra phase to collect commit timestamp votes from participants. Additionally, a heartbeat mechanism can be used to establish loose synchronization between nodes. In another embodiment, a node can respond to a remote transaction request by returning a list of nodes involved in generating the result of the transaction and the types of access used by such nodes in addition to the transaction result itself. | 04-26-2012 |
20120109895 | VERSATILE IN-MEMORY DATABASE RECOVERY - The subject disclosure relates to a database recovery technique that implements various aspects of transaction logging to optimize database recovery performance. Transactions are logged logically with no reference to physical location, which enables logging to be performed via multiple independent log streams in parallel. A set of log streams can further be adjusted to conform to a local configuration of a mirror or secondary node in order to increase mirroring flexibility. Additionally, individual transactions or groups of transactions are recorded using a single log record, which contains timestamp information to enable database recovery without reference to physical checkpoint files. Further, techniques are provided herein for processing transactions without Write Ahead Logging or hardening of undo information. As further described herein, a transaction can be committed via a set of hierarchical stages, which in turn can facilitate integration of an in-memory database system with one or more external database systems. | 05-03-2012 |
20120233139 | EFFICIENT MULTI-VERSION LOCKING FOR MAIN MEMORY DATABASES - A transaction creates a wait for dependency on a version in a main memory database implementing a multi-version concurrency control scheme. The wait for dependency allows the transaction to update the version while other transactions are reading the version. The multi-version concurrency control scheme also allows commit dependencies to be implementing concurrently with wait for dependencies. Commit dependencies allow a transaction to read an updated version before the updated version is committed. | 09-13-2012 |
20130103659 | DISTRIBUTED TRANSACTION MANAGEMENT FOR DATABASE SYSTEMS WITH MULTIVERSIONING - The subject disclosure relates to a distributed transaction management technique that ensures synchronization between participating nodes in a global or distributed database transaction. The technique leverages a commit protocol that uses local clocks at the respective participating nodes. Participants in a global transaction are configured to utilize the same commit timestamp and logical read time and can advance their respective local clocks to establish this synchronization. In one embodiment, distributed commit utilizes a modified version of two-phase commit that includes an extra phase to collect commit timestamp votes from participants. Additionally, a heartbeat mechanism can be used to establish loose synchronization between nodes. In another embodiment, a node can respond to a remote transaction request by returning a list of nodes involved in generating the result of the transaction and the types of access used by such nodes in addition to the transaction result itself. | 04-25-2013 |
20130198142 | MIRRORING FILE DATA - High availability and disaster recovery can be achieved within a database management system by detecting which parts of a file have changed and sending the changed parts to secondary servers, without sending the entire file that has experienced the changes. A log cracker reads data from a transaction log that stores records from a database and a separately maintained file system. The log cracker sends mirror commands with some of the transaction log data to the file system to initiate mirroring of the data from the file system to secondary servers. The log data is then subsequently sent to the secondary servers as well, to enable identification of changed data without having to transfer the entire file that has been changed. | 08-01-2013 |
20140297595 | TRANSACTION PROCESSING FOR DATABASE IN PERSISTENT SYSTEM - Performing a transaction in the context of a computing system that has one or more persistent systems coupled to one or more processors over a bus. As an example, the persistent system may serve as at least part of the main memory of the computing system. The transaction might implement multi-versioning in which a record is not updated in place. Rather, each record is represented as a sequence of one or more record versions, each version having a valid interval during which the record version is considered to properly represent the record. As part of the transaction, post-commit processing information is generated to allow the computing system to recover in the event of a system failure. | 10-02-2014 |
20140297598 | RECOVERY PROCESSING FOR DATABASE IN PERSISTENT SYSTEM - The recovery of one or more transactions in a computing system in which one or more persistent systems are coupled via a bus to one or more processors. As an example, the persistent system may serve as at least part of the main memory of the computing system. The transaction might implement multi-versioning in which a record is not updated in place. Rather, each record is represented as a sequence of one or more record versions, each version having a valid interval during which the record version is considered to properly represent the record. | 10-02-2014 |
20140297608 | RECOVERY PROCESSING USING TORN WRITE DETECTION - The recovery of a transaction, and perhaps the recovery of multiple transactions, in a computing system in which one or more persistent systems are coupled via a bus to one or more processors. As an example, the persistent system may serve as part of the main memory of the computing system. The transaction might implement multi-versioning in which a record is not updated in place. Rather, each record is represented as a sequence of one or more record versions, each version having a valid interval during which that the record version is considered to properly represent the record. Torn write guards may be used to verify that there are no torn writes in the record versions or in the log buffer associated with the transaction. | 10-02-2014 |
20140297609 | TRANSACTION PROCESSING USING TORN WRITE DETECTION - Performing a transaction in the context of a computing system that has one or more persistent systems coupled to one or more processors over a bus. As an example, the persistent system may serve as at least part of the main memory of the computing system. The transaction might implement multi-versioning in which a record is not updated in place. Rather, each record is represented as a sequence of one or more record versions, each version having a valid interval during which the record version is considered to properly represent the record. The transaction processing uses torn write detection so that recovery processes may use such guards to verify that there are no torn writes. For instance, torn write guards may be used to verify the integrity of record versions as well as the log buffers that refer to the record versions. | 10-02-2014 |