Abstract: In some embodiments, an apparatus includes a memory associated with an instance of a distributed database at a compute device configured to be included within a first group of compute devices. The apparatus is configured to determine an order for each event from the set of events based on different configurations of an event consensus protocol. The different configurations are logically related to different configurations of compute devices that implement the distributed database. The apparatus is configured to determine a current state of the instance of the distributed database based on the order determined for each event from the set of events and generate a signed state associated with the instance of the distributed database based on a hash value associated with the current state. The apparatus sends a signal to post into the instance of the distributed database an event that includes a transaction indicative of the signed state.

Abstract: A method, and associated computer program product and mobile computing device, for backing-up information stored in the mobile computing device. The mobile computing device detects one or more support computing devices located within a corresponding communication range and being available to support the mobile computing device for backing-up the information stored in the mobile computing device. The mobile computing device detects a dangerous condition indicative of a risk of inoperability of the mobile computing device. The mobile computing device sends back-up information corresponding to selected information stored in the mobile computing device to at least one of the support computing devices in response to the detection of the dangerous condition to cause the at least one support computing device to upload the back-up information to a back-up computing system.

Abstract: A unified access layer (UAL) and scalable query engine receive queries from various interfaces and executes the queries with respect to non-heterogeneous data management and analytic computing platforms that are sources of record for data they store. Query performance is monitored and used to generate a query performance model. The query performance model may be used to generate alternatives for queries of users or groups of users or to generate policies for achieving a target performance. Performance may be improved by monitoring queries and retrieving catalog data for databases referenced and generating a recommendation model according to them. Duplicative or overlapping sources may be identified based on the monitoring and transformations to improve accuracy and security may be suggested. A recommendation model may be generated based on analysis of queries received through the UAL. Transformations may be performed according to the recommendation model in order to improve performance.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium for managing a relationship between content and an environment for provisioning the content. In one aspect, a method includes receiving a request for a content item; and in response to receiving the request: selecting a creative from a plurality of creatives, the creative including a reference to a profile associated with one or more elements; retrieving content data from one or more content feeds bound to the elements; and delivering the creative and the content data to a user device.

Abstract: The present invention ensures improving responsiveness in a P2P type distributed database system that includes a plurality of node computers capable of storing management target data in storage devices. The storage devices include a first type storage device having a high input/output performance and a second type storage device having a low input/output performance. There is provided the storage devices that store KeySpace management tables including response count information indicative of a count of the node computers from which the identical management target data are to be read. The identical management target data are required to respond to a read request of the management target data. The node computers by a count indicated by the response count information and capable of storing the management target data in the first type storage devices among the plurality of node computers are determined as storage destinations when a CPU receives a write request of new management target data.

Abstract: Techniques described herein create a sharding environment from existing independent databases, use the sharding environment to issue cross shard queries, create “on all shards” new objects, and create and “on all shards” new users that will have permission to access the data across all database shards.

Abstract: Techniques for the dynamic slotting of content items within electronic content are provided. In response to receiving a request, a first set of content items is identified and a first score is generated for each based on a first objective. Based on the first scores, a first ranking of the first set of content items is generated. A subset of the first set is selected based on the first ranking. A second set of content items that includes the subset is identified and a second score is generated for each item in the second set based on a second objective that is different than the first objective. Based on the second scores, a second ranking of the second set is generated. A subset of the second set is selected based on the second ranking. The second subset is presented on a computing device that is associated with the request.

Abstract: According to some examples, computer-implemented methods to detect a potential privacy violation as a result of a release of a database are described. An example computer-implemented method may include anonymizing a database and calculating a measure of entropy resulting from a release of the anonymized database without releasing the anonymized database. The method may also include determining whether the calculated measure of entropy satisfies a privacy threshold and, responsive to a determination that the calculated measure of entropy satisfies the privacy threshold, releasing the anonymized database. The method may further include, responsive to a determination that the calculated measure of entropy does not satisfy the privacy threshold, not allowing the release of the anonymized database.

Abstract: A system, method and computer program product for accessing content based on an image. The method comprises comparing an image to a database of images, each of the images of the database being associated with at least one corresponding audio track, identifying those ones images of the database that correspond to the image, and identifying the at least one corresponding audio track that corresponds to the identified images. In one example aspect, the method also comprises presenting the audio track to a user. Corresponding metadata also can be presented. The images may be classified by, e.g., genre, musical album, concept, or the like, and, in cases where an input image is determined to belong to any such classes, audio content and/or metadata relating thereto are identified and presented to the user.

Abstract: Provided are a computer program product, system, and method for updating change information for current copy relationships when establishing a new copy relationship having overlapping data with the current copy relationships. A first copy relationship indicates changed first source data to copy to first target data. An establish request is processed to create a second copy relationship to copy second source data in to second target data. A second copy relationship is generated, in response to the establish request, indicating data in the second source data to copy to the second target data. A determination is made of overlapping data units in the first source data also in the second target data. Indication is made in the first copy relationship to copy the overlapping data units. The first source data indicated in the first copy relationship is copied to the first target data, including data for the overlapping data units.

Abstract: Techniques are described for parallel processing of database queries with an inverse distribution function by a database management system (DBMS). To improve the execution time of a query with an inverse distribution function, the data set referenced in the inverse distribution function is range distributed among parallel processes that are spawned and managed by a query execution coordinator process (QC), in an embodiment. The parallel executing processes sort each range of the data set in parallel, while the QC determines the location(s) of inverse distribution function values based on the count of values in each range of the data set. The QC requests the parallel processes to produce to the next stage of parallel processes the values at the location(s) in the sorted ranges. The next stage of parallel processes computes the inverse distribution function based on the produced values.

Abstract: Techniques are described herein for analyzing data streams in conjunction with relational database data in a DBMS. A database dictionary defines one or more columns for an external table and a data source for said external table that comprises an external message stream. Executing a query that targets the external table includes generating one or more rows from the external table, each row corresponding to a message in the external message stream that was retrieved from the external message stream after a message stream offset.

Abstract: Methods, systems, and computer readable medium for providing translated web content with translated URLs. A request is received content in a second language translated from content in a first language. The content in the first language is obtained from the first Internet source. One or more links are identified from the content in the first language. Each original URL is divided into one or more translatable URL components in the first language. Whether the one or more translatable URL components in each original URL have been previously translated into the second language and stored as translated URL components is determined. If there is at least one translatable URL component previously translated and stored as a corresponding translated URL component, a translated URL in the second language for each original URL is generated. The content in the second language with translated URLs is created.

Abstract: A computer system comprising a processor, graphical output means and a computer readable storage medium storing instructions that when executed by the processor cause the processor to perform a method for quantifying and aggregating the relevance of documents.

Abstract: An apparatus and associated method that contemplate obtaining a server in selective communication with an archive storage controller (ASC) via a computer network, the ASC having access to a plurality of removable storage mediums (RSMs); storing data in the server; creating a logical storage volume in the ASC that has a logical relationship to the data stored in the server; and after the creating step, and without communication between the server and the ASC via the computer network, selecting at least one of the RSMs and dedicating the selected at least one RSM for retaining only data that is stored in the logical storage volume.

Abstract: A method for characterizing data elements in an enterprise including ascertaining at least one of an access metric and a data identifier for each of a plurality of data elements and employing the at least one of an access metric and a data identifier to automatically apply a metatag to ones of the plurality of data elements.

Abstract: Disclosed is a computer program stored in a computer-readable medium according to an exemplary embodiment of the present disclosure. When the computer program is executed by one or more processors, the computer program allows the following operations for data caching to be performed and the operations may include an operation of generating a cache, an operation of caching at least some of the segments and at least one of records to the cache, an operation of reading the cache when receiving an inquiry request from a client, an operation of determining to read a cursor based on whether there is a segment or record corresponding to the inquiry request in the cache; and an operation of determining whether a query for at least one of a relational database and a hierarchical database is generated based on whether there is the segment or record in the cursor.

Abstract: Techniques are provided for neutralizing replication errors. An operation is executed upon a first storage object and is replicated as a replicated operation for execution upon a second storage object. A first error may be received for the replicated operation. Instead of transitioning to an out of sync state and aborting the operation, a wait is performed until a result of the attempted execution of the operation is received. If the first error is the same as a second error returned for the operation, then the operation and replicated operation are considered successful and a synchronous replication relationship is kept in sync. If the first error and the second error are different errors, then an error response is returned for the operation and the synchronous replication relationship is transitioned to out of sync.

Abstract: Described is an improved approach to implement parallel queries where session states are saved for parallelization resources. When work needs to be performed in the parallel query system for a given session, a search can be performed to identify a resource (from among the pool of available resources) that had previously been used by that session, and which had saved a session state object for that previous connection to the session. Instead of incurring the entirety of setup costs each time workload is assigned to a resource, the saved session state can be used to re-set the context for the resource to the configuration requirements for that session.

Abstract: A distributed hash table (DHT) based logging service utilizes a DHT to store an event log or another type of data. For example, applications can utilize the logging service to store data that logs aspects of their operation. A key/value storage service can provide access to the DHT. The data stored in the DHT can be organized into a “skipchain” data structure. The data structure includes nodes storing the data that are distributed across partitions of the DHT. Nodes in the data structure can identify “redundancy nodes” and “skip nodes.” When a request is received to add new data to the skipchain data structure, a new node is stored in the DHT that includes the new data. A head node for the data structure is updated in the DHT. The head node can also be utilized to recover from a failure to write an internal node to the data structure.