Abstract: In some implementations, a system can optimize offline map data updates. For example, a server device in the system can determine a metric for identifying map data objects based on attributes of the map data objects. The server device can then generate a quadtree that stores the map data objects in nodes of the quadtree based on the metric. When processing an update to the map data stored at the server device, the server device can generate update data describing the updates for each node in the quadtree based on a binary difference algorithm and/or a semantic difference algorithm. The server device can select the algorithm based on which algorithm results in the smallest compressed size of the update data.

Abstract: A computer implemented method is used for sorting data elements of a given set. The method includes performing an evaluation of a first type of usage of each data element. The method includes determining a set of data element candidates dependent on the evaluation of the first type of usage. The method includes performing an evaluation of a second type of usage of each data element of the set of data element candidates. The method includes sorting the data elements of the set of data element candidates dependent on the evaluation of the second type of usage of each data element of the set of data element candidates. The method includes providing the sorted data elements of the set of data element candidates, and in response, receiving a request for a data processing based on the provided sorted data elements of the set of data element candidates.

Abstract: In some embodiments, a client replication service manages log mining during a rolling upgrade, in which the primary role is switched over from an original primary DBMS to a new primary DBMS having updated software. The client replication service or specifically a mining engine maintains an original session on the original primary DBMS to mine redo logs associated with the original primary DBMS until the original primary DBMS is not a primary DBMS anymore. At that time, if the mining of those redo logs is not complete, the client replication service further starts a downstream session on the new primary DBMS to mine copies of the unmined redo logs.

Abstract: Methods for lossy and lossless pre-processing of image data. In one embodiment, a method for lossy pre-processing image data, where the method may include, at a computing device: receiving the image data, where the image data includes a model having a mesh, the mesh includes vertices defining a surface, the vertices including attribute vectors, and the attribute vectors including values. The method also including quantizing the values of the attribute vectors to produce modified values, where a precision of the modified values is determined based on a largest power determined using a largest exponent of the values, encoding pairs of the modified values into two corresponding units of information. The method also including, for each pair of the pairs of the modified values, serially storing the two corresponding units of information as a data stream into a buffer, and compressing the data stream in the buffer.

Abstract: The disclosure is related to a method to securely present a suggestion to a user without disclosing the user's information to a server. The user device can receive from the server a data structure configured to represent the user's information. The user device, after obtaining the user's information from a document, can populate the received data structure with the user's information extracted from the document. The use device can receive from the server a suggestion detection module including a criterion and an executable computer code. The executable computer code can determine whether to present the suggestion at the user device by determining whether the populated user's information satisfies the criterion. Upon determining that the populated user's information satisfies the criterion, the executable computer code can present the suggestion at the user device, without disclosing to the server the user's information.

Abstract: A request to explore a set of log entries is received. The set of log entries are analyzed to identify common portions in contents of at least a portion of the set of log entries. Based on the analysis that identified the common portions, filters to explore the set of log entries are automatically recommended.

Abstract: Systems and methods for generating social annotations for content that are capable of being seen by a broad audience are provided herein. A system can include a user identification component configured to identify a user that has potential for generating a valuable endorsement of a content item based at least in part on a sharing setting associated with a user. The system further includes an audience component configured to determine an audience associated with the user based at least in part on the sharing setting, a user selection component configured to select the user as a candidate user for generating the endorsement of the content item in response to a determination that a size of the audience exceeds a threshold, and a targeted content component configured to, in response to selection of the user, provide the content item to the user with a capability to endorse the content item.

Abstract: Techniques for asynchronous searching of protected areas of a provider network are described. A method of asynchronous searching of protected areas of a provider network comprises receiving a search request at a secure query service of a provider network, the search request specifying a search condition for one or more resources in a protected area of the provider network, filtering the search request using a first filter to produce a filtered search request, providing the filtered search request to the protected area of the provider network, obtaining a search result based on execution of the search request in the protected area, filtering the search result using a second filter to produce a filtered search result, and generating a search response based on the filtered search result.

Abstract: Embodiments minimize downtime involved in moving a PDB between CDBs by allowing read-write access to the PDB through most of the moving operation, and by transparently forwarding connection requests, for the PDB, from the source CDB to the destination CDB. The files of a source PDB are copied from a source CDB to a destination CDB, during which the source PDB may be in read-write mode. The source PDB is then closed to write operations so that changes to the source PDB cease. Another round of recovery is performed on the PDB clone, which applies all changes that have been performed on the source PDB during the copy operation and the PDB clone is opened for read and write operations. Forwarding information is registered with the source location, which information is used to automatically forward connection requests, received at the source location for the moved PDB, to the destination location.

Abstract: Systems and methods are described for a reputation-based consensus protocol. A reputation score of a first node of a plurality of nodes may be determined. A distributed ledger record associated with a second node of the plurality of nodes may be received. The distributed ledger record may be stored to a distributed ledger based on the first node validating the distributed ledger record and based on the reputation score.

Abstract: Implementations of the present disclosure include receiving a view command for creating a view to display anonymized data in response to one or more queries, the view command including a view name, a table, a set of columns of the table, an anonymization type, a set of static parameters, and, for a sub-set of columns of the table, one or more sets of column-specific parameters, each set of column-specific parameters being specific to anonymization of data of a respective column of the table included in the sub-set of columns, storing the view command within the database system, and receiving a query referencing the view, and in response, providing a data set including data from each column in the sub-set of columns, receiving an anonymized data set including anonymized data that is generated from the data set using the anonymization type, the static parameters, and the sets of column-specific parameters.

Abstract: Servicing database requests using derivations of canonicalized tables including maintaining a canonical table repository of canonicalized tables, wherein each canonicalized table is a transformed version of a table previously retrieved from a database; receiving, from a client computing system, a request for a table from the database; generating a description of a canonical version of the requested table; determining that the canonical version of the requested table is derivable using a canonicalized table in the canonical table repository; and in response to determining that the canonical version of the requested table is derivable using the canonicalized table in the canonical table repository: transforming the canonicalized table in the canonical table repository based on the received request for the table, including deriving a portion of the requested table using the canonicalized table in the canonical table repository; and providing, to the client computing system, the transformed canonicalized table.

Abstract: Content of different formats may be sourced from various data sources such as content servers and ingested into a data integration server by an ingestion broker embodied on a non-transitory computer readable medium. The ingestion broker may normalize the content of different formats into a uniform representation that can be indexed and delivered across multiple digital channels for a variety of applications. The normalized content may be analyzed and semantic metadata may be determined from the normalized content. The normalized content can be semantically enriched by associating the semantic metadata and the like with the content. The semantic metadata can be stored in a semantic index that can be used for searching via the data integration server. During search, the semantic metadata can be instantiated as facets for user navigation and refinement of search criteria and additional semantic relationships can be assigned to the words in the normalized content.

Abstract: A server system detects presentation of a media content item being played at a first device in proximity to a second device associated with a first user. It also receives from the second device content information derived from sound output from the presentation of the media content item at the first device captured at the second device. Based on the received content information, it identifies the media content item being played at the first device and a plurality of first quotations associated with the media content item. The server system sends to the second device the first quotations and a plurality of quotation operation affordances. It receives selection by the first user of a first affordance of the quotation operation affordances for a first one of the first quotations. In accordance with the selection, it performs an operation with respect to the first one of the first quotations.

Abstract: According to an aspect of the invention, a data processing apparatus is provided. The data processing apparatus includes a data processing unit. The data processing unit is configured to perform at least part of: preprocessing on a data processing request to a common database issued by one of a plurality of applications accessing the common database; and post-processing on a search result returned from the common database in response to the data processing request.

Abstract: A replicated service comprises N replicas deployed on compute nodes of a computer network, wherein the replicas are each configured to vote on a proposed transaction output by a leader of the replicas and certify the proposed transaction upon receiving qr*N first votes, where qr is a fractional value between 0 and 1 that represents a quorum required for certification. A method of approving a transaction in the replicated service includes receiving certifications from the replicas, and transmitting an approval of the transaction to the replicas for recording: (i) upon determining that at least qc*N certifications have been received, where qc is a fractional value between 0 and 1 that represents a quorum required for transaction approval and qc>qr, or (ii) upon determining that at least qr*N certifications have been received at the end of the time period equal to 2*?, where ? represents a network delay.

Abstract: An online system receives third party user identifying information. The online system accesses accuracy measures associated with each of a plurality of the user identifying information sets. The online system identifies high accuracy sets of user identifying information that include the one or more types of user identifying information included in the received types of the third party user identifying information. The online system identifies as high confidence matches those local users of the online system having the high accuracy sets of user identifying information that match a corresponding set of third party user identifying information for the plurality of third party users. The online system also identifies as low confidence matches, and identifies as similar matches those of the low confidence matches that have a measure of similarity to one or more of the high confidence matches that is beyond a threshold measure of similarity.

Abstract: A replicated service comprises N replicas deployed on compute nodes of a computer network, wherein the N replicas are each configured to vote on a proposed transaction output by a leader of the N replicas and certify the proposed transaction upon receiving qr*N first votes, where qr is a fractional value between 0 and 1 that represents a quorum required for certification. A method of approving a transaction in the replicated service includes receiving certifications from the N replicas, determining whether or not the certifications are received from at least qr*N replicas during a time period equal to 2*?, where ? represents a network delay between two compute nodes of the computer network, and transmitting an approval of the transaction to the replicas for recording by the replicas upon determining that at least qr*N certifications have been received at the end of the time period equal to 2*?.

Abstract: Embodiments as disclosed may provide a search operator that addresses the problem of query construction for finding objects that include some number (N) of a set of terms (M). Moreover, embodiments as disclosed herein may efficiently implement the searches specified by such subset operators using a subset process that combines results from a set of term processes where only one term process may be needed for each search term (or search term variant).

Abstract: A method and a system for determining an importance score associated with a digital news item, the importance score for determining push notifications to be provided to a user of an electronic device. The method comprises accessing a digital news item, the digital news item having been electronically published at a news item publication time by a digital news source, the digital news source being accessible via a communication network; determining a source weight of the digital news source; determining the importance score of the digital news item based on the news item publication time and the source weight of the corresponding digital news source; in response to the importance score of the digital news item being above an importance score threshold, generating a push notification based on the digital news item; and transmitting the push notification by the server to the electronic device.