Patent application number | Description | Published |
20090119349 | Methods and Computer Program Products for Efficient Conflict Detection in a Replicated Hierarchical Content Repository Using Replication Anchors - Exemplary embodiments of the present invention relate to a methodology for using replication anchors to detect conflicts within replicated hierarchical content repository. The method comprises locking a data object in the event that an operation applied on the data object is replicated from a first server to a second server, reading a transaction identifier that is associated with the data object, retrieving a transaction sequence value that is associated with the transaction identifier, and determining if a conflict situation exist by comparing the retrieved transaction sequence value with an operation synchronization anchor value, the operation synchronization value being the transaction sequence value of a last transaction from the second server to the first server, wherein a conflict situation is determined to exist in the event that the transaction sequence value is greater than the operation synchronization anchor value. | 05-07-2009 |
20090119351 | Methods and Computer Program Products for Transaction Consistent Content Replication - Exemplary embodiments of the present invention relate to methodologies, computer program products and systems for the support of content replication, wherein transaction-level data replication consistency is guaranteed. Further, the exemplary methodologies of the present invention can be implemented while incurring little or no additional I/O overhead. | 05-07-2009 |
20110270844 | EFFICIENT AND SCALABLE DATA EVOLUTION WITH COLUMN ORIENTED DATABASES - A method, system and program product for data evolution on column oriented databases is disclosed. For an input evolution operation, reusable and non-reusable attributes are identified. For attributes in a target schema that cannot be reused from the source schema, data and bitmap indexes of those attributes are generated from source data and bitmap indexes. A decompose operation is disclosed for decomposing a table into two tables. A merge operation is disclosed in which only one input table can be reused for mergence. A second merge operation is disclosed in which both input tables cannot be reused for mergence. | 11-03-2011 |
20120254120 | LOGGING SYSTEM USING PERSISTENT MEMORY - A computer program product, including: a computer readable storage device to store a computer readable program, wherein the computer readable program, when executed by a processor within a computer, causes the computer to perform operations for logging. The operations include: receiving a transaction including data and a log record corresponding to the data; writing the data to a data storage device; and writing the log record to a log space on a persistent memory device coupled to the data storage device. | 10-04-2012 |
20130226955 | BI-TEMPORAL KEY VALUE CACHE SYSTEM - Described herein are techniques for supporting bi-temporal data in a key value cache system. An embodiment provides bi-temporal data as the basic functionality of a key value cache system. An embodiment provides a redesign of the core data structures of a key value cache system, adds bi-temporal data storage in the key value hashing structure, and provides a temporality-aware memory space manager. Embodiments can achieve the same performance as current key value cache systems for regular queries (that is, the queries that only access the current versions of data) while supporting bi-temporal data. | 08-29-2013 |
20130290283 | SCM-CONSCIOUS TRANSACTIONAL KEY-VALUE STORE - Embodiments of a method are described. In one embodiment, the method is a method for executing and supporting transactions. The method includes receiving a transaction comprising a command and data. The method includes writing the data to a transaction manager on a persistent memory device. The transaction manager also maintains a status of the transaction and reference to entries within memory that are manipulated by the transaction. The method also includes creating an in-memory log of the transaction in a first hash directory. The method includes committing a copy of the first hash directory to a second hash directory maintained on a persistent memory device. | 10-31-2013 |
20130290655 | SCM-CONSCIOUS TRANSACTIONAL KEY-VALUE STORE - Embodiments of a system are described. In one embodiment, the system is a device for performing operations and supporting transactions. The device is configured to receive a transaction comprising a command and data. The device writes the data to a transaction manager on a persistent memory device. The transaction manager also maintains a status of the transaction and reference to entries within memory that are manipulated by the transaction. The device also creates an in-memory log of the transaction in a first hash directory. The device then commits a copy of the first hash directory to a second hash directory maintained on a persistent memory device. | 10-31-2013 |
20140059284 | SYSTEMS, METHODS AND COMPUTER PROGRAM PRODUCTS MEMORY SPACE MANAGEMENT FOR STORAGE CLASS MEMORY - Embodiments of the present invention provide a system, method and computer program products for memory space management for storage class memory. One embodiment comprises a method for information storage in an information technology environment. The method comprises storing data in a storage class memory (SCM) space, and storing storage management metadata corresponding to said data, in the SCM in a first data structure. The method further includes buffering storage management metadata corresponding to said data, in a main memory in a second data structure. | 02-27-2014 |