Abstract: Techniques support graph pattern matching queries inside a relational database management system (RDBMS) that supports SQL execution. The techniques compile a graph pattern matching query into a SQL query that can then be executed by the relational engine. As a result, techniques enable execution of graph pattern matching queries on top of the relational engine by avoiding any change in the existing SQL engine.

Abstract: The present invention provides a data transmission device and method thereof. A data transmission system includes: an electric device generating an input message; a Natural Language Processing (NLP) engine connected to the electric device, receiving the input message, and judging whether an output message corresponding to the input message is available on a real-time basis or on a non-real-time basis; a plurality of third-party servers; a service cloud framework connected to one of the NLP engine, the electric device, and the plurality of third-party servers to obtain a real-time information; and a buffer cloud framework connected to one of the NLP engine, the electric device and the plurality of third-party servers, proactively downloading at least one updated data from the plurality of third-party servers once in a predetermined period of time, automatically saving the at least one updated data therein, and obtaining a non-real-time information therefrom.

Abstract: Examples of the present disclosure describe systems and methods for migrating mailbox identities. In aspects, a system may receive one or more requests to perform tasks for migrating identities of a plurality of mailboxes included in a security group created at a source tenant to a plurality of mail users created at a target tenant that correspond to the plurality of mailboxes. Based on the one or more requests, the system may copy the identities to a data store associated with the target tenant, upload mapping data to the data store, and use that mapping data to map the identities copied to the data store to the corresponding plurality of mail users in the target tenant. For each of the identities mapped, the system may copy at least one or more attributes of the respective identity from the data store to the respective corresponding mail user in the target tenant.

Abstract: The present invention relates to an online search method and device that accounts for relevance and difference, wherein the method comprises: determining an initial search result set according to a query request input by a user, and selecting a plurality of search results with the greatest degrees of difference from the initial search result set, as a final search result set. The specific process comprises: initially obtaining a plurality of candidate results according to the query request submitted by the user; using a semantic matrix to describe the attribute characteristics of documents corresponding to the candidate results; calculating similarities among the documents according to the attribute characteristics of the documents, and then clustering the candidate results into a plurality of cluster blocks; selecting a representative from each cluster block; and constructing the final search result set according to the selected representatives.

Abstract: According to one embodiment, an information processing apparatus includes a processor. The processor is configured to receive, from a client terminal, a first query to request a result of a join operation process on first and second tables, create a second query to a first database management device based on the first query, receive the first table from the first database management device by performing a process on the second query, create a third query to a second database management device based on the first query and the first table, receive a part of a second table from the second database management device by performing a process on the third query, and transmit, to the client terminal, a response to the first query based on the part of the second table.

Abstract: Systems, methods, and storage media for generating an online analytical processing cube (MAP) are disclosed. Exemplary implementations may: receive a cube definition file; access a data-source; generate a data-source property configuration for the data-source using the cube definition file to; determine each of respective parsed data from the data-source is a key, attribute, or measure; and generate the OLAP cube by combining the cube definition file and the data-source property configuration for the determined parsed data from the data-source.

Abstract: Embodiments of the present disclosure provide a data migration method and apparatus. The method includes: receiving a migration task of migrating data in a first system to a second system; and calling upper-layer interfaces corresponding to the migration task, and calling underlying operation interfaces of the first system and the second system by the upper-layer interfaces through an abstract interface class to migrate the data of the first system to the second system. Bidirectional data transmission and migration can be implemented between any two data ends. Bidirectional data transmission and migration between any data terminals.

Abstract: Techniques are disclosed relating to database query optimizers. In some embodiments, a query parser of a database system receives a query requesting data from a multi-tenant database. The query includes a first constraint that restricts a query optimizer's selection of a set of execution plans available to implement the query. The database system determines whether an override has been specified for a particular tenant associated with the received query, the override indicating that the first constraint is to be replaced with a second constraint for the particular tenant. In response to determining that the override has been specified for the particular tenant, the database system replaces the first constraint in the query with the second constraint and provides the query with the second constraint to the query optimizer for selection of an execution plan in accordance with the second constraint.

Abstract: Disclosed are various embodiments for using a distributed ledger to track the evolution or deployment of feature sets for machine-learning. A registration request is received from a first node of a distributed ledger, the registration request comprising a code hash representing a feature set generator and a data hash representing a data set. The registration request is then relayed to a second node of the distributed ledger for approval by the second node. Next, an approval for the registration request is received from the second node. Subsequently, an entry in the distributed ledger comprising the code hash and the data hash is created.

Abstract: A computationally-efficient object conversion system maintains multiple objects. Each object includes an array of characters and a hash value. Instructions include maintaining strings in a one-to-one relationship with the objects. The instructions include, for each object, calculating the hash value in response to values being written to the array of the object. The instructions include defining an equals method that, for first and second objects, returns a true value in response to values of the array of the first object matching values of the array of the second object. The instructions include defining a hash method that, for a selected object, returns the hash value. The instructions include, in response to a request including a request string, determining whether one of the strings is equal to the request string and, if so, returning the object related to the one of the strings.

Abstract: A memory management system implements instructions including maintaining multiple pool data structures, each associated with a linked list of objects and including a head pointer pointing to the first element in the linked list. The instructions include, in response to a first object no longer being needed, recycling the first object by identifying a first pool data structure that corresponds to the first object and inserting the first object into the linked list without deallocating the memory for the first object. The instructions include, in response to a new object request, identifying a second pool data structure according to a feature of the new object. If the corresponding linked list is empty, memory is allocated for the new object and the new object is assigned to the second pool data structure. If the linked list is not empty, the first object is removed from the linked list and returned.

Abstract: Systems, methods, and computer-readable media for fuzzy-searches on encrypted messages include maintaining, in an indexer, a dictionary of words appearing in a message history. Upon receiving a query including at least one search term, a fuzzy search of the dictionary using the at least one search term is performed to determine one or more fuzzy-matching words in the dictionary, and one or more search tokens are generated from the one or more fuzzy-matching words, the one or more search tokens including encrypted versions of the one or more fuzzy-matching words. The one or more search tokens are provided to a search service for searching a database of encrypted messages of the message history, where the at least one search term may not have an exact match with any of the words in the dictionary.

Abstract: A query engine or compute engine receiving a query request identifies a plurality of data sources for satisfying a query request, and determines, from among multiple data sources, one or more fields likely to incur substantial computational demands in processing the query request. Pre-positioning aggregation logic moves the determined fields one data source to another data source for positioning the moved fields to a single data source from which the query result will be computed.

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 system, program product, and method for enhancing automatic multidimensional query processing. The method includes executing a database query including semi-joining a plurality of dimension tables with a fact table. The method also includes identifying for extraction one or more data values from each dimension table of the plurality of dimension tables. The data values from each dimension table of the plurality of dimension tables are associated with a respective record identification (RID), thereby defining one or more RIDs. The method further includes generating a plurality of RID lists. Each RID list of the plurality of RID lists includes a collection of the one or more RIDs for the respective dimension table. The method also includes merging the plurality of RID lists, sorting, subject to the merging, the plurality of RIDs as a function of data location, and fetching the data values from the fact table.

Abstract: Systems, methods, and computer media are described for index-based join size estimation. For a join operation between two tables, a filter is applied to the first table, resulting in a filter output. The filter output is then sampled. For each sample, an index for a second table is accessed and counts of records in the second table that match the sample are retrieved. Using the sample size and the retrieved counts from the index of the second table, a data size for the join operation can be efficiently and accurately estimated. Statistical confidence in the estimate can also be assessed using variance-based calculations.

Abstract: A system includes reception of a query execution plan associated with a plurality of query execution pipelines, estimated execution costs and estimated intermediate result cardinalities, determination of one or more precedence relationships of the plurality of query execution pipelines, determination of an execution order of the plurality of query execution pipelines based on the estimated execution costs, the estimated intermediate result cardinalities, and the one or more precedence relationships, and providing of the execution order of the plurality of query execution pipelines and the query execution plan to a query execution engine.

Abstract: The present invention relates to join acceleration. In an embodiment, a computer receives a request for a relational join of build data rows with probe data rows. Based on the request for the relational join, a particular kind of data map from many kinds of data map that can implement the relational join is dynamically selected. Based on the build data rows, an instance of the particular kind of data map is populated. A response is sent for the request for the relational join that is based on the probe data rows and the instance of the particular kind of data map.

Abstract: Systems, devices, media, and methods are presented for assembling a database for query generation. The database is assembled by receiving a query history log, the query history log including target queries and a mapping between each of the target queries and associated subqueries for each of the target queries, selecting one or more of the associated subqueries for a first target query based on a conditional probability exceeding a threshold for the associated subqueries of the first target query compared to the matching associated subqueries of the other target queries, and including the first target query and the selected one or more associated subqueries for the first target query in the in-memory data structure store for query generation.

Abstract: In order to improve the integrating of datasets, improved systems and methods for matching records from a first dataset and a second dataset are provided. Records from the first dataset and the second dataset that are associated with the same individuals are identified. The records are identified using a combination of Euclidean distance, Leviathan distance, and the application of one or more rules. Once the records that are associated with the same individuals are identified, the records can be combined in an integrated dataset.