| 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 |
