Concurrency Control And Recovery (epo) Patents (Class 707/E17.007)
-
Publication number: 20130159249Abstract: System, method, computer program product embodiments and combinations and sub-combinations thereof for hybrid data replication are described. Aspects include identifying a type of database data replication, the type including a combination of replication approaches, and managing replication based on the identified type, including coordinated switching from one replication approach to another automatically with transactional consistency maintained among source and target databases.Type: ApplicationFiled: December 15, 2011Publication date: June 20, 2013Applicant: Sybase, Inc.Inventors: Rhett Dondi DEWALL, Heping SHANG
-
Publication number: 20130159265Abstract: An insertion of a record into a table that includes a primary key column and a second column that includes a global uniqueness constraint across all of a plurality of data partitions across which the table is split is initiated without checking that a value of the record in the second column is globally unique by contacting other partitions the one partition to which the record is to be added to. The insertion can be processed, at least in part by implementing a write lock on the one partition but without implementing a read lock on the other partitions. The write lock on the one partition can be released after the insertion is completed, after which the validity of the insertion can be verified, for example by examining the other parts and a delta partition corresponding to the table. The insertion can be undone if the insertion was not valid.Type: ApplicationFiled: December 20, 2011Publication date: June 20, 2013Inventors: Thomas Peh, Wolfgang Stephan, Andreas Tonder, Lars Fricke, Christian Bensberg
-
Publication number: 20130151476Abstract: Processing archive content based on hierarchical classification levels is performed by indexing a first newly archived file of a current set of archive content at a first classification level defining a plurality of types of metadata to be derived, wherein the first classification level is selected from a hierarchy of classification levels having at least two classification levels, indexing a second newly archived file of the current set of archive content at a second classification level, wherein the second classification level includes fewer types of metadata than the first class of metadata, and flagging the second newly archived file of the current set of archive content. By classifying and flagging the second newly archived file differently than the first newly archived file, the system can easily retrieve such data at a later instance to update and/or change the data, re-index the data, and the like.Type: ApplicationFiled: June 27, 2012Publication date: June 13, 2013Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Karen W. BRANNON, Wenling CAI, Sangeeta DORAISWAMY, Ryan J. MINNIEAR, David A. PEASE, Mark A. SMITH
-
Publication number: 20130151481Abstract: Embodiments of the invention relate generally to electrical and electronic hardware, computer software, wired and wireless network communications, and computing devices, and more particularly, to a system, an apparatus and a method configured to generate arrangements of data, including data catalogs, to facilitate discovery of items via an interface depicting item representations based on similarity of one or more attributes. In one embodiment, a method includes receiving data representing a request to transmit data; executing instructions at a processor to determine the relationships of the item representations to the principal item representation for records stored in a memory, associating the item representations to positions of a data arrangement based on the relationships of the item representations.Type: ApplicationFiled: December 7, 2011Publication date: June 13, 2013Applicant: Tacit Knowledge, Inc.Inventors: Christopher J. Andrasick, Anthony S. Askew
-
Publication number: 20130151468Abstract: The present invention relates to the field of communications technologies, and in particular, to a file synchronization method and device. Through the present invention, two-way synchronization between a device for synchronization and the server can be implemented, thereby improving user experience.Type: ApplicationFiled: September 19, 2012Publication date: June 13, 2013Applicant: HUAWEI TECHNOLOGIES CO., LTD.Inventor: Huawei Technologies Co., Ltd.
-
Publication number: 20130151494Abstract: A distributed database transaction coordination manager's outcome store may be unavailable to resolve in-doubt transactions locally, e.g., after an unclean detach, during an outcomes store restore, or during a logical database restore. To facilitate transactional consistency, AGEs and values based on them are used. Some code avoids reformatting any closed physical portion for reuse based on the segment's most recently received minimum of persisted AGEs. Some code commits any in-doubt transactions that appear on an aggregate list and aborts any not on the aggregate list. Some code writes each segment's transaction commit records to persistent storage until the segment's persisted-AGE is not less than a common-restore-AGE, and some code resolves any in-doubt transactions based on a harvested outcomes list. Outcomes may reside in a log or a persisted transactions table. A restore checkpoint may include harvested outcomes. Segments may reside on cloud nodes and/or in a shared nothing database system.Type: ApplicationFiled: December 9, 2011Publication date: June 13, 2013Applicant: MICROSOFT CORPORATIONInventors: Robin Dhananjay Dhamankar, Kapil Gupta, Michael Purtell, Kevin G. Farlee
-
Publication number: 20130151493Abstract: A system includes an application programming interface (API) configured to process a transaction request that specifies data content located at a storage medium. A request processor associated with the API can be configured to determine a delivery format for the data content in response to the transaction request. A file converter can be configured to transform the data content into the delivery format in accordance with the transaction request.Type: ApplicationFiled: December 7, 2011Publication date: June 13, 2013Inventors: Todd Stuart Roth, Stanley Robert Moote
-
Publication number: 20130151482Abstract: Example methods and apparatus associated with data de-duplication for a global coherent de-duplication repository are provided. In one example a request related to data de-duplication is transmitted to a plurality of nodes associated with the global coherent de-duplication repository. Responses to the request are received from at least a subset of nodes in the plurality of nodes. Affinity scores are assigned to nodes of the subset of nodes based, at least in part, on affinity data from the responses. A node is selected to perform the request related to de-duplication from the subset of nodes of the plurality of nodes based, at least in part, on the affinity score assigned to the nodes.Type: ApplicationFiled: December 7, 2011Publication date: June 13, 2013Applicant: Quantum CorporationInventor: Jeffrey Tofano
-
Publication number: 20130144843Abstract: An online data fusion system receives a query, probes a first source for an answer to the query, returns the answer from the first source, refreshes the answer while probing an additional source, and applies fusion techniques on data associated with an answer that is retrieved from the additional source. For each retrieved answer, the online data fusion system computes the probability that the answer is correct and stops retrieving data for the answer after gaining enough confidence that data retrieved from the unprocessed sources are unlikely to change the answer. The online data fusion system returns correct answers and terminates probing additional sources in an expeditious manner without sacrificing the quality of the answers.Type: ApplicationFiled: December 5, 2011Publication date: June 6, 2013Applicant: AT&T INTELLECTUAL PROPERTY I, L.P.Inventors: Divesh Srivastava, Xin Dong, Xuan Liu
-
Publication number: 20130144842Abstract: An approach is disclosed for implementing failover and resume when using ordered sequences in a multi-instance database environment. The approach commences by instantiating a first database instance initially to serve as an active instance, then instantiating a second database instance to serve as an instance of one or more passive instances. The active database establishes mastership over a sequence and then processes requests for the ‘next’ symbol by accessing a shared sequence cache only after accessing a first instance semaphore. The active instance and the passive instance perform a protocol such that upon passive database detection of a failure of the active database, one of the passive database instances takes over mastership of the sequence cache, and then proceeds to satisfy sequence value requests. The particular order is observed in spite of the failure.Type: ApplicationFiled: December 1, 2011Publication date: June 6, 2013Applicant: ORACLE INTERNATIONAL CORPORATIONInventors: Fulu LI, Atsushi MORIMURA, Michael ZOLL, Vineet MARWAH, Amit GANESH
-
Publication number: 20130138614Abstract: A data transaction processing system may include: an active node and a standby node, each having multiple data partitions managed by a data engine; a deadlock manager that determines whether a deadlock has occurred in connection with a requested data transaction; and a transaction agent for managing the transaction and communications with the data engines. The transaction agent in the active node may not commit a transaction until all portions of the transaction have been successfully completed in both the active and standby nodes.Type: ApplicationFiled: November 30, 2011Publication date: May 30, 2013Inventor: MARK TRAVIS
-
Publication number: 20130138615Abstract: Embodiments of the invention relate to synchronization of data in a shared pool of configurable computer resources. An image of the filesystem changes, including data and metadata, is captured in the form of a consistency point. Sequential consistency points are created, with changes to data and metadata in the filesystem between sequential consistency captured and placed in a queue for communication to a target filesystem at a target site. The changes are communicated as a filesystem operation, with the communication limited to the changes captured and reflected in the consistency point.Type: ApplicationFiled: November 29, 2011Publication date: May 30, 2013Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Karan Gupta, Manoj P. Naik, Frank B. Schmuck, Mansi A. Shah, Renu Tewari
-
Publication number: 20130138607Abstract: Mechanisms are provided for efficient resynchronization of replicated data. A hash value is generated for a chunk of data replicated from a source node to a target node. The chunk of data may be a file deduplicated and compressed at both a source node and a target node. A current sequence number is determined and a sequence number and hash tuple is maintained for the chunk of data at both the source node and the target node. Sequence numbers are modified whenever the data is modified. Current sequence numbers and sequence number and hash values in the sequence number hash tuples at the source node and the target node may be compared to determine whether data is still synchronized at a later point in time or whether data requires resynchronization.Type: ApplicationFiled: November 29, 2011Publication date: May 30, 2013Applicant: DELL Products L.P.Inventors: Murali Bashyam, Sreekanth Garigala
-
Publication number: 20130132347Abstract: An embodiment of the invention provides a backup method for a portable device. The method comprises creating a first log file according to a first file that has to be stored in a backup device, connecting the portable device to the backup device. When the backup device is connected to the portable device, the backup device reads the first log file and stores the first file to the backup device.Type: ApplicationFiled: November 22, 2011Publication date: May 23, 2013Inventor: Johnny CHEN
-
Publication number: 20130132345Abstract: A method, system and computer readable storage medium for replicating database data of heterogeneous data type are disclosed. The method includes determining the data type of an element of heterogeneous data type to be replicated. The element is packed into a predetermined transfer format as an opaque data type, based on the determined data type, and replicated to a replication server. The replication server is instructed to not modify the element noted as opaque.Type: ApplicationFiled: November 22, 2011Publication date: May 23, 2013Applicant: SYBASE, INC.Inventors: Hai-Yan Chen, Stephen Shepherd
-
Publication number: 20130124475Abstract: A system and method of performing snapshot isolation in distributed databases. Each node stores local snapshot information that enforces snapshot isolation for that node. The method includes partially processing a distributed transaction by a first node, receiving a global commit identifier from a coordinator, and continuing to process the distributed transaction, by the first node and a second node, in accordance with the global commit identifier.Type: ApplicationFiled: November 16, 2011Publication date: May 16, 2013Applicant: SAP AGInventors: Stefan Hildenbrand, Carsten Binnig, Franz Faerber, Donald Kossmann, Juchang Lee, Norman May
-
Publication number: 20130117237Abstract: Log entries are recorded in a data storage application (such as an in-memory database, etc.) for a plurality of transactions among nodes in a node hierarchy. The node hierarchy comprises master node having a plurality of slave nodes. Thereafter, at least a portion of the master node log entries are replayed until a first replay position is reached. Next, for each slave node, at least a portion of its respective log entries are replayed until the first replay position is reached (or an error occurs). Subsequently, replay of at least a portion of the log entries of the master node that are subsequent to the first replay position is initiated by the master node in parallel to at least a portion of the replaying by the slave nodes. Related apparatus, systems, techniques and articles are also described.Type: ApplicationFiled: November 7, 2011Publication date: May 9, 2013Inventors: Dirk Thomsen, Ivan Schreter
-
Publication number: 20130117236Abstract: A plurality of transactions are executed in a data storage application. As a result, log entries according to the plurality of transactions are stored in at least one log. During a data recovery operation, log entries from the log are dispatched into a plurality of worker queues. Each worker queue corresponds to a different one of a plurality of logical central processing units. The log entries are replayed using the plurality of worker queues such that log entries associated with a same object are executed serially by a single worker queue and at least a portion of the log entries associated with different objects are executed in parallel by different worker queues. Related apparatus, systems, techniques and articles are also described.Type: ApplicationFiled: November 7, 2011Publication date: May 9, 2013Inventor: Ivan Schreter
-
Publication number: 20130117235Abstract: First k log buffers, in a data storage application including a plurality of log buffers are each loaded with exactly one transaction. Each log buffer is written to one of a plurality of log partitions. Thereafter, each of the log buffers is sent to an input/output (I/O) subsystem when they are respectively loaded with a single transaction. Transactions are subsequently accumulated in respective new current log buffers after sending the k log buffers to the I/O subsystem. The accumulated transactions are sent to the I/O subsystem when the earlier occurs of (i) the respective current log buffer being full or (ii) a number of incomplete input/output requests handled by the I/O subsystem falls below k. Related apparatus, systems, techniques and articles are also described.Type: ApplicationFiled: November 7, 2011Publication date: May 9, 2013Inventor: Ivan Schreter
-
Publication number: 20130117234Abstract: A plurality of transactions in a data storage application are executed during which log entries according to the plurality of transactions are stored in a plurality of log buffers. The log entries are sequentially written into a current log buffer and the plurality of log buffers are written to a plurality of log partitions according to a round-robin distribution. Thereafter, in response to a data recovery event, a sequential list of the log entries in the log buffers are assembled to generate a log that can be used for data recovery by the data storage application. Related apparatus, systems, techniques and articles are also described.Type: ApplicationFiled: November 7, 2011Publication date: May 9, 2013Inventor: Ivan Schreter
-
Publication number: 20130117307Abstract: System, method, computer program product embodiments and combinations and sub-combinations thereof for snapshot isolation support for distributed query processing in a shared disk database cluster are provided. The embodiments include the forming of object identification data in a leader node of query execution in the shared disk database cluster. At least one fragment of the query execution is distributed to at least one worker node in the shared disk database cluster, and the object identification data is utilized for multiversion concurrency control during query execution by the leader node and at least one worker node.Type: ApplicationFiled: December 2, 2011Publication date: May 9, 2013Applicant: Sybase, Inc.Inventors: Surendra Kumar VISHNOI, Colin FLORENDO
-
Publication number: 20130117246Abstract: Examples of the present invention provide methods relating to identification of a portion of text data common with reference text data, the method including obtaining the text data and the reference text data, the text data and the reference text data comprising a number of lines of text, identifying one or more lines of text of the text data that are common to the lines of text of the reference text data, and for one or more further lines of text of the text data that are not common to the lines of text of the reference text data, comparing the line of text of the text data with a corresponding line of text of the reference data to identify one or more common characters of the line of text.Type: ApplicationFiled: November 3, 2011Publication date: May 9, 2013Inventors: Sebastien Cabaniols, Nathalie Cabaniols-Viollet, Clément Poulain
-
Publication number: 20130117233Abstract: A first plurality of log segments are generated in a data storage application. The log segments are sequentially positioned within a log area and at least one of the log segments contains log hole information identifying a portion of log to skip during replay of the log. Thereafter, a portion of log segments are replayed up to a specified position while skipping at least one portion of the log prior to the specified position that is identified by the at least one log hole. Related apparatus, systems, techniques and articles are also described.Type: ApplicationFiled: November 7, 2011Publication date: May 9, 2013Inventor: Ivan Schreter
-
Publication number: 20130117239Abstract: A mechanism is provided for generating enumerated information in which a plurality of files is enumerated except entirely-invalidated files on a sequential medium. Management information for managing locations where the plurality of files on the sequential medium are recorded is acquired from the sequential medium. The enumerated information in which the plurality of files are enumerated is generated in an order according to the locations where the plurality of files are recorded on the basis of the acquired management information.Type: ApplicationFiled: October 10, 2012Publication date: May 9, 2013Applicant: International Business Machines CorporationInventor: International Business Machines Corporation
-
Publication number: 20130110782Abstract: Database updates to primary and secondary database structures are performed by writing information from a client to both primary and secondary database services and building the database structure at the primary database service while delaying application of data written to the secondary database service until notification at the secondary database service from the primary database service. The primary database service provides notification upon completing the database structure so that the secondary database service can proceed with building the database structure from the information provided by the client or with information provided by the primary database service.Type: ApplicationFiled: November 1, 2011Publication date: May 2, 2013Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventor: Gerald F. McBrearty
-
Publication number: 20130110785Abstract: In a method for backing up test data using a first backup device and a second backup device, backup times and storage paths for each test computing device in the first backup device and the second backup device, and a backup path of each test computing device are set. Test data of each of the test computing devices are backed up as backup data to the first backup device if a first current time of the first backup device matches the backup time in the first backup device, or to the second backup device if a second current time of the second backup device matches the backup time in the second backup device. Changes of each backup file of the backup data stored under the storage path are recorded. A log file of the backup time is generated.Type: ApplicationFiled: March 21, 2012Publication date: May 2, 2013Applicants: HON HAI PRECISION INDUSTRY CO., LTD., HONG FU JIN PRECISION INDUSTRY (ShenZhen) CO., LTD.Inventor: YONG-SHENG YANG
-
Publication number: 20130110789Abstract: There is provided a method of, and apparatus for, enabling data recovery on a data storage resource. The resource includes a file system having a file system structure component for data storage management. In use, a storage request operable to modify the file system is received, processed and the file system structure component updated based on the storage request. Subsequently, a data record recording the modification by the storage request is generated and used to update an auxiliary file system structure component separate from the file system structure component. By providing such a method, a file system structure can be recreated and recovered quickly after a failure or error utilising the auxiliary file system structure component. This enables a file system to be reconstructed much faster than conventional approaches because the auxiliary file system structure has already been created.Type: ApplicationFiled: October 27, 2011Publication date: May 2, 2013Inventors: Peter BRAAM, Nikita Y. DANILOV
-
Publication number: 20130110787Abstract: Embodiments of the invention relate to a virtual file system for communicating changes in metadata associated with data archived in a data storage system to applications. An aspect of the invention concerns a system that comprises a virtual file system for storing metadata files wherein each metadata file is associated with an archived data file, and a virtual file system interface coupled to the virtual file system for exposing changes in the metadata files to the applications.Type: ApplicationFiled: October 27, 2011Publication date: May 2, 2013Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Neeta Garimella, Bernhard J. Klingenberg, Ryan J. Minniear, Mark A. Smith
-
Publication number: 20130110784Abstract: Containers that store data objects that were written to those containers during a particular backup are accessed. Then, a subset of the containers is identified; the containers in the subset have less than a threshold number of data objects associated with the particular backup. Data objects that are in containers in that subset and that are associated with the backup are copied to one or more other containers. Those other containers are subsequently used to restore data objects associated with the backup.Type: ApplicationFiled: October 31, 2011Publication date: May 2, 2013Applicant: SYMANTEC CORPORATIONInventors: Fanglu Guo, Petros Efstathopoulos, Xianbo Zhang, Sanjay Sawhney, Weibao Wu
-
Publication number: 20130103648Abstract: System and method for storing a dataset of image tiles.Type: ApplicationFiled: July 9, 2012Publication date: April 25, 2013Inventors: John T. Sample, Elias Z K Loup
-
Publication number: 20130097135Abstract: A concurrent graph DBMS allows for representation of graph data structures in memory, using familiar Java object navigation, while at the same time providing atomicity, consistently, and transaction isolation properties of a DBMS, including concurrent access and modification of the data structure from multiple application threads. The concurrent graph DBMS serves as a “traffic cop” between application threads to prevent them from seeing unfinished and inconsistent changes made by other threads, and atomicity of changes. The concurrent graph DBMS provides automatic detection of deadlocks and correct rollback of a thread's incomplete transaction when exceptions or deadlocks occur. The concurrent graph DBMS may be generated from a schema description specifying objects and relationships between objects, for the concurrent graph DBMS.Type: ApplicationFiled: October 16, 2012Publication date: April 18, 2013Applicant: PIE DIGITAL, INC.Inventor: PIE DIGITAL, Inc.
-
Publication number: 20130097130Abstract: Method, system, and programs for resolving data inconsistency in a distributed system having a plurality of replica instances. In response to a read request of at least one data element, a key-specific probability value for the at least one data element of the read request is retrieved. Based on the retrieved key-specific probability value and a system load of the distributed system, a self-healing probability of the at least one data element of the read request is computed. A self-healing transaction that includes the at least one data element of the read request is then generated based on the self-healing probability of the at least one data element. The generated self-healing transaction is further applied to at least some of the plurality of replica instances in the distributed system to resolve data inconsistency.Type: ApplicationFiled: October 17, 2011Publication date: April 18, 2013Applicant: YAHOO! INC.Inventors: Tugrul Bingol, Masood Mortazavi, Jacob Y. Levy, Patrick Nip
-
Publication number: 20130097121Abstract: A system restoration apparatus for a portable terminal for changing a system of the portable terminal and easily restoring the changed system to a state before the system is changed in an Operating System (OS) of the portable terminal and a method thereof are provided. The method includes changing a system of the portable terminal, receiving a specific command and displaying a certain information item, and restoring the changed system to a state before the system is changed when at least one of the displayed certain information items is selected.Type: ApplicationFiled: October 12, 2012Publication date: April 18, 2013Applicant: Samsung Electronics Co., LtdInventor: Samsung Electronics Co., Ltd
-
Publication number: 20130097136Abstract: A concurrent graph DBMS allows for representation of graph data structures in memory, using familiar Java object navigation, while at the same time providing atomicity, consistently, and transaction isolation properties of a DBMS, including concurrent access and modification of the data structure from multiple application threads. The concurrent graph DBMS serves as a “traffic cop” between application threads to prevent them from seeing unfinished and inconsistent changes made by other threads, and atomicity of changes. The concurrent graph DBMS provides automatic detection of deadlocks and correct rollback of a thread's incomplete transaction when exceptions or deadlocks occur. The concurrent graph DBMS may be generated from a schema description specifying objects and relationships between objects, for the concurrent graph DBMS.Type: ApplicationFiled: October 16, 2012Publication date: April 18, 2013Applicant: PIE DIGITAL, INC.Inventor: PIE DIGITAL, Inc.
-
Publication number: 20130086000Abstract: Backup operations for data resources can be managed as follows. At least one data resource residing on at least one data storage device is identified. An information processing system automatically determines that the at least one data resource fails to be associated with a backup policy. In response to the at least one data resource failing to be associated with a backup policy, at least one backup policy is associated with the at least one data resource.Type: ApplicationFiled: November 9, 2012Publication date: April 4, 2013Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventor: International Business Machines Corporation
-
Publication number: 20130086004Abstract: A representation of a new rule, defined as a set of a new transition(s), is inserted into a perfect hash table which includes previously placed transitions to generate an updated perfect hash table. This may be done by, for each new transition: (a) hashing the new transition; and (b) if there is no conflict, inserting the hashed new transition into the table. If, however, the hashed new transition conflicts with any of the previously placed transitions, either (A) any transitions of the state associated with the conflicting transition are removed from the table , the hashed new transition is placed into the table, and the removed transitions are re-placed into the table, or (B) any previously placed transitions of the state associated with the new transition are removed, and the transitions of the state associated with the new transition are re-placed into the table.Type: ApplicationFiled: March 1, 2012Publication date: April 4, 2013Inventors: H. Jonathan CHAO, Yang Xu
-
Publication number: 20130080397Abstract: A full backup of a database is created at a first point in time. To restore the database to its state at a second point in time (after the full backup was created), a set of incremental backups, including the incremental backup that corresponds to the second point in time and incremental backups created between the first and second points in time, is used in reverse chronological order. For example, blocks in the full backup can be selectively overwritten with corresponding blocks from the incremental backups in reverse chronological order.Type: ApplicationFiled: September 28, 2011Publication date: March 28, 2013Applicant: SYMANTEC CORPORATIONInventors: Michael A. Payne, Louis Beatty
-
Publication number: 20130080389Abstract: Systems and methods which provide an absent allocation technique with respect to absent data of a data structure for which data migration in a time-displaced data migration operation has not completed are disclosed. Through use of absent allocated data block states of an absent allocation technique of embodiments, dependency between source and destination data stores may be broken. An absent allocated data block state of embodiments stored within the data structure provides a suggestive indication that data of a data block of a data structure is absent from the data structure. A corresponding absent allocated data block state of embodiments stored external to the data structure provides a determinative indication that the data of the data block of the data structure is absent from the data structure. The absent data block determinative indictor of embodiments is updated as data continues to be migrated.Type: ApplicationFiled: September 22, 2011Publication date: March 28, 2013Applicant: NetApp, Inc.Inventors: Jonathan Curley, Richard Jernigan, Ram Kesavan
-
Publication number: 20130080390Abstract: For block level backup, a full image level backup is created of a file system from production storage at a production server to random access storage at a backup server. A mounted image is created from the full image that exposes a block level representation of the file system of the production server for read operations in a file level format. File enumeration is performed on the mounted image for files. Block level read operations are monitored while the files are being enumerated. During monitoring, blocks that are read for the read operations are marked as meta-data blocks. Blocks that are not marked as meta-data blocks are identified as data blocks. The data blocks are migrated to sequential storage, while leaving the meta-data blocks on the random access storage, wherein the data blocks form a backup image.Type: ApplicationFiled: September 23, 2011Publication date: March 28, 2013Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Eran Raichstein, Michael Sternberg, David G. Van Hise, Uri Wolloch
-
Publication number: 20130073532Abstract: A plurality of log processes are synchronized. Each is independently performed in parallel with one another, into a single set of log files. A line buffering mechanism of an operating system (OS) of the computing environment forecloses interleaving of the log processes. Log management operations are concurrently performed by a single process protected by a file-system lock of the OS. The log management operations include at least one of a log compression, log retention, and log rotation operation.Type: ApplicationFiled: September 21, 2011Publication date: March 21, 2013Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Yariv BACHAR, Ron EDELSTEIN, Ehud MEIRI
-
Publication number: 20130073519Abstract: A technique to name data is disclosed to allow preservation of storage efficiency over a link between a source and a destination in a replication relationship as well as in storage at the destination. The technique allows the source to send named data to the destination once and refer to it by name multiple times in the future, without having to resend the data. The technique also allows the transmission of data extents to be decoupled from the logical containers that refer to the data extents. Additionally, the technique allows a replication system to accommodate different extent sizes between replication source and destination while preserving storage efficiency.Type: ApplicationFiled: September 20, 2011Publication date: March 21, 2013Applicant: NetApp, Inc.Inventors: Blake Lewis, John K. Edwards, Vijay Deshmukh, Kapil Kumar, Rajesh Desai
-
Publication number: 20130073521Abstract: In an embodiment, for any structural change that is made to a relational database, a corresponding change is also made to the multidimensional database. In an embodiment, the system determines that a particular structure is not implemented on the multidimensional database system. Based on metadata that defines the structure that is supposed to exist in the multidimensional database, the appropriate structure is created.Type: ApplicationFiled: May 4, 2012Publication date: March 21, 2013Applicant: Oracle International CorporationInventors: Rondy Ng, Robert C. Zwiebach, David Haimes, Djiao Mei Siauw, Gregory David Roth, Arunesh Baneriee, Santosh Kumar Matam, Venkata Ramana Murthy Kosuri
-
Publication number: 20130066837Abstract: A process, apparatus, and computer-readable medium are provided for rebuilding a database session when a previous database session becomes unavailable and the commands previously sent for execution on the previous database session satisfy certain criteria. The process includes determining whether or not a set of commands sent by a client for execution on the previous database session is acceptable to replay based at least in part on whether or not the set of commands satisfies one or more criteria. The process further includes determining that the previous database session is unavailable. In response to determining that the previous database session is unavailable, if the set of commands is acceptable for replay, the set of commands is sent for execution on a new database session to rebuild the state on the new database session. The process masks the outage from the application.Type: ApplicationFiled: September 9, 2011Publication date: March 14, 2013Inventors: Carol L. Colrain, Kevin S. Neel, Tong Zhou, Douglas N. Surber, Stefan Heinrich Roesch, Nancy R. Ikeda
-
Publication number: 20130067587Abstract: An archive of an object set may include various security features that enable a detection of alterations of the contents of the objects. However, the security measures of an archive may fail to detect an inadvertent or intentional alteration of the structure of the object set, including the addition of new objects, changes to the metadata (e.g., the name, position within the object set, and location and size within the archive) of respective objects of the object set, and the deletion of directory entries for the objects. Therefore, an archive may be generated with verifiers (e.g., hashcodes) calculated not only for the contents of objects, but for the directory of the archive, and may be included in the signature of the archive. This verification may extend the detecting of alteration of the archive to include the structure of the archive as well as the contents of the objects contained therein.Type: ApplicationFiled: September 12, 2011Publication date: March 14, 2013Applicant: Microsoft CorporationInventors: Simon Wai Leong Leet, Sarjana Bharat Sheth, Patrick T. O'Brien, JR., Jack R. Davis
-
Publication number: 20130066834Abstract: A replicated database can be provisioned that provides primary and secondary replicas located in different data zones or geographical locations. The database can be installed on the primary replica, and both the primary and secondary replica can include a block level replication mechanism that allows any I/O operation to be replicated between the replicas. Any failure of the primary replica can be addressed by performing a failover operation to the secondary replica. A DNS name or other such approach can be used such that the name can be aliased to the secondary replica during a failover. The creation of the database and provisioning of the replicated instance can be initiated using a Web service call to a control environment. A replicated database can also be scaled according to storage or computing capacity with no disruption of service using a Web service call to the control environment.Type: ApplicationFiled: September 15, 2012Publication date: March 14, 2013Applicant: Amazon Technologies, Inc.Inventors: Grant Alexander MacDonald McAlister, Swaminathan Sivasubramanian
-
Publication number: 20130066854Abstract: A system includes a computer processor that is configured to implement an upper layer stateful application network journaling process. The process includes recording and managing individual client actions on each server in a network. The recording and managing of the individual client actions executes at an application layer of a network protocol stack of the network. The process also includes recording and managing a server status snapshot on a per client basis. The recording and managing of the server status snapshot executes at the application layer of the network protocol stack of the network.Type: ApplicationFiled: September 12, 2011Publication date: March 14, 2013Applicant: Computer Associates Think, Inc.Inventor: Anurag Ojha
-
Publication number: 20130060729Abstract: A user interface for providing emergency and other information to an end user, where the information is stored locally on a portable device. The present invention provides real-time access to disaster and/or critical event pre-planning as well as real-time information correlation related to the management and control of disasters and other emergencies in addition to disaster pre-planning utilizing portable tablet devices. The present invention is an application that resides on a user's portable electronic device such as a tablet, and may be served by push and/or demand from a server or cloud data service. The application includes information related to pre-disaster planning as well as disaster response during an actual emergency or disaster event. The application structure is designed to provide emergency, disaster, and building planning information for both commercial and/or building interests, government and municipalities, and for individuals and families.Type: ApplicationFiled: February 28, 2012Publication date: March 7, 2013Inventor: Curtis Massey
-
Publication number: 20130060742Abstract: Techniques are provided for more efficient multi-row atomic, consistent, isolated and durable (ACID)-compliant transactions with snapshot isolation semantics (or just “multi-row transactions” for short). In some embodiments, the techniques are implemented in a computing system that includes a client application, a lightweight in-memory lease-based lock service, a multi-row transaction orchestrator, and an underlying database system. The transaction orchestrator implements a read protocol and a write protocol that provides support to the client application for carrying out multi-row transactions against the underlying database system irrespective of whether the database system itself supports multi-row transactions. The transaction orchestrator explicitly maintains transaction-level locks obtained from the lease-based lock service as part of the transaction protocol.Type: ApplicationFiled: September 2, 2011Publication date: March 7, 2013Inventors: Allen Chang, John Antonio Carrino
-
Publication number: 20130054541Abstract: A computer implemented method for repairing records of a database, comprises determining a first set of records of the database which violate a functional dependency of the database, determining a second set of records of the database comprising duplicate records, computing a cost metric representing a measure for the cost of mutually dependently modifying records in the first and second sets, modifying records in the first and second sets on the basis of the cost metric to provide a modified database instance.Type: ApplicationFiled: August 26, 2011Publication date: February 28, 2013Applicant: Qatar FoundationInventors: Ihab Francis Ilyas KALDAS, Mohamed YAKOUT, Ahmed K. ELMAGARMID
-
Publication number: 20130054531Abstract: A database management system (DBMS) maintains a clone database in a clone space without storing an entire copy of the database and without requiring a snapshot function from an underlying storage device. This DBMS may receive a database command to access a data block of the clone database, and may determine whether the data block is stored in the clone space. If the data block is not stored in the local clone space, the DBMS may receive the data block from a backup copy of the database. If the database command comprises a write operation, the DBMS may perform the write operation to update the data block, and may store the updated data block in the clone space. Also, if the database command comprises a read operation, the DBMS may perform the read operation on the data block received from the backup copy of the database.Type: ApplicationFiled: August 25, 2011Publication date: February 28, 2013Applicant: ORACLE INTERNATIONAL CORPORATIONInventors: Margaret Susairaj, Sumanta K. Chatterjee