Abstract: Scalable architecture for propagating updates may be implemented for data replicated from a data set. A node may receive updates to items in a data set that have been committed to the data set. The node may determine whether the update should be applied to a replicated portion of the data set. For updates that should be applied, the node may identify another node that hosts the replicated portion of the data set and send a request to the other node to perform a conditional atomic operation to apply the update to the item in the replicated portion of the data set. The condition may compare a version identifier associated with an update and a current version identifier for the item at the other node. If the condition evaluates true, then the update to the item in the replicated portion may be performed.

Abstract: Disclosed embodiments provide techniques for technical support. Previously reported problem reports are analyzed and symptoms are extracted. Solutions are associated with the previously reported problem reports. A newly submitted user problem is analyzed and symptoms are extracted and compared with the symptoms of the previously reported problems. Solutions are then associated with the user problem based on relevance to symptoms, product type, and/or other factors.

Abstract: Proposed are concepts for managing the distribution of data elements in a distributed data storage system comprising: a plurality of distributed assets; and a mobile asset associated with a home location. A proposed method comprises: allocating a data element based on a current location of the mobile asset. If the current location of the mobile asset differs from the home location associated with the mobile asset, a replica of the data element is allocated to another asset.

Abstract: Techniques for estimating social content interactions are provided. An example method includes determining counts of one or more user interactions with one or more content items created by an author, each user interaction of the one or more user interactions having an associated time, classifying, based on respective associated times of the user interactions, the determined counts of the user interactions with the content items into predetermined time intervals spanning a first duration, computing an engagement model for the author based on the classified counts corresponding to the predetermined time intervals and a number of the content items created by the author and estimating, at a particular time for a second duration, a number of interactions with a particular content item created by the author based on the engagement model and a determined actual number of interactions with the particular content item.

Abstract: A method may include receiving request from a first user via an application, for assistance with completion of a document within the application; determining expected characteristics of the completed document, the expected characteristics identifying: a plurality of tasks to be performed to generate the completed document; and a document value; performing a computer-implemented matching process to match the first user with a second user based on the plurality of tasks and document value; and configuring permissions of the application to allow collaborative editing within the application between the first user and second user to complete the document.

Abstract: The present invention provides a file management device that makes it possible to assign a file name according to a user's preference. There is provided a file management device includes: a memory; and a processor coupled to the memory and the processor configured to: presume a naming rule of the file names based on file names of data files present in a folder; register the naming rule, presumed by the rule presuming section, in a rule storages section in association with the folder; and assign a file name to a data file according to a naming rule associated with a folder in which the data file is present among the naming rules stored in the rule storage section.

Abstract: In an example embodiment, a method comprises determining that a multipart upload request to upload a data object in separate object parts has been received by an object storage service; generating temporary keys for the separate object parts of the data object; storing the temporary keys in a temporary key data store; generating, based on the temporary keys, a multipart key entry for the data object, the multipart key entry comprising a multipart key that contains an object identifier identifying the data object and an inverse timestamp; and inserting the multipart key entry in a persistent key data store storing an ordered set of key entries in a position determined by the object identifier and the inverse timestamp.

Abstract: Disclosed are systems and methods for improving interactions with and between computers in content searching, generating, hosting and/or providing systems supported by or configured with personal computing devices, servers and/or platforms. The systems interact to identify and retrieve data within or across platforms, which can be used to improve the quality of data used in processing interactions between or among processors in such systems. The disclosure provides a novel, computerized framework for automatically selecting the most definitive, precise and high-quality content files corresponding to POIs. The disclosed systems and methods utilize the performance of visual comparisons with a set of definitive content files of a given POI, and by incorporating visual aesthetic features as a factor of such comparisons, a search result is identified that down-weights imprecise and poor quality content files of a given POI, and ensures that only high quality, accurate content files are selected or identified.

Abstract: Proposed are concepts for managing the distribution of data elements in a distributed data storage system comprising: a plurality of distributed assets; and a mobile asset associated with a home location. A proposed method comprises: allocating a data element based on a current location of the mobile asset. If the current location of the mobile asset differs from the home location associated with the mobile asset, a replica of the data element is allocated to another asset.

Abstract: The subject technology determines whether a table is sufficiently clustered. The subject technology in response to determining the table is not sufficiently clustered, selects one or more micro-partitions of the table to be reclustered. The subject technology constructs a data structure for the table. The subject technology extracts minimum and maximum endpoints for each micro-partition in the data structure. The subject technology sorts each of one or more peaks in the data structure based on height. The subject technology sorts overlapping micro-partitions based on width. The subject technology selects based on which micro-partitions are within the tallest peaks of the one or more peaks and further based on which of the overlapping micro-partitions have the widest widths.

Abstract: A subject-based ranking determining method and system based on an interaction between a writer and a reader. A subject-based ranking determining method may include evaluating a writer that creates content of a corresponding subject for each subject based on the corresponding subject; and providing a search result in which an evaluation result of the writer on a subject corresponding to an input query is applied to a content ranking in response to input of the query.

Abstract: A system, a medium, and a method are provided to send soft recommendations to one or more devices. For example, a communication interface of a server device accesses request data generated by a first user account, where the request data includes soft recommend data intended for a second user account. A soft recommend component of the server device generates graphic data and determines one or more locations or display configurations of the second user account to provide the graphic data based on an estimated interest in the graphic data. An account management engine of the server device uploads the graphic data to the second user account based on the one or more locations of the second user account determined to provide the graphic data. A transceiver of the communication interface that transmits the uploaded graphic data to a client device enabled to access the second user account.

Abstract: A method is provided for data matching between a set of source data structures and a set of target data structures. The method includes obtaining, using a processor device configured to perform machine learning, source to target matching results with matching scores, based on the sets of source and target data structures. The method further includes calculating, by the processor device, context information for data structure pairs based on a structure similarity and an ontology similarity between constituent data structures thereof. Each of data structure pairs include as the constituent data structures a respective source data structure and a respective target data structure from the sets of source and target data structures. The method also includes updating, by the processor device, the matching scores based on the context information. The method additionally includes controlling, by the processor device, a hardware device responsive to at least one updated matching score.

Abstract: In various example embodiments, a system, computer readable medium and method for schema update engine dynamically updating a target data storage system. Incoming data records are received. A front-end schema of the incoming data records is identified. The front-end schema and the current target schema are compared. Based on identifying a difference between the front-end schema and the current target schema, the current target schema is updated in order to be identical to the front-end schema. The current target data file is closed and the incoming data records are stored in a new target data file according to the updated target schema.

Abstract: A query server identifies data collections of interest in a cloud store, and categorizes the collections based on an intended usage. Depending on the intended usage, the categorized data may be cataloged, indexed, or undergo a full intake into a column store. In a database of large data collections, some collections may experience sparse or indefinite usage. Cataloging or indexing position the collections for subsequent query access, but defers the computational burden. The full intake performs a columnar shredding of the collection for facilitating eminent and regular query access. Upon invocation of query activity, an instantiation of virtual machines provided by the cloud store vendor implements query logic, such that the VMs launch in conjunction with the cloud store having the collections. Collections therefore incur processing based on their expected usage-full intake for high query traffic collections, and reduced cataloging for maintaining accessibility of collections of indefinite query interest.

Abstract: Techniques are described herein for automated assistants that search various alternative corpora for information. In various implementations, a method may include receiving, by an automated assistant via an input component of a first client device, a free form input, wherein the free form input includes a request for specific information; searching a general purpose corpus of online documents to obtain a first set of candidate response(s) to the request for specific information; searching a user-specific corpus of active document(s) to obtain a second set of candidate response(s) to the request for specific information; comparing the first and second sets of candidate responses; based on the comparing, selecting a given response to the request for specific information from the first or second set; and providing, by the automated assistant, output indicative of the given response.

Abstract: The invention relates to a system and method to cause an apparatus to perform at least the following; identifying music preferences by understanding the listening history of a user from one or more context signals associated with a user mobile device.

Abstract: Automatic clustering of a database table is disclosed. A method for automatic clustering of a database table includes receiving an indication that a data modification task has been executed on a table and determining whether the table is sufficiently clustered. The method includes, in response to determining the table is not sufficiently clustered, selecting one or more micro-partitions of the table to be reclustered. The method includes assigning each of the one or more micro-partitions to an execution node to be reclustered.

Abstract: A computer-implemented method includes receiving an input query including a comparative question referencing a plurality of entities. The comparative question includes a comparative term regarding a metric associated with the plurality of entities. The computer-implemented method includes generating a plurality of polar questions. Each of the plurality of polar questions seeks a polar answer to a comparison, along the metric and according to the comparative term, between a target entity of the plurality of entities and at least one second entity of the plurality of entities. The computer-implemented method includes determining confidence scores for the plurality of polar questions. The computer-implemented method includes identifying a particular polar question of the plurality of polar questions based on the confidence scores. The computer-implemented method includes outputting a response to the input query that identifies the target entity of the particular polar question as an answer to the input query.

Abstract: Automatic clustering of a database table is disclosed. A method for automatic clustering of a database table includes receiving an indication that a data modification task has been executed on a table and determining whether the table is sufficiently clustered. The method includes, in response to determining the table is not sufficiently clustered, selecting one or more micro-partitions of the table to be reclustered. The method includes assigning each of the one or more micro-partitions to an execution node to be reclustered.