Abstract: The subject technology receives a query plan, the query plan comprising a set of query operations, the set of query operations including at least one aggregation and at least one join operation. The subject technology analyzes the query plan to identify an aggregation that is redundant. The subject technology removes the aggregation based at least in part on the analyzing. The subject technology determines at least one aggregation property corresponding to at least one query operation of the query plan. The subject technology inserts at least one adaptive aggregation operator in the query plan based at least in part on the at least one aggregation property, the at least one aggregation property comprising a set of aggregation properties. The subject technology provides a modified query plan based at least in part on the inserted at least one adaptive aggregation operator in the query plan.

Abstract: A machine may form all or part of a network-based system configured to provide media service to one or more user devices. The machine may be configured to define a station library within a larger collection of media files. In particular, the machine may access metadata that describes a seed that forms the basis on which the station library is to be defined. The machine may determine a genre composition for the station library based on the metadata. The machine may generate a list of media files from the metadata based on a relevance of each media file to the station library. The machine may determine the relevance of each media file based on a similarity of the media file to the genre composition of the station library as well as a comparison of metadata describing the media file to the accessed metadata that describes the seed.

Abstract: An object management system (OMS) receives a plurality of objects to be stored. The OMS identifies a subset of objects associated with a same time period and a same namespace from the plurality of objects and generates a batch object comprising the subset of objects. The OMS issues a write request to store the batch object in an object storage system (OSS) and stores, for each object in the subset of objects, a data structure comprising an identifier of the batch object and a position of the object within the batch object. Upon receiving a read request for an object, the OMS determines, based on the data structure, whether the object is stored in the OSS and issues a read request to the OSS based on the identifier of the batch object and the position of the object within the batch, if the objects is stored in the OSS.

Abstract: Methods and apparatus for providing query suggestions to a user based on one or more past queries submitted by the user. Candidate query suggestions responsive to a current query may be identified. A candidate query similarity measure may be determined for a given candidate query suggestion based on matching entities related to the given candidate query suggestion and the one or more past queries. In some implementations, the similarity measure of the given candidate query suggestion may be based on a comparison of current entities of the given candidate query suggestion that match entities of one or more past queries, to a group of the current entities that includes entities that do not match the entities of one or more past queries. In some implementations a ranking of the candidate query suggestions may be determined based on the similarity measure.

Abstract: Devices, systems, and methods are provided for using a synthetic content model verification. A system may receive, at a front end service, inputs of a content campaign. The system may determine, based on the inputs, validation criterion. The system may determine, by the front end service, that a first input satisfies first validation criteria, and may send the inputs to a back end service. The system may receive, by the front end service from the back end service, a first indication that a second input fails to satisfy second validation criteria. The system may receive, at the front end service, a third input replacing the second input. The system may send, by the front end service to the back end service, the third input, and may receive, by the front end service from the back end service, a second indication that the third input satisfies the second validation criteria.

Abstract: Generation and/or utilization of particular data structure(s) in more efficiently storing, retrieving, and/or presenting personal entry(s) is described herein. Implementations can utilize the data structure(s) in more efficiently responding to a vague user request that specifies a particular type of personal entry, but lacks any additional features of the personal entry(s) sought. Utilization of the data structure(s) can enable responsive personal entry(s) to be efficiently identified (e.g., processor and/or memory efficiency and/or with reduced latency). For example, some implementations can enable selection of a subgroup of personal entries to provide responsive to the vague request, without necessitating any processing of personal entries, that are not included in the selected subgroup, be performed responsive to the request.

Abstract: This disclosure relates to knowledge generation and implementation. A knowledge graph system comprises at least one processor, at least one database communicatively connected to the at least one processor, and a memory storing executable instructions. When executed, the instructions cause the at least one processor to aggregate data associated with a plurality of entities, the aggregated data reflecting one or more relationships between two or more of the plurality of entities. Attribute data identifying loan amounts, property values, and appraisal sources may be extracted from the aggregated data. A knowledge graph data structure may be generated having a plurality of subject notes corresponding to the extracted attribute information. Statistical distributions of attributes associated with one or more appraisal sources may be generated and an anomaly in a first statistical distribution may be detected based on a comparison of the first statistical distribution with a second statistical distribution.

Abstract: A hierarchical embedding model is used to obtain respective language-agnostic embeddings of entity records of a cross-language data set. A plurality of record representation pairs is prepared based at least in part on the language-agnostic embeddings. A machine learning model is trained using the record representations pairs to generate similarity scores for pairs of entity records whose text attributes are expressed in different languages.

Abstract: A method, computer program, and computer system is provided for dynamic Network-Based Media Processing (NBMP) image retrieval. A call for a function from among a function group is received. The function call corresponds to an NBMP request to a workflow manager. A determination is made as to whether an image associated with the received function call is static or dynamic. A pointer to the image is returned based on the image being determined to be dynamic.

Abstract: Certain aspects of the present disclosure provide techniques for operation of a feature management platform. A feature management platform is an end-to-end platform developed to manage the full lifecycle of data features. For example, to create a feature the feature management platform can receive a processing artifact (e.g., a configuration file and code fragment) from a computing device. The processing artifact defines the feature, including the data source to retrieve event data from, when to retrieve the event data, the type of transform to apply, etc. Based on the processing artifact, the feature management system generates a processing job, which when initiated generates a vector that encapsulates the feature data. The vector is transmitted to the computing device that locally hosts a model, which generates a prediction. The prediction is transmitted to the feature management platform and can be transmitted to other computing devices, upon request.

Abstract: Systems, methods, and computer-readable media are disclosed for data unblocking in application platforms. An application platform may comprise a plurality of systems. A system may store data having a residence period. Upon expiration of the residence period, the data may be blocked from further processing. Data which is blocked may need to then be unblocked. Systems may be leading systems or dependent systems. Data unblocking may be triggered from the leading system to the dependent systems. At runtime, the dependent system may receive a trust token which may be used to verify a calling system as the leading system. If a data unblocking request is called from a dependent system, data unblocking may be prevented.

Abstract: A multi-framework blockchain service may be implemented with a common interface to manage different types of blockchain networks. Requests to create a blockchain network may be received via an interface for the control plane that triggers the creation of the blockchain network according to an identified workflow. Various operations to change the blockchain network, including membership changes, node additions, governance changes, analytics changes, and monitoring changes may be allowed or denied by the control plane according to a distributed governance policy in effect for the blockchain network.

Abstract: This disclosure describes how data supporting real-time reporting services can be cached during a log intake process. In particular, instead of caching all the log data being generated by an operational system, only the log data relevant to existing queries associated with the real-time reporting services are cached. In some embodiments, only particular metrics contained within the log data are stored for rapid access by the real-time reporting services.

Abstract: A data collector collects device data obtained from a device that is placed, for example, at a home, a workplace or the like. A distribution data generator adds ancillary information (for example, a time, a unit, precision, a resolution, a content of processing, a manufacturer, a model number or the like) to the device data collected by the data collector, thereby generating distribution data. A data provider provides, to an outside, (for example, to a data usage server), the distribution data generated by the distribution data generator.

Abstract: Provided is a method for performing a file system consistency check. The method comprises calculating, by a first thread that does not have access to an inode table, file block addresses for one or more files to be checked by the thread. The method further comprises collecting validity information for the one or more files. The method further comprises reading information relating to the one or more files from the inode table. The reading is performed in response to the thread being given access to the inode table after the calculating operation. The method further comprises validating the information by comparing the information from the inode table to the validity information.

Abstract: There is provided systems and method for content inversion for use in user searches and product recommendations. The methods include receiving a first content, wherein the first content includes a first sentence having at least one first sentiment expression, creating a syntactic parse tree of the first sentence, identifying a first sentiment in the at least one first sentiment expression, wherein the first sentiment corresponds to a first polarity, determining a first needs expression corresponding to the first sentiment, wherein the first needs expression includes a first subject. The method may further include creating a sub-tree corresponding to the first needs expression, and grouping the content with other content having similar sub-trees.

Abstract: Techniques are disclosed relating to tree data structures capable of storing information indicative of database keys. A computer system may operate a database. The computer system may store a multi-level tree data structure usable to perform key lookups for the database. In various cases, the multi-level tree data structure may be stored in system memory as a plurality of subtree data structures each comprising a set of linked nodes. A given one of the plurality of subtree data structures may be stored as a respective continuous block of information in system memory. The computer system may access the respective continuous block for a first particular subtree data structure encompassing a particular range of levels in the multi-level tree data structure. The accessing may be performed without accessing one or more other subtree data structures encompassing one or more levels within the particular range of levels.

Abstract: An embodiment of a data pattern analysis optimizer includes a time sequence data memory, an estimator, a grouping unit, and a time sequence pattern extractor. The time sequence data memory stores a plurality of time sequence data made from items in time order. The estimator estimates the upper limit of the total number of types of time sequence patterns present in the time sequence data at a rate higher than a minimum support level, based on a respective rate of presence of each item, wherein each of the time sequence patterns present in the time sequence data is a predefined number of items. In case that the estimated upper limit exceeds an upper limit of the number of types of time sequence patterns as a maximum processing load to a computer, the grouping unit groups a plurality of time sequence data into sub-groups, based on a group of items having the increased number of items and gives the estimator instructions to perform estimation.

Abstract: One embodiment provides a computer implemented method, including: receiving, from a user, a natural language query for data contained within at least one data repository; identifying at least one concept from the natural language query, wherein the at least one concept includes an entity and an intent; identifying a plurality of datasets satisfying the natural language query by querying the at least one data repository utilizing the at least one concept; ranking the dataset based on relevance to the query; generating an extract-transform-load script that extracts, transforms, and loads a dataset selected by the user from the plurality of datasets; and retrieving data included in the dataset utilizing the extract-transform-load script, wherein the retrieving includes returning the data to the user.

Abstract: A key-value database may maintain a collection of data in which the value components are serialized object graphs. The object graphs may be deserialized and converted to a directed graph. Each node may represent an entity and each edge a relationship between entities. Instructions associated with a table may indicate criteria for identifying corresponding entities in a directed graph. A row of the table may be created for each entity having a unique permutation of identifying properties. Column values may be obtained using instructions for accessing entity properties and mapping from the properties to column values.