Abstract: An apparatus is disclosed. The apparatus may be implemented in a database node or a storage node and includes one or more processors and memory storing instructions for causing the processor to perform a number of operations. Responsive to a page write request, the apparatus determines an identifier corresponding to the requested page, sends component blocks corresponding to the page to a storage node for appending to an append-only storage log of the storage node, receives the physical location of the stored component blocks, and associates the physical storage location of the stored component blocks with the logical identifier corresponding to the page.

Abstract: A computer program product, system, and computer implemented method for management of a consolidated database and implementing pluggable database recovery with redo filtering in a consolidated database according to some embodiments. Generally, the process includes ongoing activities that maintain activity logs and summarize the activity for respective activity logs (e.g., in an activity vector maintained in a consolidated database catalog). In some embodiments, event-based activities corresponding to recovery processes are triggered by an administrator or an automated process, completed and then do not occur again until another triggering event. The event-based activities can leverage the summary information to quickly determine which online activity logs are relevant to the type of recovery operation for a particular pluggable database.

Abstract: Techniques for distributed database storage utilizing split volume types for redo log records and change log records are described. A database engine sends redo log data to a first set of page storage nodes and change log data to a second set of tuple storage nodes, where the change log data is stored in an indexed manner Client access to change log data may be provided through a separate set of streaming storage servers instead of through the database engine.

Abstract: In an example embodiment, a solution is provided that produces wide tables containing features for machine learned models. These wide tables are made available for model training for multiple models and/or groups. These wide tables may be served on a serving database for fast access for application program interface (API) serving and lightweight access during interactive development. The solution decreases the time needed to add a new feature from several days to a couple of hours by enabling experimentation.

Abstract: Methods and apparati for virtualizing building management systems. An apparatus embodiment comprises a first API for accessing on-premise building management systems; coupled to the first API, a virtualization engine configured to receive and deploy commands to the first API; and coupled to the virtualization engine, a second API configured to receive and deploy commands to the virtualization engine.

Abstract: Disclosed herein is a computer-implemented method of processing a query using a columnstore comprising a plurality of segments, the method comprising: receiving a query comprising a parameter; determining a key corresponding to the parameter; identifying a mapping structure, from a plurality of mapping structures, relating to said key, wherein each mapping structure corresponds to a respective segment of the columnstore; interrogating the identified mapping structure to determine a value corresponding to the key, wherein the value identifies an entry of an index table of a plurality of index tables that corresponds to the respective segment, wherein the entry of the index table identifies a row of the respective segment of the columnstore relating to the parameter; and retrieving data relating to the parameter from a data source based on data stored in the entry of the index table.

Abstract: The disclosed embodiments provide a system that facilitates making updates to a data model, wherein the data model is associated with data items stored in a relational database system. In particular, updates to the data model are automatically propagated to the relational database system so that the structure of the relational database system remains consistent with the data model. This is accomplished by automatically executing queries corresponding to the updates against the relational database system. For example, changes to fields and/or tables in the data model can be automatically propagated to a relational database system by executing “Create,” “Drop,” “Alter,” and/or “Add” statements against corresponding fields and/or tables in the relational database system.

Abstract: Available capacity of resources hosted in different networks may be evaluated to select resources for the performance of a query. A query may be received via an interface for one network. The available capacity of the one network and other networks may be evaluated to select resources hosted in another network to perform the query instead of the resources in the one network. The query may then be routed to the resources in the other network and result of the query performed at the resources in the other network provided.

Abstract: A refreshable PDB clone is associated with a PDB-specific logical timestamp (LT) service that continuously reflects the LT of the most recent changes that have fully committed within the PDB clone during a refresh operation. Such an LT service is used to perform queries over the changing data in the PDB clone while the PDB clone is undergoing a refresh operation. Furthermore, a PDB-specific LT service can facilitate write operations in a standby CDB, where the standby CDB is a physical standby of a source CDB. Specifically, a standby CDB is configured with a private read-write PDB that does not replicate data from the source CDB. This private PDB may accommodate a write operation required by a query over data in the standby CDB. A PDB-specific LT service provides LTs for such a private PDB where the PDB-specific LT service provides LTs to order changes made within the private PDB.

Abstract: Provided are techniques for interpreting invalid data that is a portion of a data set as valid data. A request is received to convert data from a first format to a second format for an application, wherein the data is a portion of a data set. It is determined that the data is invalid, wherein the invalid data cannot be processed by the application in the first format. It is determined whether the invalid data is to be interpreted as valid based on a flag. In response to determining that the invalid data is to be interpreted as valid, setting the invalid data to a new value in the second format that can be processed by the application.

Abstract: In an embodiment, a data storage and retrieval system includes a computing device that configures the computer memory according to an RTree (a type of logic tree) representing a structure of a spreadsheet. The computer memory may be internal to or external to the computing device. In an embodiment, the RTree has a plurality of nodes, at least some of which contain one or more minimum bounding rectangles. Each minimum bounding rectangle (“MBR”) encompasses cells of the spreadsheet from a different one of a plurality of columns of the spreadsheet, but does not encompass cells of any of the other columns of the plurality of columns. A node of the RTree may hold multiple MBRs or a single MBR.

Abstract: Provided are techniques for interpreting invalid data that is a portion of a data set as valid data. A request is received to convert data from a first format to a second format for an application, wherein the data is a portion of a data set. It is determined that the data is invalid, wherein the invalid data cannot be processed by the application in the first format. It is determined whether the invalid data is to be interpreted as valid based on a flag. In response to determining that the invalid data is to be interpreted as valid, setting the invalid data to a new value in the second format that can be processed by the application.

Abstract: A system and method is provided for supporting integrity of distributed data storage with erasure coding. An exemplary method includes receiving a request to create a backup or archive of electronic data using erasure coding, contacting storage nodes and providing an incentive mechanism to incentivize each of the storage nodes to support the distributed data storage, receiving confirmation from at least some of the storage nodes indicating an agreement to store data, generating K data blocks and M parity blocks from the electronic data using erasure coding, and allocating the K data blocks and the M parity blocks to the storage nodes that have agreed to store data.

Abstract: A method makes data available in a motor vehicle. A user query is entered using an input device of the motor vehicle. A plurality of sources are searched for data corresponding to the user query, and the search result associated with the found data is displayed by a display device of the motor vehicle. Respective applications of the motor vehicle are assigned to the search results by a data processing device. The applications are designed to reflect the data formats associated with the search results. Only these applications are displayed by the display device. A corresponding system makes the data available in the motor vehicle.

Abstract: The present disclosure provides a data management method for a database cluster including a first dual port SSD, a second dual port SSD, a first node, a second node, and a third node, where the first dual port SSD is connected to the first node and the second node, and the second dual port SSD is connected to the second node and the third node; and the first node writes a transaction log to the first dual port SSD, when the first node crashes, the second node acquires the transaction log from the first dual port SSD, and operates, according to the transaction log, data that is stored in the first node, so that, the second node or the third node can use a dual port SSD to read log information of the crashed node, and replace the first node to provide a service externally.

Abstract: Technologies are described for facilitating database system recovery in a distributed database environment having a master node and at least one slave node. The at least one slave node receives a preliminary slave log backup position. The at least one slave node replays at least a portion of one or more log backups until the preliminary log backup position is reached. The at least one slave node receives a final slave log backup position. The slave node replays at least a portion of one or more log backups until the final slave log backup position is reached.

Abstract: Embodiment provide that each pluggable database (PDB) in a container database is associated with a distinct distributed lock manager (DLM) domain. Thus, in order to access a PDB, a database server instance joins the DLM domain for the PDB. To perform actions on the PDB, the instance secures locks that belong to the DLM domain for the particular PDB. As such, buffers storing data for the PDB may be managed separately from buffers storing data for other PDBs using the PDB-specific DLM domains. An instance forcefully closing a particular PDB marks the DLM domain of the PDB as invalid, which allows detection of the forceful closure by a recovery instance. Detection of an invalid DLM domain by an instance causes the instance to automatically recover the PDB by accessing pertinent ranges of redo logs and replaying changes made to data blocks for the PDB indicated in the logs.

Abstract: A data store maintaining data may implement reducing input/output (I/O) operations for on-demand data page generation. Log records may be maintained for data pages of data describing changes to the data pages. A coalesce operation may be performed when log records for a data page exceed a coalesce threshold for the data page, applying the log records for the data page to a version of the data page and creating a new version that includes the changes indicated by the log records. An indication may be received to increase the coalesce threshold for a particular data page, delaying a coalesce operation for the data page according to the increased coalesce threshold. The indication may be received from a storage engine that identifies a delay for the particular data page.

Abstract: The disclosed embodiments provide a system that facilitates making updates to a data model, wherein the data model is associated with data items stored in a relational database system. In particular, updates to the data model are automatically propagated to the relational database system so that the structure of the relational database system remains consistent with the data model. This is accomplished by automatically executing queries corresponding to the updates against the relational database system. For example, changes to fields and/or tables in the data model can be automatically propagated to a relational database system by executing “Create,” “Drop,” “Alter,” and/or “Add” statements against corresponding fields and/or tables in the relational database system.

Abstract: Managing database indexes includes creating a main index and creating at least one service index that is configured for recording a change to a node to be updated in the main index. Managing database indexes also includes detecting whether an operation that involves the main index and is performed on the database appears in the database, and maintaining the main index using at least one service index in response to the operation that involves the main index and is performed on the database, appearing in the database. The maintaining is performed based on changes to a node to be updated in the main index that are recorded in the at least one service node.

Abstract: A file system is disclosed that includes an application wide name space instantiated in a global index (Gindex) that is used for accessing objects related to an application. Using the Gindex, a method for cache coherency includes establishing one or more appliances, each defining a storage cluster; establishing one or more tenants spanning across appliances, wherein an application stores objects in file systems associated with the appliances and tenants; establishing a Gindex including metadata relating to objects stored in association with the application; replicating the Gindex to plurality of data centers supporting the tenants; storing an original object at a first data center; storing a cached copy of the object at a second data center; aligning the cached copy using metadata for the object from a local copy of the Gindex.

Abstract: This patent application relates to enhanced logical recovery techniques for redo recovery operations of a system with an unbundled storage engine. These techniques can be implemented by utilizing an enhanced logical recovery approach in which a dirty page table (DPT) is constructed based on information logged during normal execution. The unbundled storage engine can include a transaction component (TC) that is architecturally independent of a data component (DC). These techniques can enhance redo recovery operations by mitigating the resources needed to determine whether previously executed operations sent from the TC to the DC are to be repeated in response to a recovery-initiating event. This can include using the DPT to avoid fetching every data page corresponding to every previously executed operation received by the DC during recovery and/or pre-fetching data pages and/or index pages that correspond to PIDs in the DPT.

Abstract: Systems, methods, and computer readable media for automatically generating Data Definition Language (DDL) commands from database log information is described. In general, techniques are disclosed for analyzing database log entries to identify those associated with targeted DDL commands and associating those entries with a DDL command object. The DDL command object may be used (immediately or at some later time) to generate a DDL commands corresponding to the (possibly many) aggregated log records associated with the command object. The use of multiple database log entries as described herein enables the generation of DDL commands that capture database activity occurring over a period of time (full time context auditing) and can, therefore, naturally account for database schema changes.

Abstract: Embodiments are directed to implementing a transitional redo phase to allow pre-redo phase data access and to determining which data pages including unprocessed transactions are to be processed during a transitional redo phase. In an embodiment, a computer system initiates an analysis phase of a database recovery that scans a database transaction log and builds a dirty page table that includes pages corresponding to unprocessed data transactions. The computer system determines from the dirty page table which pages are to be processed during the transitional redo phase, before the final redo phase. The computer system processes the determined pages during the transitional redo phase, before the final redo phase is reached and, upon completion of the system transaction undo phase, makes available those pages that were processed during the transitional redo phase, as well as those database pages that are not scheduled for processing during the final redo phase.

Abstract: A data portion is evicted from a buffer, where the evicted data portion is modified from a corresponding data portion in a persistent storage. Write elision is applied to suppress writing the evicted data portion to the persistent storage. Subsequent to applying the write elision and in response to reading a version of the data portion, a redo of a modification of the read data portion is applied.

Abstract: A communication system includes a plurality of nodes, the communication system being arranged to assign each of the plurality of nodes a certificate by means of which it can authenticate itself to other nodes in the communication system and periodically distribute to the plurality of nodes an update formed by compressing a data set representing the validity of the certificates assigned to the plurality of nodes. The update is such that a node may not be able to unambiguously determine from the update whether or not a particular certificate is valid. The system further provides the plurality of nodes with a source of information about the validity of the plurality of certificates that is different from the update and by means of which a node may resolve an ambiguity in the update regarding a particular certificate's validity.

Abstract: A database system may include a database service and a separate distributed storage service. The database service (or a database engine head node thereof) may be responsible for query parsing, optimization, and execution, transactionality, and consistency, while the storage service may be responsible for generating data pages from redo log records and for durability of those data pages. For example, in response to a write request directed to a particular data page, the database engine head node may generate a redo log record and send it, but not the data page, to a storage service node. The storage service node may store the redo log record and return a write acknowledgement to the database service prior to applying the redo log record. The server node may apply the redo log record and other redo log records to a previously stored version of the data page to create a current version.

Abstract: A distributed database system may implement fast crash recovery. Upon recovery from a database head node failure, a connection with one or more storage nodes of a distributed storage system storing data for a database implemented by the database head node may be established. Upon establishment of the connection with the storage nodes, that database may be made available for access, such as for various access requests. In various embodiments, redo log records may not be replayed in order to provide access to the database. In at least some embodiments, the storage nodes may provide a current state of data stored for the database in response to requests.

Abstract: A database system may maintain a plurality of log records at a distributed storage system. Each of the plurality of log records may be associated with a respective change to a data page. Upon detection of a coalesce event for a particular data page, log records linked to the particular data page may be applied to generate the particular data page in its current state. Detecting the coalesce event may be a determination that the number of log records linked to the particular data page exceeds a threshold.

Abstract: A method, system and computer program product for low loss database backup and recovery. The method commences by transmitting, by a first server to a third server, a copy of a database snapshot backup, the transmitting commencing at a first time. Then capturing, by the first server, a stream of database redo data, the capturing commencing before or upon transmitting the database snapshot backup, and continuing until a third time. The stream of database redo data is received by an intermediate server after which the intermediate server transmits the stream of database redo data to the third server. Now, the third server has the database snapshot backups and the database redo data. The third server can send to a fourth server all or portion of the database redo data to be applied to the copy of the database snapshot backup restored there to create a restored database.

Abstract: Embodiments are directed to implementing a transitional redo phase to allow pre-redo phase data access and to determining which data pages including unprocessed transactions are to be processed during a transitional redo phase. In an embodiment, a computer system initiates an analysis phase of a database recovery that scans a database transaction log and builds a dirty page table that includes pages corresponding to unprocessed data transactions. The computer system determines from the dirty page table which pages are to be processed during the transitional redo phase, before the final redo phase. The computer system processes the determined pages during the transitional redo phase, before the final redo phase is reached and, upon completion of the system transaction undo phase, makes available those pages that were processed during the transitional redo phase, as well as those database pages that are not scheduled for processing during the final redo phase.

Abstract: Architecture for multi-level undo on a client in grid-based applications. The architecture is a control driven cascading changes system where change tracking works seamlessly in asynchronous (and synchronous) scenarios. A client application is associated with a grid object and, instantiates and configures the grid object. The application can initiate a change to data in the grid and/or the user can edit the data in the grid directly. A result of the change is a notification to the application, the notification including an order key. The application consumes the notification and can then append new changes based on synchronous or asynchronous computations by calling an update function using the order key. The application uses the key to attach further updates which are properly collected together for undo/redo.

Abstract: Website and newsletter operators may only have users' email addresses but not their person names. It can be beneficial for such operators to derive additional information about the email address owners so they can improve their services. However, there is no easy way to retrieve owners' information based on only email addresses. The present disclosure provides information such as the owners' names, professional profiles and aggregated statistics with only a list of email addresses as the input.

Abstract: A method and system of recovery point data view shift through a direction-agnostic roll algorithm is disclosed. The method includes forming a data view around a recovery point, and shifting the data view around the recovery point through a direction-agnostic roll algorithm that uses at least one of a roll-forward algorithm to shift the data view to a time after the recovery point and a roll-backward algorithm to shift the data view to a time before the recovery point. A data integrity is determined to be consistent at the recovery point by examining data and meta-data associated with the recovery point. The recovery point is associated with one of an automatically generated event, a user definable event, and/or a prepackaged event. A marker data is generated at the recovery point to enable the direction-agnostic roll algorithm to reduce a recovery time objective when an algorithm is applied.

Abstract: Deleting a data record from the second level storage or main store is disclosed. A look-up is performed for the data record in the first level storage, where the data record is defined by a row identifier. If the row identifier is found in the first level storage, a look-up is performed for an updated row identifier representing an update of the data record in the second level storage and the main store, the update of the data record being defined by an updated row identifier. If the updated row identifier is found in the second level storage, an undo log is generated from the first level storage to invalidate a row identifier of the row identifier. A flag is generated representing an invalid updated row identifier, and a redo log is generated to restore the data record in the first level storage.

Abstract: In an approach, a database server maintains a container database which comprises: one or more pluggable databases, a root database that stores an undo log for rolling back transactions on the consolidated database, and a redo log for replaying modifications to the container database. The database server restores a particular pluggable with a backup version that corresponds to a first point in time. The database server generates a clone database loaded with a backup version of the root database that corresponds to the first point in time. The database server applies the redo log to recover the particular pluggable database and the clone database to a second point in time that is later than the first point in time. The database server identifies, based on the clone database, one or more active transactions on the particular pluggable database. The database server rolls back the one or more active transactions.

Abstract: Techniques for maintaining a cascading index are provided. In one approach, one or more branch node compression techniques are applied to the main index of a cascading index. In an approach, a Bloom filter is generated and associated with, e.g., a branch node in the main index. The Bloom filter is used to determine whether, without accessing any leaf blocks, a particular key value exists, e.g., in leaf blocks associated with the branch node. In an approach, a new redo record is generated in response to a merge operation between two levels of the cascading index. The new redo record comprises (a) one or more addresses of blocks that are affected by the merge operation, (b) data is that being “pushed down” to a lower level of the cascading index, and (c) one or more addresses of blocks that are written to storage as a result of the merge operation.

Abstract: Systems and methods for managing copies of database data. For instance, in one configuration, prior to the database transactions being committed on either of the source data base and the target database, a first copy of the database can be stored on a target system. Subsequent to said generating the first copy, the data transactions are committed into the target database, and a second copy of the target database is created. Then the target database can be reverted back to a state in which the target database existed at the time of said generating the first copy. The second copy can be accessed without the use of the database application.

Abstract: A system and method are provided to perform tentative updating for transactions using the Web Services Reliable Messaging protocol. From a protocol layer of a client side web services framework persists a message from an application transaction (a reversion message) in a persistent storage unit. The web services framework forwards the reversion message as a reliable message to a transport layer to cause a recipient to revert to a state prior to the application transaction, if a triggering event occurs in the web services framework. If no triggering event occurs a confirmation message is forwarded as a reliable message to confirm receipt of the tentative update at the transport layer. Concurrently with the confirmation persisted reversion message is deleted from the persistent storage unit.

Abstract: A system and method for a non-sequential undo mechanism is presented. An action removal manager stores program states and action descriptions that it receives from a user in a program log corresponding to a software application. In turn, the action removal manager allows the user to remove an action from the program log without first removing actions subsequent to the action that, as a result, undoes an action to a file without undoing subsequent actions to the file. In one embodiment, the undo request includes a request to remove two or more actions from the program log. In this embodiment, the action removal manager evaluates the earliest action description to remove in the program log and then proceeds to evaluate subsequent action descriptions for removal.

Abstract: Processing proposed changes to data includes notifying a server of a proposed change to master data, receiving, from the server, an indication as to whether there is a concurrent change to the master data, where the concurrent change corresponds to a change to the master data in addition to the proposed change, and deciding whether to make the proposed change or to abort the change.

Abstract: A method and systems of a time ordered view of backup data on behalf of a host are disclosed. In an embodiment, a method to provide a time-ordered snapshot view on behalf of a host of a specified portion of a backup of a first storage system data container stored at a second storage system includes initiating an order at the host to obtain a view of a data container. The order specifies a date and time of the ordered view. The method further includes receiving the order at a server adapted to assemble and enable access to the ordered view, and at the server, accessing the second storage system according to the date and time of the ordered view and accessing an applicable data write representing a data change to the data container.

Abstract: A method is disclosed for reliably updating a data group in a read-before-write data replication environment. The method reliably updates the data group by receiving an updated data group sent from a first storage medium to a second storage medium, comparing the updated data group with a previous data group previously existing on the second storage medium and writing the updated data group to the second storage medium. The read-before-write and differencing method disclosed maintain reliability by storing multiple copies of changes made to the second storage medium during and after the write process.

Abstract: In an integrated management database system having a plurality of element databases holding the configuration information about an information system and an integrated database for integrally managing the element databases, an element database which cannot return a reply while maintaining a secure state in response to an update request is not informed of the update request in the first phase of a two-phase commit, thereby attaining synchronization when data is updated, and maintaining the consistency of the data in the system.

Abstract: Disclosed are methods and apparatuses to provide a redo repeater that allows for no data loss protection without the performance impact to the primary database even when a significant geographical distance separates the primary and standby databases. The Repeater is a lightweight entity that receives redo from the primary database with the purpose of redistributing that redo throughout the primary/standby system configuration. The Repeater able to extend no data loss protection and switchover functionality to terminal standby databases even though the primary database does not need to have a direct connection with those destinations.

Abstract: Disclosed are methods and apparatuses to provide a redo repeater that allows for no data loss protection without the performance impact to the primary database even when a significant geographical distance separates the primary and standby databases. The Repeater is a lightweight entity that receives redo from the primary database with the purpose of redistributing that redo throughout the primary/standby system configuration. The Repeater able to extend no data loss protection and switchover functionality to terminal standby databases even though the primary database does not need to have a direct connection with those destinations.

Abstract: Methods, software suites, and systems of generating a recovery snapshot and creating a virtual view of the recovery snapshot are disclosed. In an embodiment, a method includes generating a recovery snapshot at a predetermined interval to retain an ability to position forward and backward when a delayed roll back algorithm is applied and creating a virtual view of the recovery snapshot using an algorithm tied to an original data, a change log data, and a consistency data related to an event. The method may include redirecting an access request to the original data based on a meta-data information provided in the virtual view. The method may further include substantially retaining a timestamp data, a location of a change, and a time offset of the change as compared with the original data.

Abstract: 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.

Abstract: An image outputting apparatus obtains attribute information about image data prior to acquisition of the image data stored in an external apparatus. The image outputting apparatus accepts an output request of the image data by using the attribute information while obtaining the image data. The image outputting apparatus holds the output request in accordance with the acceptance of the output request before completion of acquisition of the image data and allows the outputting the image data in response to the output request after acquisition of the image data has been completed.

Abstract: This invention involves tracking and backing all the information that a user generates on its computer devices (including embedded devices) in real time. The local user server records all user actions and gestures (via various means that include TV cameras). All of this information (user actions and saved files in a computer) is then sent to a remote server via the Internet. This remote server has a virtual map of all the embedded devices on a computer that the person uses. The remote server immediately starts to interpret the user's actions (including user gestures). In one implementation, the invention stores user actions that are related to data generation (e.g. actions that called some links where data is stored, or executed some programs that generated data). In another variant the remote server generates and downloads the same files that are downloaded on the local user computer devices.