Abstract: A computer system may send an async version of a file to a client, with the async version of the file comprising a uniform resource identifier for the file, a secret key for accessing the file, one or more filter parameters, and at least one of metadata of the file or a sample of data of the file. A portion of the data of the file may be excluded from the async version. The computer system may receive a request for additional data of the file from the client, with the request comprising a parameter value for the filter parameter(s), and then generate a requested version of the file based on the request, including at least a portion of the data of the file in the requested version based on the parameter value. The computer system may then send the requested version of the file to the client component.

Abstract: A technique of calculating evaluation values regarding anonymity for a table obtained by anonymizing an arbitrary table is provided. An anonymity evaluation apparatus includes an evaluation target table generation part configured to generate a first evaluation target table of p×L including L records which are sets of values of p master attributes different from each other from a table to be anonymized of M×N and generate a second evaluation target table of p×L by anonymizing the p master attributes in the first evaluation target table from an anonymized table of M×N by anonymizing the p master attributes in the table to be anonymized, where M is the number of attributes, N is the number of records, p is the number of master attributes, and L is the number of sets of values of p master attributes which are different from each other.

Abstract: In some embodiments, techniques for identifying one or more species in an undifferentiated environmental sample comprising a plurality of nucleic acid sequences are provided. One or more indices that represent a plurality of reference nucleic acid sequences may be provided, and data may be received comprising digital representations of respective nucleic acid sequences. The respective nucleic acid sequences may be aligned, if possible, using the indices. A respective alignment ration may be calculated for each one of the reference nucleic acid sequences, based on the number of nucleic acid sequences aligned to the respective reference nucleic acid sequence and the total number of nucleic acid sequences in the received data.

Abstract: In an embodiment, a computer-implemented method includes receiving a query from a client and determining a query plan for the query. The query plan comprises one or more query operators for executing at least a portion of the query on a database. The method also includes sending the one or more query operators to one or more computing nodes for the one or more computing nodes to execute the one or more query operators on one or more data fragments of the database. In this example, each computing node of the one or more computing nodes hosts a respective data fragment of the one or more data fragments. Further, the method includes detecting an error in executing a first query operator by a first computing node on a first data fragment, and sending, in response to detecting the error, the first query operator to a replacement computing node for executing on the first data fragment hosted by the spare computing node.

Abstract: The present invention generally relates to the field of automated functional testing, and, more particularly, to a method and system for validation of calculation code against calculation specification. Currently the validation is done manually which is time consuming and effort intensive. Embodiments of present disclosure provide an automated method of validation by generating a schema from the calculation specification, retrieving data based on the schema, executing the intermediate calculations, and comparing the result with the output from the calculation code. The method requires minimal manual input and is a fast, simple, resilient and low-code/no-code technique that can be extended to support any type of calculation code and calculation specifications with minimal or no change.

Abstract: The present invention relates to an implementation method for graphic-blockchain-orientated hybrid consensus, at least comprising: calling at least one module to generate a new data block and broadcast it; calling at least one module to check and validate the received new block based on predetermined rules; calling at least one module to generate a void block; and calling at least one module to update a committee member list. The existing graphic blockchain can only achieve probabilistic consensus, yet the present invention achieves deterministic consensus on graphic blockchain for the first time, thereby reaching consensus faster. The present invention decouples generation and consensus of blocks for the first time, so that the two parts can be designed separately in a modularized manner. The present invention provides the first totally decentralized hybrid consensus algorithm in the graphic blockchain. This is unachievable to many existing graphic blockchain such as IOTA and Obyte.

Abstract: Systems and techniques for retrieving video data associated with a selected attribute are described. The systems and techniques include receiving a multimodal input associated with the attribute for querying a catalog of video data to identify video data including the attribute. A first embedding is determined for the input using a first encoder to map the input to a representation space. A second embedding is determined for the video data to map the video data to the representation space. A similarity score is determined between the video data and the input based on a distance between the embeddings. The video data associated with the attribute may be selected based on the similarity score.

Abstract: Methods and apparatus to estimate audience sizes using deduplication based on vector of counts sketch data are disclosed. A system includes hardware circuitry to instantiate: coefficient analyzer circuitry to determine coefficient values of a polynomial based on (i) variances in values in a first vector of counts and a second vector of counts, (ii) a first cardinality of the first vector of counts, and (iii) a second cardinality of the second vector of counts; and overlap analyzer circuitry to: determine a real root of the polynomial; and report generator circuitry to estimate a deduplicated audience size based on (i) the estimate of the quantity of the second subscribers that are duplicates of the first subscribers and (ii) the first and second cardinalities. The system includes communication circuitry to transmit a network communication to a third party entity, the second network communication including a report based on the deduplicated audience size.

Abstract: According to an embodiment, a database system includes a plurality of nodes in which a database is stored; and a management device configured to manage the plurality of nodes. The management device includes a first assigning unit and a second assigning unit. Depending on a change in state of each of the plurality of nodes, the first assigning unit assigns a first node, which stores therein data pieces and receives an access request with respect to the data pieces, and assign a second node, which stores therein the data pieces and serves as a backup node for the first node, and instructs each of the plurality of nodes to perform operations according to assignment.

Abstract: Provided are a query rewriting method and apparatus, a device and a storage medium, relating to the technical field of data processing and, in particular, to technical fields including artificial intelligence, speech technology, intelligent search and deep learning. The solution includes, in response to a query rewriting request, extracting at least one of context information of an original query and intention information of the original query; and determining a new query based on a machine vocabulary collection and the at least one of the context information and the intention information. The understanding degree to the new query by a machine is greater than the understanding degree to the original query by the machine.

Abstract: An input device, discovery service, and associated discovery and device linking system are provided that allow for adhoc linking of input devices and display devices using discovery key codes. Input devices and display devices are assigned to discovery groups that simplify the process of connecting input devices to display devices for end users.

Abstract: Systems and methods for controlling data in a hierarchy receive a data query corresponding to data organized within nodes in a data hierarchy, wherein the data hierarchy is defined by a plurality of dimensions. A data traversal of the data hierarchy is performed including a rollup operation between different nodes at different levels of the plurality of dimensions. The rollup operation aggregates data values of the nodes at the different levels. Aggregated values for different nodes at each level are output based on the rollup operation, and the data query is executed using the aggregated values for the different nodes.

Abstract: The subject technology receives, from a first client device, a set of requests for recording user activity detected on a mobile application executing on the first client device, wherein each request includes information corresponding to a set of events based on the user activity that has occurred on the mobile application. The subject technology determines that a first request from the set of requests includes a hash of an asset to be rendered by a session player application. The subject technology performs a set of operations to transform the hash of the asset to a format compatible with the session player application. The subject technology provides the transformed hash in a node of a document object model to the session player application to retrieve the asset.

Abstract: A system can selectively synchronize content based on synchronization settings. In some examples, a client stores a local tree representing a local set of content items associated with an account on a content management system, the local tree including respective local nodes corresponding to the local set of content items. The client stores a remote tree representing a remote set of content items associated with the account, the remote set being stored at the content management system and including respective remote nodes corresponding to the remote set of content items. The client receives a synchronization setting disabling local storage of the content item. In response, the client deletes a local copy of the content item, removes a corresponding local node from the local tree, and adds, to a remote node on the remote tree, an attribute indicating that local storage of the content item has been disabled.

Abstract: Disclosed are embodiments for providing batch performance using a stream processor. In one embodiment, a method is disclosed comprising processing a plurality of events using a stream processor and executing a deduplication process on the plurality of events using the stream processor. The plurality of events is outputted to a streaming queue and a close of books (COB) of a data transport is detected. Then, an audit process is initiated in response to detecting the COB signal, the audit process comprising comparing a set of raw events to a set of events in the streaming queue to identify a set of missing events, and replaying a set of missing events through the stream processor.

Abstract: Disclosed herein is a system, comprising a distributed database comprising a plurality of partitions allocated in memory for storing a plurality of datasets. Wherein each dataset stored in the distributed database comprises at least a primary data portion stored in a respective primary partition of the plurality of partitions and at least zero additional data portions stored in respective secondary partitions of the plurality of partitions. Wherein each data portion of each dataset is mapped to a respective partition in which it is stored by a respective identifier. Wherein the primary data portion of each dataset comprises metadata stored in the primary partition, the metadata is indicative of the identifier of all additional data partitions of the respective dataset.

Abstract: An index handler determines, with respect to a key to be inserted into an index, that a candidate destination node of the index meets a split criterion. The index handler generates and embeds a deferred split descriptor comprising an identifier of a new node within the destination node. Before an insert-completed indication is provided, the destination node is written to a back-end data store without acquiring a lock and without writing out the new node to the back-end data store. During the traversal of the index, the index handler identifies another deferred split descriptor indicating a second new node. After providing the indication that the key was successfully inserted, the index handler writes the second new node to the back-end data store.

Abstract: The cloud-based query workload optimization system disclosed herein the cloud-based query workloads optimization system receives query logs from various query engines to a cloud data service, extracts various query entities from the query logs, parses query entities to generate a set of common workload features, generates intermediate representations of the query workloads, wherein the intermediate representations are agnostic to the language of the plurality of the queries, identifies a plurality of workload patterns based on the intermediate representations of the query workloads, categorizes the workloads in one or more workload type categories based on the workload patterns and the workload features, and selects an optimization scheme based on the category of workload pattern.

Abstract: A database system stores a hypertable representing a database table partitioned into chunks along a set of one or more dimension attributes. A subset of chunks of the hypertable is stored in a primary database storage and another subset of chunks stored in cloud storage. The database system transmits chunks from the primary database storage to a cloud storage either individually or as larger batches of chunks. Each chunk in the cloud storage is stored using a different database storage format compared to the database storage format used in the primary database storage. The database system receives a database query and generates a query execution plan including operators for accessing a set of chunks stored in the primary database storage and operators for accessing a set of chunks stored in the cloud storage. Results obtained by processing the different sets of chunks are combined.

Abstract: A computer system includes a processor and a persistent data storage. The persistent data storage includes flash-like storage media that includes multiple contiguous memory blocks. Each of the contiguous memory blocks includes multiple contiguous memory pages. Multiple file systems executable by the processor manage file data and the file system structure of files stored in the persistent data storage. A core executable by the processor provides a common internal model and software routines that provide common functionality to each of the file systems. Some of the file systems are executable to reconstruct the one or more file systems using a plurality of transaction records that may be executed a plurality of times and always render the same effect.