Abstract: Crux detection in search definition sets is provided herein. Crux detection can include generating a hierarchical representation of a search definition set. The hierarchical representation can be reduced by removing search definitions unrelated to a target search definition. The search definitions in the reduced hierarchical representation can be focused by removing inapplicable elements or operations in the search definitions. Focusing the search definitions in the reduced hierarchical representation can include removing context-irrelevant elements and/or removing search-definition-irrelevant elements. The focused reduced hierarchical representation can be analyzed to identify implementation cruxes in the search definitions. Cruxes can include performance-impacting elements of the search definitions. The cruxes can be tagged and provided for redevelopment or analysis.

Abstract: Herein are techniques for automatically leveraging metadata of an analytic view to accelerate a relational query. In an embodiment, a computer stores model metadata that defines an analytic view that contains a join operation that is based on a dimension column of a dimension table and a join column of a fact table. The analytic view also contains a measure that is based on an aggregation operation and a measure column of the fact table. Also stored is denormalization metadata that defines a transparency view that is based on the analytic view. In operation, a query that references the transparency view is received. The query does not reference the analytic view. The query that references the transparency view is executed based on: a) the denormalization metadata that defines the transparency view, b) the model metadata that defines the analytic view, and c) the measure that is based on the aggregation operation and the measure column of the fact table.

Abstract: A technique includes identifying a plurality of substitute candidates for a given multiple join of tables. Each substitute candidate includes a candidate multiple join of tables, and the number of tables of each candidate multiple join is less than the number of tables of the given multiple join. A given substitute candidate is selected based on a cardinality of the candidate multiple join of the given substitute candidate; a join order for the given multiple join is determined based on the given substitute candidate; and the query is processed based on the determined join order.

Abstract: The invention relates to a platform and a method of connecting a blockchain engine to a traditional database. The platform according to the invention is implemented in the form of a network of nodes, said network of nodes being divided into at least two subnets: a security subnet and a data subnet, all nodes in the security subnet containing information on security keys user licenses, operating licenses, access policies, and other information related to the licensing, authentication, and authorization mechanism of users accessing the platform, and where nodes in at least one data subnet comprise a software component that uses a network computer, an API communication interface that allows interaction with the computer network and retrieval of information to be saved in the storage system, a GraphQL data query interface, a data processing engine, a blockchain engine, a connection interface between the data processing and blockchain engine, and a database.

Abstract: A branch of a main database is created, comprising a copy of the main database schema. A user edits the branch and requests that it be merged back into the main database. A schema diff is generated and used to determine differences between the main database and the edited branch. The merge is performed if it does not create a conflict. A second branch is created and edited by a second user. When the second user indicates to merge the second branch back into the main database, differences between the two branches are determined, relative to the main database. If merging the second branch back into the main database on top of the first branch does not create a conflict, a three-way merge is performed of the first branch, the second branch, and the version of the main database from which the first and second branches were generated.

Abstract: Aspects of the disclosure relate to joining data tables. A computing platform may input two or more tables into a statistical join function, which may initiate execution of the statistical join function, and where executing the statistical join function comprises applying one or more of: an end condition function, a partition tables function, or an outer join function to generate a new table that includes information from the two or more tables. The computing platform may send, to a user device, the new table and one or more commands directing the user device to display the new table, which may cause the user device to display the new table.

Abstract: A data storage system includes storage and a global enumerator. The storage stores data chunks, object level metadata associated with portions of the data chunks, and chunk level metadata associated with respective data chunks. The global enumerator obtains an update request including a metadata characteristic and update data; in response to obtaining the update request: matches the metadata characteristic to at least one selected from a group consisting of a portion of the object level metadata and a portion of the chunk level metadata to identify an implicated metadata portion; and modifies, based on the update data, the implicated metadata portion.

Abstract: A computer system stores a database of multi-dimensional variables indicating field values of rate plan objects. The database stores rules related to each rate plan object. The computer system forms a primary catalog comprising all of the multi-dimensional variables from all rate plan objects from the database. The computer system receives a first user input indicating a first plurality of field entries. The computer system forms a secondary catalog that inherits all rate plan objects of the primary catalog. The computer system identifies, in the secondary catalog, first fields values that do not correspond to the first plurality of field entries based on the rules for the rate plan objects corresponding to the first plurality of field entries. The identified first fields values are removed from the secondary catalog. A second rate plan object is formed based on the secondary catalog.

Abstract: An in-vehicle processing device includes: a signal input unit that generates input data based on an input signal from outside; a processing unit that executes arithmetic processing for calculating output data based on the input data; a signal output unit that generates an output signal based on the output data to output the output signal to the outside; and a storage unit that stores application software for causing the processing unit to execute the arithmetic processing. The application software includes: a data management layer for managing object data which is a collection of data corresponding to a given target element on the storage unit; a data adaptation layer for generating the object data based on the input data to output the generated object data to the data management layer; and a data operation layer for acquiring the object data from the data management layer to calculate the output data based on the acquired object data.

Abstract: Embodiments relate to high throughput blockchain systems that can handle large numbers of real-time operations. A system may include a server that handles the matching of operations in a quick and trusted manner and a blockchain that executes the matched operations in a decentralized manner after the matching is confirmed by the server. The server may receive an operation request from a user. To confirm the operation request, the user may cause a broadcast of entry on the blockchain that confirms the validity of the operation request. Upon verifying the operation request, the server may match the operation request with other operation requests that meet the criteria specified by the user's request. A set of code instructions recorded on the blockchain may generate one or more entries that execute the operations related to the match.

Abstract: A method and a system for performing context-based search. The method is executed by a processing module. The method includes developing a search database, developing a search query, and retrieving at least one context-based data-record from the search database.

Abstract: For multiple queries written for a first database, some embodiments provide a method of processing the queries on a second database. From a client, the method receives individually each of the multiple queries written for the first database. The method performs an automated process to analyze properties of the second database to determine that the multiple queries can be replaced by a single query to the second database. Based on the determination, the method combines the multiple queries to generate a single query for the second database. The method forwards the generated single query to the second database for execution.

Abstract: A system, computer implemented method, and computer storage medium encoded with a computer program, for identifying newly trending topics in a data stream. An example method includes: receiving text documents forming part of a data stream from one or more servers; identifying terms within the received text documents; deriving from the identified terms, a set of terms identified as abnormal by virtue of having a relatively high frequency of occurrence within the text documents received in a recent period compared with that expected from their historic occurrence; creating a first set of one or more clusters, each cluster including a group of terms from the set of terms identified as abnormal which through their degree of co-occurrence in the received text documents are considered to relate to the same topic; and comparing clusters of a further set with the clusters of the first set to determine whether a cluster of the further set pertains to the same topic.

Abstract: Described herein includes a calculation scenario of a calculation engine that efficiently partitions data for processing at separate hosts, including in parallel, and unions intermediate results from such separate processing when required for further processing. Such parallel processing of partitions can allow for faster processing times, and such unioning of data only when required for further processing can limit the transferring of data that results in slower processing.

Abstract: A system for increasing computing efficiency is disclosed. The system includes a memory that stores at least one tabular constraint. The tabular constraint contains a finite array of symbols, with each symbol representing a value thereby creating a relational symbol (r-symbol), or a potentially infinite set of values, with such a symbol thereby creating a quasi-finite symbol (QF-symbol). The system includes a program configured to compress and to query the tabular constraint.

Abstract: A data caching method comprises: after receiving a data request sent by a client, determining a remaining valid cache duration of cache data corresponding to the data request; determining whether the remaining valid cache duration is greater than a preset update threshold value; and if the remaining valid cache duration is less than or equal to the update threshold value, updating the cache data through a database.

Abstract: A system and method for a text search of a database, including converting a text search expression to a query plan and implementing the text search as the query plan on the database. The implementing of the text search includes a one-pass indexing as a single scan of an inverse index table associated with the database.

Abstract: Systems and methods for processing requests for shared records are described. A server computing system receives a data access request associated with a user. The server determines shared records granted by a first sharing rule associated with the user in response to receiving a data access request. The server processes the data access request based on the shared records granted by the first sharing rule and shared records granted by a second sharing rule associated with the user. The shared records granted by the second sharing rule having been determined prior to receiving the data access request, the first sharing rule and the second sharing rule generated prior to receiving the data access request.

Abstract: An apparatus for constructing Aho-Corasick automata according to the present invention includes a concatenative normal form transforming unit configured to receive a regular expression that is expressed using an operator including a concatenation and an alternation and transform the regular expression into concatenative normal forms (wherein each concatenative normal form is defined as a form in which character alternations are connected by concatenation); a trie generating unit configured to generate a trie from the concatenative normal forms by updating states and transitions of the trie (wherein each transition corresponds to a set of characters) while processing each concatenative normal form in order; and a failure link creating unit configured to create a failure link for each state of the trie by using a set of characters corresponding to each transition of the trie.

Abstract: In one aspect, a computer-implemented method includes detecting, by a server includes one or more processors, a request to perform a hash join operation on a data structure stored in a data storage device, forming a hash lookup dictionary based on lookup results in a hash table, storing the hash lookup dictionary in a cache, and probing, during a probing phase of the hash join operation, the cache.