Abstract: Systems and methods are disclosed for processing a search request received from a user. A method includes providing access to content items associated with metadata. The method includes providing information about at least one search previously performed for a user, and providing access to information describing relationships between at least one of the content items and the metadata. The method includes receiving a present input from the user intended to identify a desired content item. Upon determining that results from the previous search did not satisfy the search request from the user, the method includes determining an intent shared by the previous search and the present input based on comparing (i) the relationship information, (ii) the previous search, and (iii) the present input. The method also includes selecting and presenting a subset of content items based on comparing the shared intent and the metadata.

Abstract: A digital method for tracing data from a plurality of data sources includes the steps of: a. obtaining initial data originating from a plurality of data sources, each initial datum comprising initial elements and initial connections, each initial element having a type and a value, b. determining a final datum on the basis of at least two initial data following the merging with one another of initial elements of the initial data according to a merging strategy, the merged initial elements making it possible to obtain a merged element having a type and a value, and c. determining a merging history for each merged element, the merging history comprising the type and the value of each initial element from which the merged element originates, the type and the value of the merged element, and data relating to the merging strategy.

Abstract: Initially, a database schema is parsed and a table tree structure is created delineating the relationships between data that are identified in the schema. In addition to accomodating relationships between main tables of data, the table tree structure also accomodates possible side tables of data, and possible circular references between tables, should such be encountered when parsing the schema. Subsequently, a migration mechanism consumes the generated table tree structure and iteratively migrates data in accordance therewith. Individual layers of the table tree structure are migrated consecutively with referenced layers being migrated prior to referencing layers. Circular links are accommodated through temporary null values, and side tables are accommodated during migration of the referencing main table. The iterative process provides completeness and fault tolerance/failure recovery.

Abstract: A method includes generating a task using a plurality of logical statements embedded in a database, the plurality of logical statements corresponding to a data modification. Database data is ingested into a staging table that is configured within the database. The task is executed based on applying the data modification to a first set of partitions storing the database data and generating a second set of partitions. The second set of partitions store modified data corresponding to the database data. A stream of committed transactions is advanced at least in part by adding an entry into the stream. The entry corresponds to committed transactions performed on the first set of partitions during the data modification. A data processing task is scheduled for execution on the modified data based on the advancing of the stream offset.

Abstract: This application discloses a database transaction processing method performed by a computer device. The method includes: in a case of starting a target transaction, obtaining, by a working node in a distributed database system, a transaction timestamp of the target transaction and current global latest version information, the target transaction including at least one operation statement for a target data object, and the global latest version information being version information of latest generated metadata of metadata stored in the distributed database system; determining latest-version metadata of the target data object according to the current global latest version information, and determining to-be-accessed user data of the target transaction according to the transaction timestamp; and executing an operation statement of the target transaction on the to-be-accessed user data based on the latest-version metadata of the target data object.

Abstract: A data stream conversion service may crawl a non-relational database to determined database attributes that characterize the data structure of the non-relational database. The data stream conversion service may evaluate the one or more attributes of the non-relational database to generate a schema for a relational database, wherein the schema maps the non-relational database attributes to respective fields of a relational database. The data stream conversion service may generate a relational database using the determined schema and replicate a data stream for the non-relational database to the relational database.

Abstract: A system performs delivery of a data pipeline on a cloud platform. The system receives a specification of the data pipeline that is split into smaller specifications of data pipeline units. The system identifies a target cloud platform and generates a deployment package for each data pipeline unit for the target cloud platform. The system creates a connection with the target cloud platform and uses the connection to provision computing infrastructure on the target cloud platform for the data pipeline unit according to the system configuration of the data pipeline unit. The data pipeline may be implemented as a data mesh that is a directed acyclic graph of nodes, each node representing a data pipeline unit. Different portions of the data mesh may be modified independent of each other. Partial results stored in different portions of the data mesh may be recomputed starting from different points in time.

Abstract: Systems and methods are described for improving content classifications and metadata for a plurality of content items. The content items may comprise various forms of media content. A content recommendation processing system may automatically annotate and/or classify content items with a plurality of metadata tag information describing content items. The disclosed system and methods may also determine and/or assign applicability scores indicating a level or degree of suitability for annotating a content item with particular metadata tag information, and may utilize applicability scores to provide content to calibrate metadata information for a plurality of content items, and further to provide content recommendations to users.

Abstract: Generating virtual foreign key relationships includes determining and displaying, in a user interface, a set of candidate foreign keys. It further includes determining and displaying, in the user interface, a set of candidate primary keys. It further includes receiving a request, via the user interface, to generate a virtual foreign key relationship between a selected candidate foreign key and a selected candidate primary key. It further includes in response to receiving the request to generate the virtual foreign key relationship between the selected candidate foreign key and the selected candidate primary key, generating the virtual foreign key relationship at least in part by generating a record for the virtual foreign key relationship. Determining a schema for non-relational data includes receiving a document in a first format. It further includes scanning the document and determining, for a field in the document, a corresponding path of the field and a data type of the field.

Abstract: Technology described herein assigns a reliability score to web content, such as a web site or portion of a website. In one aspect, an output of the technology is a high reliability score and a low reliability score for a web content. The high reliability score represents conformance to high reliability sites, while the low reliability score represents conformance to low reliability sites. The high reliability score may be generated by first identifying high reliability online content within a compressed web graph. In a first iteration, the high reliability score of the seeds is used to score online content that is linked to the seed sites. At a high level, the more links that originate from high reliability sources, the higher the reliability score for the linked content. The low reliability score is similar, but uses outgoing links to low reliability sites instead of incoming links from high reliability sites.

Abstract: A method and a system for initiating a location-based topic are provided. The system includes a serving system that allows a user to initiate the location-based topic within a social media and a graphical user interface initiated in a user device through a software means. The method allows the user to initiate a topic page when browsing digital contents in the social media via the graphical user interface. Besides being able to browse various location-based topics created by other users and the responses, the user himself can also create a location-based topic provided for other users to browse and respond to. Through web and computer technology, the serving system allows the user to browse the various digital contents via the social media and interact with other users through the various location-based topics.

Abstract: In a multi-tenant hierarchical data storage system, tenant nodes are organized into trees and subtrees including virtual shards and with tenant data on single shards. The system is configured to allow scalable parallel access by a plurality of tenant-users.

Abstract: Systems and methods for generating and maintaining data objects may include server(s) for receiving first and second data points associated with entities and root relationships between entities. The first data points may have entity values which are defined according to an entity type and one or more attributes of the entity. The second data points may have relationship values which are defined according to a root relationship type and one or more attributes of the root relationship. The server(s) may generate entity base layer data objects and relationship base layer data objects for the first and second data points. The server(s) may provide access to base layer data objects for identifying contextual relationships between respective base layer data objects. The contextual relationships may be identified by applying conditional rules received from a computing device to data corresponding to the entity values and/or the relationship values.

Abstract: In an approach to improve integration workflows by automatically generating convergent data mappings for branches in an integration workflow using a computer. A branch schema for each branch is generated, wherein the branch schema represents the union of all the individual node output schemas on the branch. A common output schema for a convergence point is generated, wherein the common output schema represents an intersection of all the branch schemas and generates branch mappings from each branch node to the common output schema.

Abstract: Example systems and methods for automated cover song identification are disclosed. An example apparatus includes at least one memory, machine-readable instructions, and one or more processors to execute the machine-readable instructions to at least execute a constant Q transform on time slices of first audio data to output constant Q transformed time slices, binarize the constant Q transformed time slices to output binarized and constant Q transformed time slices, execute a two-dimensional Fourier transform on time windows within the binarized and constant Q transformed time slices to output two-dimensional Fourier transforms of the time windows, generate a reference data structure based on a sequential order of the two-dimensional Fourier transforms, store the reference data structure in a database, and identify a query data structure associated with query audio data as a cover rendition of the audio data based on a comparison of the query and reference data structures.

Abstract: A distributed storage system includes table controllers collectively storing partitions of a logical table having multiple rows. For each of the partitions, a corresponding table controller stores a subset of the rows of the logical table across individual pages. A management controller updates a schema of the logical table from a first to a second schema definition by, for each of the partitions, sending an update command indicating the second schema definition to the corresponding table controller. The first table controller corresponds to a first partition that includes a first subset of the rows. The first table controller, prior to receiving the update command, includes an identifier of the first schema definition within each page of data for the first subset. Subsequent to receiving the update command, the first table controller, when writing each new page of data for the first subset, includes an identifier of the second schema definition.

Abstract: A method of providing a calendar service includes obtaining time-series data, determining whether the time-series data correspond to an outlier, obtaining, based on the determination that the time-series data correspond to an outlier, non-time-series data linked to the time-series data corresponding to the outlier, and displaying at least one of the non-time-series data and the time-series data corresponding to the outlier on a calendar page.

Abstract: A computer-implemented method executed using a first networked computer and comprising: receiving a digitally stored workflow pattern that specifies at least an input data source, a data transformation process, and an output data destination, the workflow pattern comprising a structured plurality of name declarations and value specifications that are human readable and machine readable, the data transformation process specified in the workflow pattern including one or more references to processing logic, a processing logic source outside the workflow pattern at which the processing logic is stored, and one or more available process engines that are capable of processing the processing logic; machine parsing the workflow pattern and dividing the workflow pattern into a plurality of execution units, each execution unit being associated with a particular process engine among the one or more available process engines; accessing the input data source specified in the workflow pattern and loading at least a portion

Abstract: A method includes searching, in response to a received policy query request, a preset policy library for a transmission policy that matches the policy query request, wherein the policy query request comprises hardware information of a transmitting end, hardware information of a receiving end, and data information of to-be-transmitted data in the transmitting end, and wherein the data information comprises a total data volume of the to-be-transmitted data, a data category comprised in the to-be-transmitted data, and a data volume of each data category, and feeding back a query result of the policy query request to the transmitting end.

Abstract: Implementations relate to determining whether and/or how to implement a user request to prevent a particular search result from being provided in response to a search query. Some of those implementations grant or deny the request based on processing of the particular search result, the search query, and/or account information for a user submitting the user request. For example, some implementations process such information utilizing a classifier in determining whether to automatically deny the request, automatically approve the request, or to provide the request for manual review. Some additional or alternative implementations at least selectively automatically expand (or suggest for automatic expansion) an approval of a request to search result(s) and/or to one or more search queries that are not specified in the request.