Abstract: There are provided computer systems and methods for performing componentized data storage. Such a system includes a hardware processor, a system memory, and a data componentization unit including a data resolution module and a data archiving module stored in the system memory. The hardware processor is configured to execute the data componentization unit to receive a data file including multiple data types, and to transform the data file into data components corresponding respectively to the multiple data types. The hardware processor is further configured to execute the data componentization unit to generate database entries each including one of the data components, and to store each of the database entries in one of multiple databases based on the data type corresponding to the data component included in the database entry.

Abstract: In order to create, at another site, a backup of a volume at a specific time point while minimizing the response time required to update the volume, a first storage apparatus and a second storage apparatus transfer a journal in a first journal volume to the second storage apparatus, the second storage apparatus writes the transferred journal into a second journal volume, the second storage apparatus reads journals in the second journal volume in order of the update, the second storage apparatus reflects the read journals to a second data volume, the first storage apparatus creates, in the first journal volume, a journal including a marker when a specific condition is satisfied, and the second storage apparatus creates a snapshot of the second data volume upon detecting a marker in the read journal.

Abstract: The present disclosure involves systems, software, and computer implemented methods for deploying changes to key patterns in database systems. One example method includes receiving a new shared container that includes a new key pattern for a logical split table and an updated read-only-portion physical table for a logical split table. The updated read-only-portion physical table includes records that match a complement of the new key pattern. Records that match the new key pattern are identified in the read-only-portion physical table of the logical split table in a current shared container. The identified records are moved from the read-only-portion physical table in the current shared container to a writable-portion physical table in a tenant container. Records not matching the new key pattern are deleted from the writable-portion physical table of the logical split table in the tenant container.

Abstract: Aspects of the invention include receiving data that includes a group of n symbols to be written to a plurality of storage units. The group of symbols is mapped into a codeword of n+k symbols, each assigned to one of the storage units. The codeword is configured to allow at least one of the n symbols to be reconstructed using a subset of the n+k symbols. At least one of the n+k symbols is assigned to one of the storage units based at least in part on content of the at least one of the n+k symbols. Writing each of the n+k symbols to its assigned storage unit in the plurality of storage units is initiated. The writing includes optimizing storage capacity of the assigned storage unit based at least in part on determining that the symbol has the same content as another symbol previously stored in the storage unit.

Abstract: Approaches for a model-driven tool-agnostic reporting approach are provided. In one example, a report request is received from a business intelligence reporting application, from which a graphical template and query template are created, wherein the graphical template comprises the visual presentation of data responsive to the request and the query template specifies how the data responsive to the request is to be computed. The report created by the approaches described herein is compatible with multiple business intelligence reporting applications.

Abstract: Systems and methods of network telemetry caching and distribution are provided. The system can receive network telemetry data and store it as a plurality of data nodes. The system can maintain a node pointer map and a node pointer queue. If the system receives an update to a data node having a corresponding node pointer not already present in the node pointer map, the system can add the node pointer to the node pointer queue and to the node pointer map with a count of zero. If the node pointer is already present in the node pointer map, the system can increment the node count for the node pointer in the node pointer map and not add the node pointer to the node pointer queue. The system can transmit data values and node counts to the client device for each node pointer in the node pointer queue.

Abstract: Disclosed are methods, systems and computer program products for backing up user data from a social network account. An exemplary general method includes the steps of obtaining access to a user account on a social network, by a social network application; determining, by the social network application, one or more restrictions on external requests for data imposed by the social network; generating, by a backup agent in communication with the social network application, an algorithm for requesting data from the user account based upon the one or more restrictions on external requests for data; requesting user data from the user account, by the social network application, using the algorithm; receiving the user data from the user account, by the social network application; transmitting the received user data from the social network application to the backup agent; and archiving the received user data, by the backup agent.

Abstract: A message distribution system replicates a collection of messages across multiple regional data centers. When any of the data centers receives a message for distribution from an authorized publisher, it transmits the message to each of the other data centers so that the collection of messages is immediately replicated among each data center. When any data center determines that a subscriber is connected to it, that data center determines which messages in the data collection the subscriber is authorized to receive, and it automatically sends those messages to the subscriber.

Abstract: Snapshot Isolation (SI) is an established model in the database community, which permits write-read conflicts to pass and aborts transactions only on write-write conflicts. With the Write Skew Anomaly (WSA) correctly eliminated, SI can reduce the occurrence of aborts, save the work done by transactions, and greatly benefit long transactions involving complex data structures. Embodiments include a multi-versioned memory subsystem for hardware-based transactional memory (HTM) on the GPU, with a method for eliminating the WSA on the fly, and incorporates SI. The GPU HTM can provide reduced compute time for some compute tasks.

Abstract: In order to perform relatively frequent, zero-downtime software updates, a bridge schema corresponding to an original schema of a database system may be generated. Within the bridge schema, a plurality of views corresponding to a plurality of database tables of an application executing on an application server may be generated. A connection from the application to the original schema may be changed to the bridge schema, to thereby continue executing the application using the plurality of views. When a change file defining update changes to at least one original database table of the plurality of database tables is received, content of the at least one original database table may be synchronized with a target table reflecting the update changes. Then, the connection may be changed back to the original database schema to continue executing the software application, using the plurality of database tables and including the target table.

Abstract: A development maintenance (Dev-Maintain) computing system is upgraded from a release version n to a release version n+1, where a production (Prod) computing system is on the release version n, and a development preview (Dev-Preview) computing system is on the release version n+1. Changes are transported from the Dev-Preview computing system to the Dev-Maintain computing system. Inactive changes transported from the Dev-Preview computing system into the Dev-Maintain computing system are merged to generate merged changes. The merged changes are transported to the Dev-Preview computing system. A release version upgrade is performed to the Prod computing system and to the Dev-Preview computing system. Active changes are transported from the Dev-Maintain computing system to the Prod computing system.

Abstract: Concepts for managing code copied from a source repository to a target repository are proposed. Example embodiments comprises generating metadata relating to code copied from the source repository. At the target repository, source repository is monitored to determine if the code copied from the source repository has been modified within the source repository based on the metadata. Responsive to determining the code copied from the source repository has been modified within the source repository, a notification relating to the modification is generated at the target repository.

Abstract: One example is a system including a plurality of summarization engines, an evaluator, and a selector. Each of the plurality of summarization engines receives content to provide a summary of the content. The evaluator determines a value of each summary for a selected task. The selector selects a summarization engine for the selected task based on the assessed value of each summary.

Abstract: A data storage management approach is disclosed that performs backup operations flexibly, based on a dynamic scheme of monitoring block changes occurring in production data. The illustrative system monitors block changes based on certain block-change thresholds and triggers block-level backups of the changed blocks when a threshold is passed. Block changes may be monitored in reference to particular files based on a reverse lookup mechanism. The illustrative system also collects and stores historical information on block changes, which may be used for reporting and predictive analysis.

Abstract: A cache that can be stored in a user partitioned region of storage and utilized to reduce the amount of time required to present content responsive to content requests is described. A request for content associated with a region of a user interface can be received and data corresponding to a list item in a cache can be accessed. Content associated with the data can be presented in the region of the user interface via a same presentation as a most recent presentation of the content. At a time subsequent to when the content is initially presented in the region, new data associated with the list item can be retrieved. In examples where the new data corresponds to updated data, the presentation can be modified based partly on the updated data and the new data can be written to the cache in a location corresponding to the list item.

Abstract: A method a dispersed storage network (DSN) begins by detecting a missing encoded data slice storage error associated with a current revision of a storage resource mapping, where storage resources of the DSN are selected for storage of encoded data slices in accordance with a distributed agreement protocol function on an identifier of the encoded data slices utilizing the current revision of the storage resource mapping. The method continues by accessing, for one or more previous revisions, a storage resource mapping history to identify a next oldest revision of the storage resource mapping. The method continues by determining, for a location cycle, whether the missing encoded data slice is available from a previous storage resource in accordance with the identified next oldest revision of the storage resource mapping and when locating the data within the previous storage resource, facilitating migration of the missing encoded data slice.

Abstract: Computerized methods and systems receive neutralized data items on a first entity from a second entity over a network by receiving a first data item from the second entity. A security protocol that applies rules and policies is applied to the first data item to create a second data item that is a neutralized version of the first data item. The first data item and the second data item are converted into comparable forms. The second data item is analyzed against the first data item by comparing the comparable forms to form at least one comparison measure. The second data item is received on the endpoint if the at least one comparison measure satisfies a threshold criterion. The security protocol is modified to adjust the applied rules and policies if the at least one comparison measure does not satisfy the threshold criterion.

Abstract: The disclosed embodiments provide a system for evaluating a performance of a mobile application. During operation, the system obtains a first set of data associated with adopters of a new version of a mobile application in a partial rollout of the new version and a second set of data associated with non-adopters of the new version in the partial rollout. Next, the system applies a statistical model to the first and second sets of data to select a subset of the non-adopters as potential adopters of the new version. The system then reduces a bias in a quasi-experimental design associated with the mobile application by using the first set of data and a third set of data associated with the potential adopters to estimate an average treatment effect (ATE) between the new version and an older version of the mobile application.

Abstract: In one example, a method may include generating, by a computing device, a volume as a file in memory, where the volume may be based on an operating system (OS) image. The method may include attaching the file to a workload, booting the workload using the OS image, generating a version of the file with at least one block that underwent change and metadata associated with the change based on an input/output request to the volume, storing, by the computing device, the file and the version of the file on a storage device associated with the computing device, and recovering a version of the volume associated with the workload using the file and the version of the file stored in the storage device.

Abstract: In one aspect, a computer-implemented method for ensuring a source database (e.g., target space or index space) has correct version information before a migration includes executing, using at least one processor, instructions recorded on a computer-readable storage medium. The instructions include determining whether a table has been changed since a most recent alter of the table, performing an update on the table when it is determined that the table has not been changed since the most recent alter, and performing a rollback on the table after the update. The method may also include creating an image copy of the data in the source database and refreshing data in a target database with the image copy of the data in the source database. The method may also include automatically repairing the target database when the version information of the target does not correspond with the version information for the source.

Abstract: Systems and methods are disclosed herein for modifying suggestion metadata in an electronic document. A copy request is received to copy a portion of the electronic document. The portion of the electronic document includes a first suggestion having metadata that indicates the suggestion was made by a first user. The copy request is received from a second user. A paste request to paste the copied portion is received from the second user. The metadata of the suggestion is modified based on the paste request to obtain modified metadata.

Abstract: Synchronizing snapshots between storage systems, including: receiving, from a source storage system, an identification of a snapshot to be replicated to a destination storage system; identifying, from hint information stored on the destination storage system, a most recent version of the snapshot that is stored on the destination storage system; issuing, to the source storage system, a request for an identification of the differences between the snapshot to be replicated to the destination storage system and the most recent version of the snapshot that is stored on the destination storage system; receiving, from the source storage system, the identification of the differences; and issuing a request to transfer, from the source storage system to the destination storage system, data associated with the differences.

Abstract: Systems and methods that enable removal of data from an endpoint, while not propagating such removal to other endpoints when synchronizing data sources associated therewith. A designation component can indicate items as forgotten items, wherein such items are being known to an endpoint and deleted therefrom—yet, reintroduced therein and reappearing (e.g., as a create) upon re-synchronizing with the replica over again. Moreover, the forgotten items can employ additional metadata such as in from of an additional bit that indicates whether an item is a forgotten item.

Abstract: A remote distributed data store may be configured to process data updates received through invocation of a common API with reference to a common schema. A local data store may also be configured to process updates through the common API with reference to the common schema. Updates to the local data store may be mapped from the local data store schema to the common schema, and applied to the distributed data store. Updates to the distributed data store may be mapped from the common schema to the local data store schema. User identity may be verified to limit data synchronization to authorized users.

Abstract: A method, system, and manufacture for authorizing an untrusted client device for access on a content management system. The content management system receives a request from an untrusted client device to access content on the content management system. The content management system sends an authentication key to the untrusted client device. The content management system then receives the authentication key from a trusted client device. Based on the matching authentication key, the content management system transmits data to the untrusted client device in accordance with any additional instructions that the trusted client device may have sent.

Abstract: Various techniques for detection of malware using an instrumented virtual machine environment are disclosed. In some embodiments, detection of malware using an instrumented virtual machine environment includes instantiating a first virtual machine in the instrumented virtual machine environment, in which the first virtual machine is configured to support installation of two or more versions of a resource; installing a first version of the resource on the first virtual machine and monitoring the instrumented virtual machine environment while executing the first version of the resource with a malware sample opened using the first version of the resource; and installing a second version of the resource on the first virtual machine and monitoring the instrumented virtual machine environment while executing the second version of the resource with the malware sample opened using the second version of the resource.

Abstract: Methods and apparatus, including computer program products, implementing and using techniques for data replication in a cluster. In response to identifying data to replicate in a multi-node system by a first node in a cluster, the data is written concurrently to other nodes in the cluster based on a rule set in a repository. In response to detecting a criterion described in the rule set, an action is performed.

Abstract: The approved email generation system described is capable of producing email communications using approved email templates and content that have been aligned with information regarding user access to such content. Once the approved email has been generated, the content may be verified again for accuracy and validity before being delivered to the user. When the user accesses delivered content, the approved email generation system again verifies the content and allows the user access to only the most current version of the content available. The system provides for control of the content of electronic communications to users.

Abstract: In a process synchronization control system for performing a synchronization process of synchronizing a process among redundant channels, each of the channels includes an input unit; an output unit; a processing unit; a process execution timer which is used for executing a process in the channels; and a waiting time measurement timer which measures a waiting time in the synchronization process, in which the processing unit executes: a synchronization signal output process of outputting the synchronization signal to other channels at the start of the synchronization process; a synchronization signal input process of waiting for the synchronization signal input from the other channels until a predetermined waiting time by the waiting time measurement timer elapses; and a timer synchronization process of synchronizing the process execution timer if the synchronization signal of the other channels is input after the elapse of the waiting time.

Abstract: Methods and apparatus for resource silos at network-accessible services are disclosed. A subset of resources used for a database service, including at least one resource from each of a plurality of data centers, is selected for membership in a resource silo based on grouping criteria. A silo routing layer node identifies the resource silo as the target silo to which a client work request is to be directed. The client work request is sent to a front-end resource of the target silo either by the client, or by the silo routing layer node on behalf of the client. The front-end resource of the target silo transmits a representation of the work request to a back-end resource of the target silo, where a work operation corresponding to request is performed.

Abstract: Aspects of the present invention relate to techniques for providing a user with access to a service provided by a cloud infrastructure system based on an existing service. A user may be provided with a clone subscription based on a base subscription to an existing service provided by the cloud infrastructure system. A clone subscription can provide the user with an environment (e.g., a service) that is designated for one use (e.g., development and testing) different from another use (e.g., production) designed for a base subscription. Changes made to a base subscription may be propagated to the clone subscription based on rules. A clone subscription can be modified to vary the clone configuration independently from the base configuration.

Abstract: This invention discloses a novel system and method for determining the geneology of versions of a document by inspection of content extracted from the document. In one embodiment that is compatible with Microsoft™ Word ™, the invention extracts the RSID values from each version of a document and then applies logical rules to the extracted set of RSID values to determine which versions are ancestors of the other versions.

Abstract: Systems, methods, and software for operating a content delivery system are provided herein. In one example, a method includes, in a first content delivery node, receiving a purge instruction to purge first content stored in the first content delivery node and responsively purging the first content. Responsive to purging the first content, the method includes transferring a content request for delivery to a second content delivery node, where the content request comprises a request for second content to replace the first content and a revision indicator of the first content. Responsive to the content request, the method includes receiving the second content for storage in the first content delivery node.

Abstract: Embodiments are directed to perfect physical garbage collection (PPGC) process that dynamically estimates duplicate containers using a Bloom filter-based dead vector by scanning an index containing a mapping of fingerprints to a container ID for a plurality of containers; returning, for each fingerprint, a fingerprint sequence associating each fingerprint with a respective unique container ID, wherein a last entry of the sequence is preserved and the remaining entries are considered duplicates; and maintaining a duplicate array of counts of the duplicates indexed by container IDs, and wherein the duplicate array comprises a duplicate counter that keeps track of a number of live duplicated segments for each container, and further wherein a live segment is a live duplicate segment if a segment with a same fingerprint exists in another container with a higher container ID.

Abstract: Embodiments are directed to perfect physical garbage collection (PPGC) process that uses a perfect hash vector instead of large Bloom filters of the regular physical garbage collection process for the live and live instance vectors and consolidates both into a single live vector using the perfect hash vector. A method of PPGC includes an analysis phase walking an index containing a mapping of fingerprints to a container ID for a plurality of containers and building a perfect hash function for a walk vector and a live vector, wherein the live vector uses a perfect hash vector, an enumeration phase inserting live segments in memory into the perfect hash vector, a select phase traversing the plurality of containers and selecting containers that meet a defined liveness threshold and a copy phase copying live segments out of the selected containers.

Abstract: There is provided a server apparatus including a storage unit configured to store setting information used by a client apparatus to operate, a reception unit configured to receive, from a first client apparatus, a deletion request for deleting a part of the setting information from among the setting information stored in the storage unit, a notification unit configured to notify a second client apparatus of update information indicating that the part of the setting information for which the deletion request has been made is deleted, and a control unit configured to perform control in such a manner that the update information remains to be stored in the storage unit until a predetermined condition is satisfied after the deletion request is received, and is deleted from the storage unit in accordance with a satisfaction of the predetermined condition.

Abstract: Techniques are described for determining test cases to test a service, such as a service to manage a purchase contract in an e-commerce environment. Log data may be generated during execution of the service to process requests, the log data indicating a plurality of code segments that executed during the execution of the service. The log data may be analyzed to generate metrics data comprising a plurality of records corresponding to the processed requests. A record may include any number of counters that each indicates whether, or how many times, a particular code segment executed during processing of a request. The metrics data may be analyzed to identify a subset of records comprising representative combinations of the counters in the metrics data. The requests corresponding to one or more of the subset of records may be replayed to test the service.

Abstract: Techniques are provided for determining costs for alternative execution plans for a query, where at least a portion of the data items required by the query are in in-memory compression-units within volatile memory. The techniques involve maintaining in-memory statistics, such as statistics that indicate what fraction of a table is currently present in in-memory compression units, and the cost of decompressing in-memory compression units. Those statistics are used to determine, for example, the cost of a table scan that retrieves some or all of the necessary data items from the in-memory compression-units.

Abstract: A method of dynamically computing an optimal materialization schedule for each column in a column oriented RDBMS. Dynamic column-specific materialization scheduling in a distributed column oriented RDBMS is optimized by choosing a materialization strategy based on execution cost including central processing unit (CPU), disk, and network costs for each individual exchange operator. The dynamic programming approach is computationally feasible because the optimal schedule for a sub-plan is path independent.

Abstract: The logging of tasks associated with multiple transactions in the context in which the computing system is capable of having multiple of the transactions active at a given time, and thus in which the order of completion of the transactions is not guaranteed to be the same as the order of initiation of the transactions. A sequence of transaction segment records is added to the log. Each transaction segment record comprises a transaction identifier range that does not overlap with the transaction identifier range in any of the sequence of transaction segment records including the transaction identifier range of any neighboring transaction segment record in the sequence of transaction segment records. Each transaction segment record also includes a log entry identifier range extending from the first task of the first of the transactions to be initiated to the last task of the last transaction to complete.

Abstract: An image forming apparatus capable of executing update processing for updating firmware, comprises: a setting unit which sets either a first setting indicating that the update processing is executed periodically or a second setting indicating that the update processing is executed at a particular date/time rather than periodically; an obtaining unit which obtains update firmware for updating; an extraction unit which executes extraction processing for extracting the update firmware; a determination unit which determines, in a case where the extraction processing is interrupted due to a power-off and the image forming apparatus re-boots, whether the first setting or the second setting is set by the setting unit; and a deciding unit which, based on a result of the determination by the determination unit, decide whether or not to re-execute the extraction processing.

Abstract: A multi-version concurrency control method in a database and a database system, where the database system sets a data page link of a page, where the data page link includes a page pointer, and a page pointer is used to point to another version page prior to a last operation on the version page. Hence, when a page in the database is read, and when a timestamp of a current version page is greater than a timestamp of a read transaction, page-level rollback may be directly performed according to a data page link of the page that is requested to read to roll back to a page that needs to be read, which facilitates queries for data on each version page in the database, and the database system may implement record rollback efficiently.

Abstract: A method for creating an inconsistent backup and then a consistent backup is described. The method may include creating an inconsistent, full backup of a storage device. The method may further include creating a first snapshot of the storage device. The method may also include creating a consistent backup increment of the storage device based on the first snapshot. Additionally, the method may include adding the consistent backup increment to the inconsistent, full backup.

Abstract: A parallel computer system includes computing nodes to execute a parallel program for generating computing processes that perform computations and monitoring processes and forming a monitoring hierarchical structure, each monitoring process monitors a monitoring process and a computing process arranged immediately lower than the monitoring process, each of the computing nodes operating as the computing process when the computing process is allocated to the computing node and operating as the monitoring process when the monitoring process is allocated to the computing node.

Abstract: An approach for enabling collaborative development of a database application is provided. Specifically, this approach provides a database development and collaboration tool (DDCT), which can be utilized by multiple developers involved in a particular software project, to enable automated synchronization and database version control by allowing a database development language and data changes to be stored in a metadata form that is general to more than one database management system (DBMS). Each developer is united and able to collaborate through the system, thus ensuring that a change to a database structure and/or data in a static data table created in a particular database language by one developer is automatically incorporated in the overall development process. Furthermore, the DDCT provides the opportunity to maintain a single repository entry for more than one DBMS, which simplifies synchronization.

Abstract: A system, a method and a computer program product for performing a copy procedure are disclosed. A copy procedure that copies a table in a plurality of tables stored at a source system to a target system is initiated. At least one table in a plurality of tables stored at the source system is selected for copying from the source system to the target system. A trigger table containing at least one trigger is generated. The trigger indicates at least one change made to the at least one selected table. The trigger table is copied from the source system to the target system. The selected table is copied from the source system to the target system. Using the copied trigger table, changes are applied to the table copied to the target system.

Abstract: The different advantageous embodiments provide a method for identifying changes in data sets. An ending version for a data set is received. A beginning version for the data set is identified. The ending version for the data set is compared with the beginning version for the data set. A number of differences is calculated between the ending version and the beginning version. A data structure is created that identifies the number of differences between the ending version and the beginning version.

Abstract: Systems, methods, apparatuses, and computer program products for automatically switching to D2D communication in a disaster situation is provided. One method includes receiving, by a user equipment, a list of base station sites comprising locations and geographical signal coverage of the base station sites and a list of Wi-Fi access points comprising locations and geographical signal coverage of the Wi-Fi access points. The method may also include creating at least one local database storing information received in the list of base station sites and the list of Wi-Fi access points.

Abstract: A heterogeneous computing system described herein has an energy-efficient architecture that exploits producer-consumer locality, task parallelism and data parallelism. The heterogeneous computing system includes a task frontend that dispatches tasks and updated tasks from queues for execution based on properties associated with the queues, and execution units that include a first subset acting as producers to execute the tasks and generate the updated tasks, and a second subset acting as consumers to execute the updated tasks. The execution units includes one or more control processors to perform control operations, vector processors to perform vector operations, and accelerators to perform multimedia signal processing operations. The heterogeneous computing system also includes a memory backend containing the queues to store the tasks and the updated tasks for execution by the execution units.

Abstract: Disclosed herein are system, method, and computer program product embodiments for performing garbage collection in a database management system with a multi-version concurrency control. An embodiment operate by qualifying a multi-version concurrency control (MVCC) block for garbage collection, where the MVCC block includes multiple cells, each cell corresponding to a row of a table that was acted on by a transaction. Determining that the MVCC block can be garbage collected based on MVCC information in the MVCC block, where the MVCC information includes information that determines whether changes made to rows in the multiple cells are visible in a database management system. Based on the determining, garbage collecting the MVCC block.