Abstract: A method of operations of a display-server computing system includes delivering input by a display device to a server computer over a communications network, processing an application unit of the server computer with the input, responsive to the step of inputting, outputting a result of the processing, together with tags indicative of the input, delivering the result and the tags by the server computer to the display device over the communications network, receiving the result and the tags by the display device, receiving new input to the display device prior to receiving the result and the tags by the display device, and processing a transform of the display device by comparing the tags to the new input to obtain a transformed result.

Abstract: The disclosure presents processes to improve the ability to analyze geological information for an area or region of interest. A user can specify one or more input files, such as from public, private, or proprietary sources. The user can specify a geological or geographic framework to utilize. The process can then perform a matching between the data in the input files and the data in the framework. The matching process can utilize a geological matching using a specified range of depths or a geographical matching followed by the geological matching. Other parameters can be utilized such as a radius to define an area of interest around a central location of interest. Matched data elements can have geological attributes from the geological framework data linked to data elements in the input files. The input files can be downloaded, displayed, printed, or communicated to another computing system or program for further analysis.

Abstract: A secret hash table construction apparatus constructs a secret hash table capable of storing up to Z items of data in B kinds of address values by secret computation from a real data stream including items of data each having a key and a flag indicating whether or not the data is dummy data. The secret hash table construction apparatus executes generating a first array in which a storage destination data array is connected with another storage destination data array as dummy data; generating a second array in which the real data stream is connected with a dummy data stream; sorting each of the first and second arrays based on a ranking operations; extracting address values of lower ranks to generate a third array; and sorting the second array using a fourth array, and outputting BZ elements in the sorted second array as the secret hash table.

Abstract: Example methods and systems for accessing data in a log-structured file system having a plurality of snapshots of storage objects backed by a first-level copy-on-write (COW) B+ tree data structure and a plurality of second-level B+ tree data structures have been disclosed. One example method includes obtaining a first first-level mapping associated with a first snapshot from the plurality of snapshots based on a first logical block address, wherein each of the plurality of snapshots corresponds to each of the plurality of second-level B+ tree data structures, identifying a first second-level B+ tree data structure corresponding to one of the plurality of snapshots based on the first first-level mapping, obtaining a first second-level mapping based on the first logical block address in the first second-level B+ tree data structure, obtaining a first physical block address based on the first second-level mapping, and accessing data at the first physical block address.

Abstract: Generally discussed herein are devices, systems, and methods for machine learning (ML) by flowing a dataset towards a target dataset. A method can include receiving a request to operate on a first dataset including first feature, label pairs, identifying a second dataset from multiple datasets, the second dataset including second feature, label pairs, determining a distance between the first feature, label and the second feature, label pairs, and flowing the first dataset using a dataset objective that operates based on the determined distance to generate an optimized dataset.

Abstract: Methods, apparatus, systems, and articles of manufacture to estimate cardinality through ordered statistics are disclosed. In an example, an apparatus includes processor circuitry to selects a sample dataset from a first reference dataset of media assets and partitions the sample dataset into m mutually exclusive subsets of approximately equal size. The processor circuitry then estimates a ratio of a sample weighted average and empirical cumulative distribution of an approximately largest order statistic from at least one of the m subsets and generates an estimate of a total cardinality of the first reference dataset by multiplying the ratio by approximately m.

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: 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 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: 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 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: 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: 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: 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: 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: 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 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: 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.