Abstract: The safety of a database that conceals large-scale data is efficiently assessed. A database storage (10) stores an original database and a secure database. A neighbor record search part (11) obtains a neighbor record set by a neighbor search of the original database for each record in the secure database. A nearest neighbor record calculation part (13) calculates a distance between each record in the secure database and each record in the neighbor record set and obtains a nearest neighbor record. A re-identification determination part (14) calculates a re-identification rate of a record based on whether the record in the original database corresponding to each record in the secure database matches the nearest neighbor record. A re-identification rate calculation part (15) calculates a re-identification rate of the secure database based on the re-identification rate calculated for each record in the secure database.

Abstract: A data store system includes a storage device and a processor in communication with the storage device. The processor may receive data from a source and generate a plurality of rows from the data. The processor may further apply row reduction criteria to the buffered plurality of rows. The processor may further, in response to application of the row reduction criteria, determine at least one resultant row. A number of the at least one resultant row is less than a number of the plurality of rows. The processor may further store the at least one resultant row in the storage device. A method and computer-readable medium is also disclosed.

Abstract: In an aspect, a method includes receiving lists of entities, each list (i) having an associated score, (ii) being associated with a respective context fact, and (iii) ranking a subset of the entities, and for each of the lists of entities, generating, for each entity on the list, a data structure that references (i) the entity, (ii) the context fact associated with the list, (iii) the rank of the entity for the context fact, and (iv) the score for the list. The method can also include receiving data identifying a particular entity, selecting a particular data structure that references the particular entity, and providing, for output, data indicating (i) the context fact associated with the particular data structure that references the particular entity, and (ii) the rank of the entity for the context fact associated with the particular data structure that references the particular entity.

Abstract: Disclosed herein are system, method, and computer program product embodiments for creating a dictionary-free index. An embodiment operates by a database maintaining database table comprises a column and a row. The database creates a concatenated string index comprising a concatenated string value based on the database column's row. The database also creates a hash value list having a hash value based on the concatenation string index's concatenated string value. Thereafter, the database creates a directory having a pointer to (i) a row position of the hash value list or (ii) a row position of a collision list having the row position of the hash value in the hash value list. The database also creates a collision list containing the row positions of the hash values occurring multiple times in the hash value list. The index for the database table includes the hash value list, the directory, and the collision list.

Abstract: Query content-based data generation includes obtaining a query having an outer query and one or more subqueries, performing subquery transformation on each subquery, which converts predicates of the subqueries to be predicates of the outer query, and thereby obtain a transformed query, generate from the transformed query block(s) each having a list of predicates selected from the transformed query, processing each query block for column information, including column range information and column relationship information, and generating data and populating a dataset having table(s) and respective column(s) for each of the table(s). Generating the data uses the column range information and the column relationship information to select data for the dataset such that data records from the dataset are produced as results to executing the obtained query against the dataset.

Abstract: A data processing method provides an improvement in speed of obtaining, in response to a computer search query from one or more computing devices, a particular compressed data chunk that may include a particular data value that is digitally stored in a large data file.

Abstract: The invention relates to computer-implemented systems and methods for analyzing data from a variety of data sources. Embodiments of the systems and the methods further provide for generating responses to specific questions based on the analyzed data, wherein the generating includes: retrieving related documents associated with the analyzed data; determining which information should be reported from which of the retrieved related documents; and providing a response based on the determination and a graph schema associated with the related documents.

Abstract: The present disclosure relates to a method of managing requests to a key-value database. A non-limiting example of the method includes receiving a request that includes a number of keys. The number of keys can be compared with a first threshold number and second threshold number. If the number of keys exceeds the first threshold number, the request can be split. If the number of keys is smaller than the second threshold number, the request can be merged with at least one previous or subsequent request. Requests resulting from the splitting and merging steps can be submitted to the key-value database for further processing of the submitted requests.

Abstract: Methods and systems for searching genomes for potential nucleotide-guided nuclease off-target sites are provided. Also provided are methods of searching genomes for potential off-target deadCas9 binding sites. In some embodiments, the methods include ranking the potential off-target sites based on the number and location of mismatches, insertions, and/or deletions in the DNA, RNA, or DNA/RNA guide sequence relative to the genomic DNA sequence at a putative target site in the genome, allowing the selection of better target sites and/or experimental confirmation of off-target sites.

Abstract: Described herein are systems and methods for generating a video clip. The video clip may be generated based on applying a query to content metadata to identify a match within a content item. A start boundary and an end boundary for the video clip are determined based on the match(es).

Abstract: Updates to a hierarchical data structure may be selectively replicated to other replicas of the hierarchical data structure. An update for a hierarchical data structure may be received and committed to the hierarchical data structure. A determination as to whether any other replicas of the hierarchical data structure have permission to receive the update may be made. For those replicas of the hierarchical data structure with permission to receive the update, the update may be provided to the replicas and committed to the replicas. Different types of replication techniques may be implemented, such as pull-based replication techniques or push-based replication techniques. Replication permissions for objects of the hierarchical data structure may be individually defined, in some embodiments.

Abstract: Efficient large column values storage in columnar databases is disclosed, including: providing a database comprising a write storage, a read storage, and an auxiliary storage, and wherein the auxiliary storage is used to store a large column value of a row that is associated with either the write storage or the read storage, wherein the large column value comprises a column value that meets a set of large column value criteria; and operating the database using the write storage, the read storage, and the auxiliary storage.

Abstract: Materialized views may be generated at a managed materialized view platform that accepts data streams as a source. When updating a materialized view with a data stream as a source, a stored portion of the stream is used to maintain a history of changes to be made. When a join operation needs to utilize the data stream source to determine an update to the materialized view, the data stream is preserved to complete the join and update the materialized view.

Abstract: Provided herein are systems and methods for a stream object configuration, including configuring and processing streams on views. For example, a method includes detecting a first stream object on a view. The view includes a query associated with a source table. A syntax tree of the query is determined based on a definition of the view. The view is expanded based on replacing the first stream object with the syntax tree. The syntax tree includes a second stream object on the source table. Stream expansion of the second stream object is performed based on computing changes on the source table.

Abstract: A technique is described for merging multiple lists of ordinal elements such as keys into a sorted output. In an example embodiment, a merge window is defined, based on the bounds of the multiple lists of ordinal elements, that is representative of a portion of an overall element space associated with the multiple lists. Lists of elements to be sorted can be placed into one of at least two different heaps based on whether they overlap the merge window. For example, lists that overlap the merge window may be placed into an active or “hot” heap, while lists that do not overlap the merge window may be placed into a separate inactive or “cold” heap. A sorted output can then be generated by iteratively processing the active heap. As the processing of the active heap progresses, the merge window advances, and lists may move between the active and inactive heaps.

Abstract: Some embodiments optimize a local, pending transaction queue of transactions locally executed by a client application to be synchronized with a server. Multiple transactions, which may be executed by the client application for a same local object, need to be synchronized with a server. The transactions, in queue for synchronization with the server, may include transactions to add, delete, or modify objects. Each set of transactions for a particular object in queue for synchronization with the server corresponds to a particular net effect on the server if synchronized individually to the server. The client application may replace the set of transactions for the particular object with a reduced set of transactions corresponding to the net effect, or entirely removed without replacement if there is no net effect of the set of transactions on the server.

Abstract: Various aspects of the subject technology relate to systems, methods, and machine-readable media for determining a confidence factor for a sensitive type. The method includes applying a set of matching procedures to cells in a structured data set, the structured data set comprising columns and/or rows. The method also includes counting hit counts for the cells, the hit counts corresponding to successful matches. The method also includes counting null counts for the cells, the null counts corresponding to cells having null or invalid values. The method also includes counting mishit counts for the cells, the mishit counts corresponding to cells that are not null and do not result in a match. The method also includes calculating the confidence factor based on the hit counts, the null counts, and the mishit counts, the confidence factor providing an effective probability that cells in the structured data set is of the sensitive type.

Abstract: Embodiments of the present disclosure provide methods and devices for inserting data in a database. The method can include caching one or more rows of data in a delta table in response to a request to insert the one or more rows in a destination table, wherein the destination table is one of a group of destination tables of a first database, and wherein the delta table contains requested changes of rows of the destination table, the changes being caused by a data operation; determining a priority of the destination table based on runtime information of the destination table relative to the group of destination tables; and scheduling the merging of the inserted rows from the delta table to the destination table based on the determined priority of the destination table. The destination table is in a format of a file storing one or more blocks, each block having a set of sequence of elements clustered from each column of the destination table.

Abstract: Various methods, apparatuses/systems, and media for implementing a data book application module is disclosed. The processor identifies an application that needs to be scanned through a data factory; receives inventories of all servers and databases associated with the data factory; scans the servers and databases for receiving inventories of schema, tables and columns associated with the application; and applies artificial intelligence (AI) and/or machine learning (ML) routines and matching algorithms for matching contents of columns to predefined logical terms. The processor also converts the contents of columns into taxonomies associated with the predefined logical terms; matches the taxonomies with the corresponding predefined logical terms; assigns a probability of accuracy value to the matched terms; and populates a data catalog with the matched terms when the assigned probability of accuracy value satisfies a predetermined threshold value.

Abstract: Automatically extracting lineage data for distributed file systems and databases by generating a file folder including data and having a file path, generating a data table associated with the data and the file path, tracking the lineage of data into the file folder and the lineage of data from the data table, and recording an overall lineage comprising the lineage of data into the file folder and from the data table.