Patent classifications
G06F16/24564
Key pattern management in multi-tenancy database systems
The present disclosure involves systems, software, and computer implemented methods for key pattern management. One example method includes receiving a query for a logical database table from an application. A determination is made as to whether the query is a write query. In response to determining that the query is a write query, a determination is made as to whether the query complies with a key pattern configuration that describes keys of records included in a physical database table that is part of a logical table implementation. The physical table includes records of the logical database table that are allowed to be written by the application. The write query is redirected to the physical database table in response to determining that the query complies with the key pattern definition. The query is rejected in response to determining that the query does not comply with the key pattern configuration.
Entity identification based on a record pattern
The methods described herein are configured to obtain a first record pattern associated with the unidentified entity and select a second record pattern associated with an entity identifier of a known entity. Based on the first record pattern matching the second record pattern, the entity identifier of the known entity is associated to the unidentified entity to indicate that the unidentified entity and the known entity are the same. Determining the entity identifier of the unidentified entity enables the linking of separate identifier systems of data structures to facilitate communication and/or interaction between the data structures.
INFORMATION PROCESSING SYSTEM AND LINEAGE MANAGEMENT METHOD
Provided is an information processing system by which more appropriate lineage management is possible. A lineage unit management system 3 determines a lineage unit based on a processing content of data processing for generating output data including one or more elements from input data including one or more elements. A lineage management system 4 generates lineage information indicating correspondence relation between the elements of the input data and the elements of the output data in accordance with the lineage unit. Therefore, the lineage information is generated in accordance with the lineage unit corresponding to the content of the data processing, so that more appropriate lineage management is possible.
OPERATION FRAGMENTATION WITH METADATA SERIALIZATION IN QUERY PROCESSING PUSHDOWNS
Methods for operation fragmentation with metadata serialization in query processing pushdowns are performed by systems and devices. A compute node receives a query directed to database data, and generates query text fragments. Portions of metadata of the database are read from different page servers, and are serialized by the compute node. Page identities of data pages in a page server that stores the data are determined from a page index at the compute node, and the compute node provides the text fragments, the serialized metadata, and the page identities to the page server storing the data. The page server compiles the text fragments based on the serialized metadata to generate an executable query plan for the query. The page server initializes and performs execution of the executable query plan against the data as a pushdown query operation, and a result of pushdown query operation is provided to the compute node.
DATA EXTRACTION FROM A MULTIDIMENSIONAL DATA STRUCTURE
In some implementations, a device may identify respective sets of unique values for multiple dimensions of a multidimensional data structure. The device may identify a plurality of subsets of permutations of a set of permutations of the unique values. The plurality of subsets of permutations are to be processed in parallel. The device may obtain, based on processing the plurality of subsets of permutations in parallel, respective data associated with each permutation of the plurality of subsets of permutations. The data for a permutation, of the plurality of subsets of permutations, is obtained based on respective unique values for the permutation that are determined independently of another permutation of the plurality of subsets of permutations.
System, device and method for providing passenger or user information
A computer processing device for determining whether to allow or deny access to a database associated with the device is provided. The device is configured to determine the origin of data signed with a first key by comparing the key to one or more keys stored in a further database to identify the source of the data; search the database to determine one or more access rules associated with the source of the data, wherein the access rules define whether write access to the database is allowed or denied for the data; and allow or deny write access to the database based on the determined rule or rules.
Method and apparatus for automatically mapping physical data models/objects to logical data models and business terms
Various methods, apparatuses/systems, and media for automatically mapping physical data models or objects to logical data models which in turn are automatically mapped to business terms are disclosed. A database stores a raw physical data model of an application. A processor extracts the raw physical data model of the application from the database. The processor also converts physical object names associated with the raw physical data model into English terms based on a taxonomy expansion list; applies a plurality of standardization and contextualization rules to the English terms generated from converting the physical object names; outputs names based on applying the plurality of standardization and contextualization rules to the English terms; applies fuzzy logic and machine learning routines and matching algorithms for matching the names to predefined logical terms; and automatically generates a mapping of physical objects or elements in the application with logical attributes and related business terms.
FAST AND SLOW RESOURCE POOLS FOR QUERY EXECUTION
A method for query execution using a dual-resource pool design (e.g., a fast resource pool and a slow resource pool design) is provided. The method includes receiving a first query requesting retrieval of first data from a database, admitting the first query to a fast resource pool for execution, wherein the fast resource pool is configured with one or more thresholds for execution, executing the first query in the fast resource pool using resources allocated to the fast resource pool, during execution of the first query in the fast resource pool, determining the one or more thresholds for execution have been exceeded, admitting the first query to a slow resource pool for execution, and executing the first query in the slow resource pool using resources allocated to the slow resource pool.
Query completions
Methods, systems, and apparatus, including computer programs encoded on computer storage media, for ranking query completions based on activity session data. One of the methods includes receiving a query prefix from a user. A reference parameter for the user is obtained. One or more likely queries that are likely to co-occur with the reference parameter in user activity sessions are identified, wherein each likely query has an associated prediction score. A ranking of the one or more likely queries is provided in response to receiving the query prefix.
System and method for governing execution of a geography dependent computer process
Methods and systems for governing execution of a geography dependent computer process are provided. In one aspect, a method includes receiving a target location comprising a geographic identifier. The method also includes accessing a data store comprising a plurality of maps. Each map of the plurality of maps includes a plurality of geometric shapes and each geometric shape is associated with an execution rule. The method also includes determining which geometric shape of the plurality of geometric shapes the geographic identifier is bounded within for at least two maps of the plurality of maps. The method further includes generating an aggregate rule set based on each execution rule associated with each geometric shape determined to bound the geographic identifier. The method further includes applying the aggregate rule set. Machine-readable media are also provided.