US20090271385A1 - System and method for parallel query evaluation - Google Patents
System and method for parallel query evaluation Download PDFInfo
- Publication number
- US20090271385A1 US20090271385A1 US12/431,296 US43129609A US2009271385A1 US 20090271385 A1 US20090271385 A1 US 20090271385A1 US 43129609 A US43129609 A US 43129609A US 2009271385 A1 US2009271385 A1 US 2009271385A1
- Authority
- US
- United States
- Prior art keywords
- query
- input query
- sub
- queries
- input
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2453—Query optimisation
- G06F16/24532—Query optimisation of parallel queries
Definitions
- the present invention is directed towards providing a parallel query processing framework. More particularly, the present invention provides a system and method for dynamically fragmenting a query into multiple sub-queries, executing individual sub-queries over a grid network, aggregating the sub-query results and streaming the query results to users.
- the invention provides a system for parallel query processing.
- the system comprises a query fragment identifier module for estimating a number of sub-queries that may be formed corresponding to an input query based on a number of query evaluator nodes available for processing the input query and processing characteristics of the available query evaluator nodes, the query evaluator nodes accessing one or more databases being referenced by the input query for processing the input query; a query splitter module for fragmenting the input query into a plurality of sub queries by adding one or more filter predicates to the input query without altering the semantics of the input query; a scheduler for scheduling the processing of the sub queries; a result aggregator module for aggregating results of the processed sub queries; a streaming module for streaming results of the processed sub queries; and a metadata manager for storing processing characteristics of the one or more query evaluator nodes and information regarding the one or more databases being referenced by the input query.
- the system for parallel query processing further comprises a plurality of query optimizer nodes for generating optimal query plans comprising one or more query partitions for processing the fragmented input query.
- the input query is written in a structured query language.
- the query fragment identifier module estimates the number of sub-queries that may be formed corresponding to the input query as equal to a number of healthy query evaluator nodes available for processing the input query; a query evaluator node being selected as healthy based on memory required for storing each record of a predetermined table of a predetermined database being referenced by the input query and available memory and processing speed of the evaluator node.
- the scheduler schedules the sub queries for processing by using a round robin algorithm.
- the metadata manager is updated periodically and comprises a machine characteristics repository and a database characteristics repository.
- the database characteristics repository stores physical and logical metadata information corresponding to the one or more databases being referenced by the input query; logical metadata information comprising information regarding schema of the one or more databases being referenced by the input query; physical metadata information comprising information regarding statistics of the one or more databases being referenced by the input query.
- the database characteristics repository stores names of the one or more databases being referenced by the input query, names of the one or more tables being referenced by the input query, attribute names obtained from the one or more tables being referenced by the input query as active keys, data types of the active keys, and ranges of the active keys.
- the invention also provides a method for parallel query processing comprising the steps of: estimating a number of sub-queries that may be formed corresponding to an input query; fragmenting the input query into a plurality of sub queries by adding one or more filter predicates to the input query without altering the semantics of the input query; scheduling the processing of the sub queries; generating one or more query execution plans comprising one or more query partitions corresponding to each sub query; processing the generated one or more query execution plans; and collating, aggregating and presenting results of the processed sub queries in a required format.
- the method for parallel query processing further comprises the step of streaming the results of the processed sub queries in a required format.
- the step of estimating a number of sub-queries that may be formed corresponding to an input query comprises the steps of: parsing the input query and extracting one or more query attributes for obtaining references to one or more databases and tables corresponding to the input query; selecting a first database that corresponds to at least one of the extracted attributes and table combination as a base database; selecting a table from the base database based on a number of records contained in the table; computing memory required for storing the selected table; obtaining available memory and processing speed of each evaluator node available for processing the input query; selecting an evaluator node available for processing the input query as a healthy evaluator node if the available memory corresponding to the evaluator node is greater than or equal to half of the computed and if the processing speed of the evaluator node is greater than a predetermined threshold; and estimating a number of sub-queries
- the step of fragmenting the input query into a plurality of sub queries by adding one or more filter predicates to the input query without altering the semantics of the input query comprises the steps of: classifying the input query into query sub-segments; determining suitability of the input query for fragmentation by analyzing the query sub-segments; determining if a ‘where’ sub-segment of the input query comprises an ‘OR’ operation and does not comprise a ‘group-by’ operator; fragmenting the input query into one or more sub queries by using the ‘OR’ operator if the ‘where’ sub-segment of the input query comprises an ‘OR’ operation and does not comprise a ‘group-by’ operator; and fragmenting the input query into one or more sub queries by using an active key of the database table being referenced by the input query if the ‘where’ sub-segment of the input query comprises an ‘OR’ operation and does not comprise a ‘group-by’ operator.
- FIG. 1 is a block diagram depicting a system for parallel query evaluation
- FIG. 2 illustrates an exemplary structure of database characteristics repository of the metadata manager
- FIG. 3 is a flowchart illustrating a method for parallel query evaluation
- FIG. 4 illustrates a method of fragmenting an input query into multiple sub-queries.
- Input queries are processed in a parallel mode by identifying the number of sub-queries the input query may be fragmented into, fragmenting the input query, processing the sub-queries, aggregating the sub-query results and streaming the query results.
- the present invention does not require underlying databases being referenced by the input queries to be partitioned.
- the method of the invention may be provided on a computer readable medium.
- FIG. 1 is a block diagram depicting a system for parallel query evaluation.
- System 100 comprises a query fragment identifier (QFI) module 102 , a query splitter (QS) module 104 , a scheduler 106 , a plurality of query optimizer nodes 108 , a plurality of query evaluator nodes 110 , one or more databases 112 , a result aggregator (RA) module 114 , a streaming module 116 and a metadata manager 118 .
- Metadata manager 118 comprises a machine characteristics repository 120 and a database characteristics repository 122 .
- QFI module 102 estimates a near optimal number of sub-queries that may be formed corresponding to an input query.
- the input query may be written in any query language known in the art.
- SQL structured query language
- the number of sub-queries that may be formed is dependent on the number of query evaluator nodes 110 available for processing the input query as well as the processing characteristics of the query evaluator nodes 110 , such as the available processor speed and memory.
- Query evaluator nodes 110 comprise any computing devices that may process the input query by accessing the required one or more databases 112 .
- the input query is parsed and the query attributes are extracted.
- the extracted attributes are used to obtain references to one or more databases 112 and tables corresponding to the query.
- Information regarding the one or more databases 112 and tables corresponding to the query is stored in the database characteristics repository 122 of the metadata manager 118 .
- a first database that corresponds to at least one of the extracted attribute(s) and table combination is selected as a base database.
- the base database is used for computation of a near optimal number of sub-queries that may be formed corresponding to the input query and a table selected from the base database.
- a table from base database is selected based on maximum number of records. In other embodiments, various other heuristic methods may be applied to select a table from base database.
- the selected base database and table is used for splitting the input query into multiple sub-queries.
- QFI module 102 computes the number of healthy query evaluator nodes 110 available for processing the input query.
- the near optimal number of sub-queries that may be formed corresponding to the input query is equal to the number of healthy query evaluator nodes 110 available for processing the input query.
- the health of an evaluator node 110 is computed by using data such as the memory for storing each record of the selected table of the base database, and the available memory and processing speed of the evaluator node 110 .
- the total memory required for storing a selected table is computed as:
- record size depicts the maximum row size of the selected table
- number of tuples depicts the total number of rows in the selected table
- number of evaluator nodes depicts the total number of evaluator nodes 110 available for processing the input query.
- the available memory and processor speeds of all the evaluator nodes 110 available for processing the input query is stored in the machine characteristics repository 120 of the metadata manager 118 .
- Machine characteristics repository 120 is updated periodically. Once the total memory required for storing a selected table is computed by using Equation (1) the available memory and processor speeds of all the evaluator nodes 110 available for processing the input query are dynamically obtained from machine characteristics repository 120 .
- An evaluator node 110 is considered to be healthy if the available memory corresponding to it is greater than or equal to half of the computed required memory and if its processor speed is greater than fifty percent. In an embodiment of the present invention, if none of the evaluator nodes 110 satisfy the sufficient memory and processor requirement then the number of sub-queries that may be formed corresponding to the input query is equal to the total number of evaluator nodes 110 .
- FIG. 2 illustrates an exemplary structure of database characteristics repository 122 of the metadata manager 118 .
- the database characteristics repository 122 of the metadata manager 118 is updated periodically.
- the column titled ‘Ranger_ID’ 202 stores unique identifier of entries in the database characteristics repository 122 .
- the column titled ‘DBNAME’ 204 stores names of all databases that may be referenced by an input query.
- the column titled ‘TABLENAME’ 206 stores names of all tables that may be referenced by an input query.
- the column titled ‘ACTIVE_KEY’ 208 stores attribute names obtained from the corresponding tables. In an embodiment of the present invention, the attribute names stored under the head ‘ACTIVE_KEY’ 208 are the primary keys of the corresponding tables.
- the column titled ‘KEY_TYPE’ 210 stores the data type of the corresponding active keys.
- the data types may be stored as ‘I’ depicting integer type, ‘N’ depicting numeric type, ‘C’ depicting character domain type and ‘D’ depicting date type.
- the columns titled ‘RANGE_START’ 212 and ‘RANGE_END’ 214 store the minimum and maximum values respectively of the active keys where the data type of the active keys is either integer (I) or numeric (N).
- the column titled ‘VALUE’ 216 stores the domain value of the active keys where the data type of the active keys is either character (C) or Date (D).
- the figure stored in the column titled ‘Ranger_ID’ is ‘1’ depicting the first entry in the database characteristics repository 122 .
- the database name is ‘Banking’
- the table name is ‘CUST_DETAILS’
- the active key is the ‘ACCOUNT_No’ attribute of the table ‘CUST_DETAILS’
- the data type of the active key is ‘I’ depicting integer type and the minimum and maximum values respectively of the active key ‘ACCOUNT_No’ are ‘1000’ and ‘8700’ respectively.
- the figure stored in the column titled ‘Ranger_ID’ is ‘4’ depicting the fourth entry in the database characteristics repository 122 .
- the database name is ‘Banking’
- the table name is ‘CUST_DETAILS’
- the active key is the ‘ACCOUNT_TYPE’ attribute of the table ‘CUST_DETAILS’
- the data type of the active key is ‘C’ depicting character domain type
- the minimum and maximum values respectively of the active key ‘ACCOUNT_TYPE’ are null and the value of the active key may be ‘Savings’ or ‘Current’.
- the value stored in the column titled ‘Ranger_ID’ is ‘7’ depicting the seventh entry in the database characteristics repository 122 .
- the database name is ‘Banking’
- the table name is ‘CUST_TRANSACTION’
- the active key is the ‘TRANS_DATE’ attribute of the table ‘CUST_TRANSACTION’
- the data type of the active key is ‘D’ depicting date type
- the minimum and maximum values respectively of the active key ‘TRANS_DATE’ are null and the value of the active key may be ‘2005-1-1’ or ‘2007-8-9’.
- database characteristics repository 122 of the metadata manager 118 comprises physical and logical metadata information corresponding to underlying databases 112 .
- Logical metadata information comprises information regarding the schema of a database such as table names, column names, referential keys, etc.
- Physical metadata information comprises information regarding database statistics such as number of tables in a database, number of rows in a table, number of columns in a table, cost of database access, index access cost, etc.
- QS module 104 fragments the input query into multiple sub-queries.
- the input query is fragmented by adding a filter predicate in a manner such that the semantics of the input query are not altered.
- the filter predicate is added to the input query by using an active key corresponding to the table and database being referenced by the input query.
- Information regarding the active key, table name and database name is obtained by the QFI module 102 from the database characteristics repository 122 of the metadata manager 118 .
- QS module 104 fragments the input query into multiple sub-queries thereby enabling scheduler 106 to evenly distribute the processing load among the plurality of query optimizer nodes 108 .
- the allocation of sub-queries to the query optimizer nodes 108 is done by scheduler 106 in a Round-Robin fashion.
- the scheduler 106 also sends information about each of the healthy evaluator nodes 110 identified by QFI module 102 to the query optimizer nodes 108 .
- the optimizer nodes are computing devices that generate optimal query plans for execution of the fragmented input query. Optimal query plans may be generated by using any of the query plan generation algorithms commonly known in the art.
- optimizer nodes 108 perform functions such as determining an efficient join ordering plan, join algorithm types and access paths, generating parallel plans for query execution, and scheduling the query plan for execution.
- the query plans generated by the optimizer nodes may have one or more query partitions.
- One or more query partitions are generated since the input query may reference multiple databases 112 dispersed geographically.
- Scheduler 106 re-schedules sub-queries, if any of the optimizer nodes 108 fails during execution of a sub-query, thereby providing a fault-tolerant system. The re-scheduling is performed without any manual intervention. In an exemplary scenario, where all the optimizer nodes 108 fail to execute, the input query is not executed and in various embodiments user intervention may be required.
- Each of the generated query partitions are scheduled for execution on the evaluator nodes 110 .
- Evaluator nodes 110 parse each of the query partitions and execute individual operators such as table scan operator, hash join operator, project operator, aggregation operator, exchange operator etc., occurring in the partition.
- Evaluator nodes 110 execute the query partitions by connecting to one or more databases 112 for performing table scan operation, by performing joining of tables defined in the hash join operator, and by federating with one or more other query evaluator nodes 110 for exchanging the data specified in the exchange operator.
- the allocation of sub-queries to the healthy evaluator nodes 110 is done by scheduler 106 in a Round-Robin fashion.
- Scheduler 106 re-schedules sub-queries, if any of the healthy evaluator nodes 110 fails during execution of a sub-query, thereby providing a fault-tolerant system.
- scheduler 106 allocates the query to a next available evaluator node. The re-allocation or re-scheduling is performed without requiring manual intervention.
- scheduler 106 allocates the queries to a re-run queue from which the failed sub-queries are re-scheduled on the next available evaluator node.
- scheduler 106 allocates the queries to a re-run queue from which the failed sub-queries are re-scheduled on the next available evaluator node.
- all the available evaluator nodes 110 fail to execute, the input query is not executed and in various embodiments user intervention may be required.
- RA module 114 collects the results of all the executed sub-queries, aggregates the results and presents them in a required format.
- Streaming module 116 provides a result set streaming feature where the result is streamed to the client as and when received, without waiting for the complete result set to be received. Hence streaming module 116 provides an improved throughput of the query evaluation.
- FIG. 3 is a flowchart illustrating a method for parallel query evaluation.
- a near optimal number of sub-queries that may be formed corresponding to an input query is estimated by computing the number of healthy query evaluator nodes available for processing the input query.
- the input query is parsed and the query attributes are extracted.
- the extracted attributes are used to obtain references to one or more databases and tables corresponding to the query.
- a first database that corresponds to at least one of the extracted attribute(s) and table combination is selected as a base database.
- a table selected from the base database, comprising the maximum number of records, is used for splitting the input query into multiple sub-queries.
- each evaluator node available for processing the input query is computed by using data such as the memory for storing each record of the selected table of the base database, and the available memory and processing speed of the respective evaluator node.
- the total memory required for storing a selected table is computed by using Equation (1) provided with reference to FIG. 1 .
- the available memory and processor speeds of all the evaluator nodes available for processing the input query are dynamically obtained from a machine characteristics repository. An evaluator node is considered to be healthy if the available memory corresponding to it is greater than or equal to half of the computed required memory and if its processor speed is greater than fifty percent.
- the number of sub-queries that may be formed corresponding to the input query is equal to the total number of evaluator nodes.
- an input query reads as: Select productid, productname from Products;
- the input query is fragmented into multiple sub-queries.
- the input query is fragmented by adding a filter predicate in a manner such that the semantics of the input query are not altered.
- the filter predicate is added to the input query by using an active key corresponding to the table and database being referenced by the input query.
- each sub-query is scheduled on one or more optimizer nodes.
- the allocation of sub-queries to the query optimizer nodes is done in a Round-Robin fashion.
- the optimizer nodes are computing devices that generate optimal query plans for execution of the fragmented input query.
- optimal query execution plans comprising one or more query partitions are generated corresponding to each query.
- Optimal query plans may be generated by using any of the query plan generation algorithms commonly known in the art.
- the query plans generated may have one or more query partitions.
- One or more query partitions are generated since the input query may reference multiple databases dispersed geographically.
- each of the generated query partitions are scheduled for execution on one or more healthy evaluator nodes.
- the results of all the executed sub-queries are collated, aggregated and presented in a required format.
- examples of the SQL operations supported comprise Count( ), Sum( ), Min( ), Max( ), Avg( ), Group by ( ) and Order by [asc/desc].
- FIG. 4 illustrates a method of fragmenting an input query into multiple sub-queries.
- an input query is classified into query sub-segments.
- various examples of input SQL queries classified into sub-segments include:
- a depicts ‘select’ segment; b depicts ‘from’ segment; c depicts ‘where’ segment; d depicts ‘group by’ segment; e depicts ‘having’ segment; and f depicts ‘order by’ segment.
- step 404 comprises: parsing a ‘select’ sub-segment to collect the projected attributes of the input query; determining whether a ‘having’ sub-segment comprises any aggregate function; determining whether only the projected attributes of the input query are used in ‘group-by’ or ‘order-by’ or ‘having’ sub-segments; collecting attributes corresponding to ‘where’ sub-segment of the input query; parsing ‘select’ and ‘from’ sub-segments to collect tablename and any objects if defined for them; determining whether the input query is suitable for fragmenting based upon the collected data.
- step 406 it is determined whether a ‘where’ sub-segment of the input query comprises an ‘OR’ operation and does not comprise a ‘group-by’ operator.
- step 408 if it is determined that the ‘where’ sub-segment of the input query comprises an ‘OR’ operation, the input query is fragmented by using the ‘OR operator. In an embodiment of the present invention, the input query is fragmented either into a predetermined number of sub-queries or the number of fragments is determined based upon the determined suitability of input query for fragmentation.
- step 410 if it is determined that the ‘where’ sub-segment of the input query does not comprise an ‘OR’ operation, the input query is fragmented by using an active key of the database table being referenced by the input query.
- step 410 comprises: obtaining the database name, table name and the active key corresponding to the input query, by accessing a database such as the database characteristics repository described with reference to FIG.
- step 412 the operations to be performed with the sub-queries formed are defined.
- step 414 the input query along with the corresponding sub-queries formed are displayed.
- an input SQL query reads as: Select branch, count(*) as Cnt from Customers Group by Branch Order by Count(*), Branch; and the predetermined number of fragments is three
- the database name is ‘BORACLDB’
- the table name is ‘Customers’
- the active key type is ‘integer’
- the range of the active key Cust_id begins at ‘1000’ and ends at ‘7000’;
- the present invention provides a system, a method and a computer program product for parallel query processing.
- the present invention does not require under lying databases being referenced by the input queries to be partitioned.
- the system and method of the present invention enables real-time data integration from disparate and heterogeneous data sources.
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Computational Linguistics (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
Description
- The present invention is directed towards providing a parallel query processing framework. More particularly, the present invention provides a system and method for dynamically fragmenting a query into multiple sub-queries, executing individual sub-queries over a grid network, aggregating the sub-query results and streaming the query results to users.
- Conventionally, enterprises employ a method involving extracting, transforming and loading data from disparate operational systems into data warehouses in order to integrate the data for the purpose of reporting and business analytics. However, this method is time consuming and leads to delays in operational activities as well as in making strategic decisions.
- Hence, the demand for a method of real time integration of data from heterogeneous sources is increasing at a rapid pace. However, integrating data obtained from disparate/heterogeneous data sources in real-time is a computationally challenging task as it involves fast query evaluation. In order to achieve real time scalable data integration use of parallel query processing techniques is required.
- Conventionally available methods and solutions for parallel query processing make use of knowledge of underlying database partitions for fast query evaluation. Hence, most of the available methods for real time integration of data obtained from heterogeneous data sources are limited by the number of partitions built on the underlying database. Such methods are not suitable when no partitioning exists in the underlying databases. Further, while using the currently available partitioning based solutions for integration of data obtained from disparate databases with overlapping partitions may significantly reduce the query processing efficiency.
- Consequently, there is need for a system and method of real time scalable integration of data obtained from heterogeneous databases which does not require knowledge of underlying database partitions. There is need for a parallel query processing solution which is fast, efficient and makes no assumptions regarding partitions built on the underlying databases.
- The invention provides a system for parallel query processing. The system comprises a query fragment identifier module for estimating a number of sub-queries that may be formed corresponding to an input query based on a number of query evaluator nodes available for processing the input query and processing characteristics of the available query evaluator nodes, the query evaluator nodes accessing one or more databases being referenced by the input query for processing the input query; a query splitter module for fragmenting the input query into a plurality of sub queries by adding one or more filter predicates to the input query without altering the semantics of the input query; a scheduler for scheduling the processing of the sub queries; a result aggregator module for aggregating results of the processed sub queries; a streaming module for streaming results of the processed sub queries; and a metadata manager for storing processing characteristics of the one or more query evaluator nodes and information regarding the one or more databases being referenced by the input query.
- In an embodiment of the present invention, the system for parallel query processing further comprises a plurality of query optimizer nodes for generating optimal query plans comprising one or more query partitions for processing the fragmented input query. In various embodiments of the present invention, the input query is written in a structured query language. Further in various embodiments of the present invention, the query fragment identifier module estimates the number of sub-queries that may be formed corresponding to the input query as equal to a number of healthy query evaluator nodes available for processing the input query; a query evaluator node being selected as healthy based on memory required for storing each record of a predetermined table of a predetermined database being referenced by the input query and available memory and processing speed of the evaluator node.
- In an embodiment of the present invention, the scheduler schedules the sub queries for processing by using a round robin algorithm. The metadata manager is updated periodically and comprises a machine characteristics repository and a database characteristics repository. The database characteristics repository stores physical and logical metadata information corresponding to the one or more databases being referenced by the input query; logical metadata information comprising information regarding schema of the one or more databases being referenced by the input query; physical metadata information comprising information regarding statistics of the one or more databases being referenced by the input query. In an embodiment of the present invention, the database characteristics repository stores names of the one or more databases being referenced by the input query, names of the one or more tables being referenced by the input query, attribute names obtained from the one or more tables being referenced by the input query as active keys, data types of the active keys, and ranges of the active keys.
- The invention also provides a method for parallel query processing comprising the steps of: estimating a number of sub-queries that may be formed corresponding to an input query; fragmenting the input query into a plurality of sub queries by adding one or more filter predicates to the input query without altering the semantics of the input query; scheduling the processing of the sub queries; generating one or more query execution plans comprising one or more query partitions corresponding to each sub query; processing the generated one or more query execution plans; and collating, aggregating and presenting results of the processed sub queries in a required format.
- In an embodiment of the present invention, the method for parallel query processing further comprises the step of streaming the results of the processed sub queries in a required format. The step of estimating a number of sub-queries that may be formed corresponding to an input query comprises the steps of: parsing the input query and extracting one or more query attributes for obtaining references to one or more databases and tables corresponding to the input query; selecting a first database that corresponds to at least one of the extracted attributes and table combination as a base database; selecting a table from the base database based on a number of records contained in the table; computing memory required for storing the selected table; obtaining available memory and processing speed of each evaluator node available for processing the input query; selecting an evaluator node available for processing the input query as a healthy evaluator node if the available memory corresponding to the evaluator node is greater than or equal to half of the computed and if the processing speed of the evaluator node is greater than a predetermined threshold; and estimating a number of sub-queries that may be formed corresponding to the input query as the number of selected healthy evaluator nodes.
- The step of fragmenting the input query into a plurality of sub queries by adding one or more filter predicates to the input query without altering the semantics of the input query comprises the steps of: classifying the input query into query sub-segments; determining suitability of the input query for fragmentation by analyzing the query sub-segments; determining if a ‘where’ sub-segment of the input query comprises an ‘OR’ operation and does not comprise a ‘group-by’ operator; fragmenting the input query into one or more sub queries by using the ‘OR’ operator if the ‘where’ sub-segment of the input query comprises an ‘OR’ operation and does not comprise a ‘group-by’ operator; and fragmenting the input query into one or more sub queries by using an active key of the database table being referenced by the input query if the ‘where’ sub-segment of the input query comprises an ‘OR’ operation and does not comprise a ‘group-by’ operator.
- The present invention is described by way of embodiments illustrated in the accompanying drawings wherein:
-
FIG. 1 is a block diagram depicting a system for parallel query evaluation; -
FIG. 2 illustrates an exemplary structure of database characteristics repository of the metadata manager; -
FIG. 3 is a flowchart illustrating a method for parallel query evaluation; and -
FIG. 4 illustrates a method of fragmenting an input query into multiple sub-queries. - A system and a method for parallel query processing are described herein. Input queries are processed in a parallel mode by identifying the number of sub-queries the input query may be fragmented into, fragmenting the input query, processing the sub-queries, aggregating the sub-query results and streaming the query results. The present invention does not require underlying databases being referenced by the input queries to be partitioned. The method of the invention may be provided on a computer readable medium.
- The following disclosure is provided in order to enable a person having ordinary skill in the art to practice the invention. Exemplary embodiments are provided only for illustrative purposes and various modifications will be readily apparent to persons skilled in the art. The general principles defined herein may be applied to other embodiments and applications without departing from the spirit and scope of the invention. Also, the terminology and phraseology used is for the purpose of describing exemplary embodiments and should not be considered limiting. Thus, the present invention is to be accorded the widest scope encompassing numerous alternatives, modifications and equivalents consistent with the principles and features disclosed. For purpose of clarity, details relating to technical material that is known in the technical fields related to the invention have not been described in detail so as not to unnecessarily obscure the present invention.
- The present invention would now be discussed in context of embodiments as illustrated in the accompanying drawings.
-
FIG. 1 is a block diagram depicting a system for parallel query evaluation. System 100 comprises a query fragment identifier (QFI)module 102, a query splitter (QS)module 104, ascheduler 106, a plurality ofquery optimizer nodes 108, a plurality ofquery evaluator nodes 110, one ormore databases 112, a result aggregator (RA)module 114, astreaming module 116 and ametadata manager 118.Metadata manager 118 comprises amachine characteristics repository 120 and adatabase characteristics repository 122. -
QFI module 102 estimates a near optimal number of sub-queries that may be formed corresponding to an input query. In various embodiments of the present invention, the input query may be written in any query language known in the art. In the following disclosure an exemplary embodiment of the present invention where an input query is submitted in a structured query language (SQL) format has been described. In other embodiments, various other database query languages known in the art may be used. The number of sub-queries that may be formed is dependent on the number ofquery evaluator nodes 110 available for processing the input query as well as the processing characteristics of thequery evaluator nodes 110, such as the available processor speed and memory. Queryevaluator nodes 110 comprise any computing devices that may process the input query by accessing the required one ormore databases 112. - The input query is parsed and the query attributes are extracted. The extracted attributes are used to obtain references to one or
more databases 112 and tables corresponding to the query. Information regarding the one ormore databases 112 and tables corresponding to the query is stored in thedatabase characteristics repository 122 of themetadata manager 118. In an embodiment of the present invention, a first database that corresponds to at least one of the extracted attribute(s) and table combination is selected as a base database. The base database is used for computation of a near optimal number of sub-queries that may be formed corresponding to the input query and a table selected from the base database. In an embodiment of the present invention, a table from base database is selected based on maximum number of records. In other embodiments, various other heuristic methods may be applied to select a table from base database. The selected base database and table is used for splitting the input query into multiple sub-queries. -
QFI module 102 computes the number of healthyquery evaluator nodes 110 available for processing the input query. In various embodiments of the present invention, the near optimal number of sub-queries that may be formed corresponding to the input query is equal to the number of healthyquery evaluator nodes 110 available for processing the input query. The health of anevaluator node 110 is computed by using data such as the memory for storing each record of the selected table of the base database, and the available memory and processing speed of theevaluator node 110. - In an embodiment of the present invention, the total memory required for storing a selected table, is computed as:
-
Memory required=record size*(number of tuples/number of evaluator nodes) (1) - where,
record size depicts the maximum row size of the selected table;
number of tuples depicts the total number of rows in the selected table; and
number of evaluator nodes depicts the total number ofevaluator nodes 110 available for processing the input query. - The available memory and processor speeds of all the
evaluator nodes 110 available for processing the input query is stored in themachine characteristics repository 120 of themetadata manager 118.Machine characteristics repository 120 is updated periodically. Once the total memory required for storing a selected table is computed by using Equation (1) the available memory and processor speeds of all theevaluator nodes 110 available for processing the input query are dynamically obtained frommachine characteristics repository 120. Anevaluator node 110 is considered to be healthy if the available memory corresponding to it is greater than or equal to half of the computed required memory and if its processor speed is greater than fifty percent. In an embodiment of the present invention, if none of theevaluator nodes 110 satisfy the sufficient memory and processor requirement then the number of sub-queries that may be formed corresponding to the input query is equal to the total number ofevaluator nodes 110. -
FIG. 2 illustrates an exemplary structure ofdatabase characteristics repository 122 of themetadata manager 118. In an embodiment of the present invention, thedatabase characteristics repository 122 of themetadata manager 118 is updated periodically. The column titled ‘Ranger_ID’ 202 stores unique identifier of entries in thedatabase characteristics repository 122. The column titled ‘DBNAME’ 204 stores names of all databases that may be referenced by an input query. The column titled ‘TABLENAME’ 206 stores names of all tables that may be referenced by an input query. The column titled ‘ACTIVE_KEY’ 208 stores attribute names obtained from the corresponding tables. In an embodiment of the present invention, the attribute names stored under the head ‘ACTIVE_KEY’ 208 are the primary keys of the corresponding tables. The column titled ‘KEY_TYPE’ 210 stores the data type of the corresponding active keys. The data types may be stored as ‘I’ depicting integer type, ‘N’ depicting numeric type, ‘C’ depicting character domain type and ‘D’ depicting date type. The columns titled ‘RANGE_START’ 212 and ‘RANGE_END’ 214 store the minimum and maximum values respectively of the active keys where the data type of the active keys is either integer (I) or numeric (N). The column titled ‘VALUE’ 216 stores the domain value of the active keys where the data type of the active keys is either character (C) or Date (D). - For example with reference to
FIG. 2 , inrow 218, the figure stored in the column titled ‘Ranger_ID’ is ‘1’ depicting the first entry in thedatabase characteristics repository 122. The database name is ‘Banking’, the table name is ‘CUST_DETAILS’, the active key is the ‘ACCOUNT_No’ attribute of the table ‘CUST_DETAILS’, the data type of the active key is ‘I’ depicting integer type and the minimum and maximum values respectively of the active key ‘ACCOUNT_No’ are ‘1000’ and ‘8700’ respectively. Inrow 220, the figure stored in the column titled ‘Ranger_ID’ is ‘4’ depicting the fourth entry in thedatabase characteristics repository 122. The database name is ‘Banking’, the table name is ‘CUST_DETAILS’, the active key is the ‘ACCOUNT_TYPE’ attribute of the table ‘CUST_DETAILS’, the data type of the active key is ‘C’ depicting character domain type, the minimum and maximum values respectively of the active key ‘ACCOUNT_TYPE’ are null and the value of the active key may be ‘Savings’ or ‘Current’. Inrow 222, the value stored in the column titled ‘Ranger_ID’ is ‘7’ depicting the seventh entry in thedatabase characteristics repository 122. The database name is ‘Banking’, the table name is ‘CUST_TRANSACTION’, the active key is the ‘TRANS_DATE’ attribute of the table ‘CUST_TRANSACTION’, the data type of the active key is ‘D’ depicting date type, the minimum and maximum values respectively of the active key ‘TRANS_DATE’ are null and the value of the active key may be ‘2005-1-1’ or ‘2007-8-9’. - In an embodiment of the present invention,
database characteristics repository 122 of themetadata manager 118 comprises physical and logical metadata information corresponding tounderlying databases 112. Logical metadata information comprises information regarding the schema of a database such as table names, column names, referential keys, etc. Physical metadata information comprises information regarding database statistics such as number of tables in a database, number of rows in a table, number of columns in a table, cost of database access, index access cost, etc. - With reference to
FIG. 1 ,QS module 104 fragments the input query into multiple sub-queries. The input query is fragmented by adding a filter predicate in a manner such that the semantics of the input query are not altered. The filter predicate is added to the input query by using an active key corresponding to the table and database being referenced by the input query. Information regarding the active key, table name and database name is obtained by theQFI module 102 from thedatabase characteristics repository 122 of themetadata manager 118. -
QS module 104 fragments the input query into multiple sub-queries thereby enablingscheduler 106 to evenly distribute the processing load among the plurality ofquery optimizer nodes 108. In an embodiment of the present invention, the allocation of sub-queries to thequery optimizer nodes 108 is done byscheduler 106 in a Round-Robin fashion. Thescheduler 106 also sends information about each of thehealthy evaluator nodes 110 identified byQFI module 102 to thequery optimizer nodes 108. The optimizer nodes are computing devices that generate optimal query plans for execution of the fragmented input query. Optimal query plans may be generated by using any of the query plan generation algorithms commonly known in the art. In various embodiments of the present invention,optimizer nodes 108 perform functions such as determining an efficient join ordering plan, join algorithm types and access paths, generating parallel plans for query execution, and scheduling the query plan for execution. The query plans generated by the optimizer nodes may have one or more query partitions. One or more query partitions are generated since the input query may referencemultiple databases 112 dispersed geographically.Scheduler 106 re-schedules sub-queries, if any of theoptimizer nodes 108 fails during execution of a sub-query, thereby providing a fault-tolerant system. The re-scheduling is performed without any manual intervention. In an exemplary scenario, where all theoptimizer nodes 108 fail to execute, the input query is not executed and in various embodiments user intervention may be required. - Each of the generated query partitions are scheduled for execution on the
evaluator nodes 110.Evaluator nodes 110 parse each of the query partitions and execute individual operators such as table scan operator, hash join operator, project operator, aggregation operator, exchange operator etc., occurring in the partition.Evaluator nodes 110 execute the query partitions by connecting to one ormore databases 112 for performing table scan operation, by performing joining of tables defined in the hash join operator, and by federating with one or more otherquery evaluator nodes 110 for exchanging the data specified in the exchange operator. - In an embodiment of the present invention, the allocation of sub-queries to the
healthy evaluator nodes 110 is done byscheduler 106 in a Round-Robin fashion.Scheduler 106 re-schedules sub-queries, if any of thehealthy evaluator nodes 110 fails during execution of a sub-query, thereby providing a fault-tolerant system. In an exemplary scenario where an input query which has not been fragmented fails to execute on an evaluator node to which it is allocated,scheduler 106 allocates the query to a next available evaluator node. The re-allocation or re-scheduling is performed without requiring manual intervention. In another exemplary scenario, where multiple sub-queries fail to executescheduler 106 allocates the queries to a re-run queue from which the failed sub-queries are re-scheduled on the next available evaluator node. In yet another exemplary scenario, where all the availableevaluator nodes 110 fail to execute, the input query is not executed and in various embodiments user intervention may be required. -
RA module 114 collects the results of all the executed sub-queries, aggregates the results and presents them in a required format.Streaming module 116 provides a result set streaming feature where the result is streamed to the client as and when received, without waiting for the complete result set to be received. Hence streamingmodule 116 provides an improved throughput of the query evaluation. -
FIG. 3 is a flowchart illustrating a method for parallel query evaluation. At step 302 a near optimal number of sub-queries that may be formed corresponding to an input query is estimated by computing the number of healthy query evaluator nodes available for processing the input query. The input query is parsed and the query attributes are extracted. The extracted attributes are used to obtain references to one or more databases and tables corresponding to the query. In an embodiment of the present invention, a first database that corresponds to at least one of the extracted attribute(s) and table combination is selected as a base database. A table selected from the base database, comprising the maximum number of records, is used for splitting the input query into multiple sub-queries. The health of each evaluator node available for processing the input query is computed by using data such as the memory for storing each record of the selected table of the base database, and the available memory and processing speed of the respective evaluator node. In an embodiment of the present invention, the total memory required for storing a selected table, is computed by using Equation (1) provided with reference toFIG. 1 . The available memory and processor speeds of all the evaluator nodes available for processing the input query are dynamically obtained from a machine characteristics repository. An evaluator node is considered to be healthy if the available memory corresponding to it is greater than or equal to half of the computed required memory and if its processor speed is greater than fifty percent. In an embodiment of the present invention, if none of the evaluator nodes satisfy the sufficient memory and processor requirement then the number of sub-queries that may be formed corresponding to the input query is equal to the total number of evaluator nodes. - In an exemplary embodiment of the present invention, an input query reads as: Select productid, productname from Products;
- where ‘Products’ depicts the name of a table in a database;
In accordance with the statistics maintained by the machine characteristics repository, the total number of evaluator nodes available for processing the input query is 4 and only three out of the 4 evaluator nodes are found to be healthy. Hence, the input query may be fragmented into three sub-queries. - At
step 304 the input query is fragmented into multiple sub-queries. The input query is fragmented by adding a filter predicate in a manner such that the semantics of the input query are not altered. The filter predicate is added to the input query by using an active key corresponding to the table and database being referenced by the input query. - At
step 306, each sub-query is scheduled on one or more optimizer nodes. In an embodiment of the present invention, the allocation of sub-queries to the query optimizer nodes is done in a Round-Robin fashion. The optimizer nodes are computing devices that generate optimal query plans for execution of the fragmented input query. - At
step 308, optimal query execution plans comprising one or more query partitions are generated corresponding to each query. Optimal query plans may be generated by using any of the query plan generation algorithms commonly known in the art. The query plans generated may have one or more query partitions. One or more query partitions are generated since the input query may reference multiple databases dispersed geographically. - At
step 310, each of the generated query partitions are scheduled for execution on one or more healthy evaluator nodes. Atstep 312 the results of all the executed sub-queries, are collated, aggregated and presented in a required format. In an embodiment of the present invention examples of the SQL operations supported comprise Count( ), Sum( ), Min( ), Max( ), Avg( ), Group by ( ) and Order by [asc/desc]. - In an exemplary embodiment of the present invention where an input query reads as:
-
- Select Branch, Count(Customerid) From Customers Group by Branch Order by Branch;
and the input query is fragmented into three sub-queries using the active key as Customerid, the sub-queries read as: - Select Branch, Count(Customerid) From Customers where Customerid<=2000 Group by Branch Order by Branch;
- Select Branch, Count(Customerid) From Customers where Customer>2000 and Customerid<=3000 Group by Branch Order by Branch; and
- Select Branch, Count(Customerid) From Customers where Customerid>3000 Group by Branch Order by Branch;
the result set obtained upon execution of the first sub-query is represented as:
- Select Branch, Count(Customerid) From Customers Group by Branch Order by Branch;
-
Branch Count(Customerid) Bangalore 150 Chennai 250 Hyderabad 600
the result set obtained upon execution of the second sub-query is represented as: -
Branch Count(Customerid) Bangalore 10 Chennai 250 Hyderabad 300 Pune 440
the result set obtained upon execution of the third sub-query is represented as: -
Branch Count(Customerid) Chennai 15 Mysore 285 Pune 700
Hence, the Collated result set reads as: -
Branch Count(Customerid) Bangalore 150 Chennai 250 Hyderabad 600 Bangalore 10 Chennai 250 Hyderabad 300 Pune 440 Chennai 15 Mysore 285 Pune 700
Once the collated results are aggregated, the aggregated result set is represented as: -
Branch Count(Customerid) Bangalore 160 Chennai 515 Hyderabad 900 Mysore 285 Pune 1140
In another exemplary embodiment of the present invention where an input query reads as: -
- Select Branch, Count(Customerid) From Customers Group by Branch Order by Branch;
and the input query is fragmented into three sub-queries using the active key as Branch, the sub-queries read as: - Select Branch, Count(Customerid) From Customers where Branch=‘Bangalore’ or Branch=‘Chennai’ Group by Branch Order by Branch;
- Select Branch, Count(Customerid) From Customers where Branch=‘Hyderabad’ or Branch=‘Mysore’ Group by Branch Order by Branch; and
- Select Branch, Count(Customerid) From Customers where Branch=‘Pune’ Group by Branch Order by Branch;
the result set obtained upon execution of the first sub-query is represented as:
- Select Branch, Count(Customerid) From Customers Group by Branch Order by Branch;
-
Branch Count(Customerid) Bangalore 160 Chennai 515
the result set obtained upon execution of the second sub-query is represented as: -
Branch Count(Customerid) Hyderabad 900 Mysore 285
the result set obtained upon execution of the third sub-query is represented as: -
Branch Count(Customerid) Pune 1140
Hence, the Collated result set reads as: -
Branch Count(Customerid) Bangalore 160 Chennai 515 Hyderabad 900 Mysore 285 Pune 1140
Once the collated results are aggregated, the aggregated result set is represented as: -
Branch Count(Customerid) Bangalore 160 Chennai 515 Hyderabad 900 Mysore 285 Pune 1140 -
FIG. 4 illustrates a method of fragmenting an input query into multiple sub-queries. Atstep 402 an input query is classified into query sub-segments. In an embodiment of the present invention, various examples of input SQL queries classified into sub-segments include: - Select [-a-] from [-b-];
Select [-a-] from [-b-] where [-c-];
Select [-a-] from [-b-] where [-c-] group by [-d-];
Select [-a-] from [-b-] where [-c-] group by [-d-] having [-e-];
Select [-a-] from [-b-] where [-c-] order by [-f-];
Select [-a-] from [-b-] where [-c-] group by [-d-] order by [-f-];
Select [-a-] from [-b-] where [-c-] group by [-d-] having [-e-] order by [-f-]; - a depicts ‘select’ segment;
b depicts ‘from’ segment;
c depicts ‘where’ segment;
d depicts ‘group by’ segment;
e depicts ‘having’ segment; and
f depicts ‘order by’ segment. - At
step 404 the query sub-segments are analyzed and suitability of input query for fragmentation is determined. In various embodiments of the present invention,step 404 comprises: parsing a ‘select’ sub-segment to collect the projected attributes of the input query; determining whether a ‘having’ sub-segment comprises any aggregate function; determining whether only the projected attributes of the input query are used in ‘group-by’ or ‘order-by’ or ‘having’ sub-segments; collecting attributes corresponding to ‘where’ sub-segment of the input query; parsing ‘select’ and ‘from’ sub-segments to collect tablename and any objects if defined for them; determining whether the input query is suitable for fragmenting based upon the collected data. - At
step 406 it is determined whether a ‘where’ sub-segment of the input query comprises an ‘OR’ operation and does not comprise a ‘group-by’ operator. Atstep 408 if it is determined that the ‘where’ sub-segment of the input query comprises an ‘OR’ operation, the input query is fragmented by using the ‘OR operator. In an embodiment of the present invention, the input query is fragmented either into a predetermined number of sub-queries or the number of fragments is determined based upon the determined suitability of input query for fragmentation. - At
step 410 if it is determined that the ‘where’ sub-segment of the input query does not comprise an ‘OR’ operation, the input query is fragmented by using an active key of the database table being referenced by the input query. In various embodiments of the present invention,step 410 comprises: obtaining the database name, table name and the active key corresponding to the input query, by accessing a database such as the database characteristics repository described with reference toFIG. 2 ; If an active key is obtained, determining whether the active key is present in the list of attribute corresponding to the ‘where’ sub-segment; the active key is present in the list of attribute corresponding to the ‘where’ sub-segment determining whether the identified ‘where’ clause predicate is local or join predicate; the ‘where’ clause predicate is a local predicate; obtaining an alternate active key that is not present in the input query attribute list; determining the range of the obtained active key based on the active key type; determining whether the range is sufficient for splitting the input query into a predetermined number of fragments; if the range is sufficient, then the input query is fragmented into the predetermined number of sub-queries; if range is insufficient the input query is fragmented into a fewer number of sub-queries determined based upon the determined suitability of input query for fragmentation. - At
step 412 the operations to be performed with the sub-queries formed are defined. Atstep 414 the input query along with the corresponding sub-queries formed are displayed. - For example, if an input SQL query reads as:
Select branch, count(*) as Cnt from Customers Group by Branch Order by Count(*), Branch;
and the predetermined number of fragments is three, the database name is ‘BORACLDB’, the table name is ‘Customers’, the active key type is ‘integer’ and the range of the active key Cust_id begins at ‘1000’ and ends at ‘7000’;
By using the method illustrated inFIG. 4 the input SQL query may be fragmented into the following sub-queries: -
- Select Branch, Count(*) as Cnt from Customers where Cust_id <=3000 Group by Branch Order by Count(*), Branch;
- Select Branch, Count(*) As Cnt from Customers where Cust_Id>3000 and Cust_Id <=5000 Group by Branch Order by Count(*), Branch; and
- Select Branch, Count(*) as Cnt from Customers where Cust_Id>5000 Group by Branch Order by Count(*), Branch;
In another exemplary embodiment of the present invention where an input query reads as: - Select a.Customername, b.Orderdate from Customers as a, Orders as b where a.Cust_id=b.Cust_id;
and the predetermined number of fragments is three, the database names are ‘BORACLDB’ and ‘MYSQLDB’; the base database name is ‘BORACLDB’, and the selected table name is ‘Customers’, the active key type is ‘integer’ and the range of active key Cust_id begins at ‘1000’ and ends at ‘7000’.
By using the method illustrated inFIG. 4 the input SQL query may be fragmented into the following sub-queries: - Select a.Customemame, b.Orderdate from Customers as a, Orders as b where a.Cust_id=b.Cust_id and a.Cust_id<=3000 and b.Cust_id<=3000;
- Select a.Customemame, b.Orderdate from Customers as a, Orders as b where a.Cust_id=b.Cust_id and a.Cust_id>3000 and a.Cust_id<=5000 and b.Cust_id>3000 and b.Cust_id<=5000; and
- Select a.Customemame, b.Orderdate from Customers as a, Orders as b where a.Cust_id=b.Cust_id and a.Cust_id>5000 and b.Cust_id>5000;
- Therefore the present invention provides a system, a method and a computer program product for parallel query processing. The present invention does not require under lying databases being referenced by the input queries to be partitioned. Hence, the system and method of the present invention enables real-time data integration from disparate and heterogeneous data sources.
- While the exemplary embodiments of the present invention are described and illustrated herein, it will be appreciated that they are merely illustrative. It will be understood by those skilled in the art that various changes in form and detail may be made therein without departing from or offending the spirit and scope of the invention as defined by the appended claims.
Claims (16)
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
IN1046CH2008 | 2008-04-28 | ||
IN1046/CHE/2008 | 2008-04-28 |
Publications (2)
Publication Number | Publication Date |
---|---|
US20090271385A1 true US20090271385A1 (en) | 2009-10-29 |
US8386508B2 US8386508B2 (en) | 2013-02-26 |
Family
ID=41216007
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US12/431,296 Active 2030-06-03 US8386508B2 (en) | 2008-04-28 | 2009-04-28 | System and method for parallel query evaluation |
Country Status (1)
Country | Link |
---|---|
US (1) | US8386508B2 (en) |
Cited By (56)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20100198855A1 (en) * | 2009-01-30 | 2010-08-05 | Ranganathan Venkatesan N | Providing parallel result streams for database queries |
US20110231403A1 (en) * | 2010-03-19 | 2011-09-22 | Microsoft Corporation | Scalable index build techniques for column stores |
US20110313999A1 (en) * | 2010-06-17 | 2011-12-22 | Microsoft Corporation | Slicing relational queries using spool operators |
US20120023222A1 (en) * | 2010-07-22 | 2012-01-26 | International Business Machines Corporation | Moving deployment of images between computers |
WO2012039992A1 (en) * | 2010-09-24 | 2012-03-29 | Hitachi Data Systems Corporation | System and method for aggregating query results in a fault-tolerant database management system |
US20120130984A1 (en) * | 2010-11-22 | 2012-05-24 | Microsoft Corporation | Dynamic query master agent for query execution |
US20120166483A1 (en) * | 2010-12-28 | 2012-06-28 | Akshat Choudhary | Systems and Methods for Database Proxy Request Switching |
US20130091119A1 (en) * | 2010-06-21 | 2013-04-11 | Telefonaktiebolaget L M Ericsson (Publ) | Method and Server for Handling Database Queries |
US8713024B2 (en) | 2010-11-22 | 2014-04-29 | Microsoft Corporation | Efficient forward ranking in a search engine |
US20140280298A1 (en) * | 2013-03-14 | 2014-09-18 | Oracle International Corporation | Massively Parallel And In-Memory Execution Of Grouping And Aggregation In a Heterogeneous System |
US20140280036A1 (en) * | 2013-03-15 | 2014-09-18 | Teradata Us, Inc. | Techniques for improving the performance of complex queries |
US8848710B2 (en) | 2005-01-24 | 2014-09-30 | Citrix Systems, Inc. | System and method for performing flash caching of dynamically generated objects in a data communication network |
US8856777B2 (en) | 2004-12-30 | 2014-10-07 | Citrix Systems, Inc. | Systems and methods for automatic installation and execution of a client-side acceleration program |
US20140309993A1 (en) * | 2013-04-10 | 2014-10-16 | Nuance Communications, Inc. | System and method for determining query intent |
US8892778B2 (en) | 2004-07-23 | 2014-11-18 | Citrix Systems, Inc. | Method and systems for securing remote access to private networks |
US8914522B2 (en) | 2004-07-23 | 2014-12-16 | Citrix Systems, Inc. | Systems and methods for facilitating a peer to peer route via a gateway |
US8954595B2 (en) | 2004-12-30 | 2015-02-10 | Citrix Systems, Inc. | Systems and methods for providing client-side accelerated access to remote applications via TCP buffering |
CN104504154A (en) * | 2015-01-14 | 2015-04-08 | 曙光信息产业(北京)有限公司 | Method and device for data aggregate query |
US20160092524A1 (en) * | 2014-09-26 | 2016-03-31 | Oracle International Corporation | System and method for data transfer from jdbc to a data warehouse layer in a massively parallel or distributed database environment |
US9329937B1 (en) * | 2013-12-31 | 2016-05-03 | Google Inc. | High availability architecture |
US9329899B2 (en) * | 2013-06-24 | 2016-05-03 | Sap Se | Parallel execution of parsed query based on a concurrency level corresponding to an average number of available worker threads |
US9342582B2 (en) | 2010-11-22 | 2016-05-17 | Microsoft Technology Licensing, Llc | Selection of atoms for search engine retrieval |
US9424351B2 (en) | 2010-11-22 | 2016-08-23 | Microsoft Technology Licensing, Llc | Hybrid-distribution model for search engine indexes |
US20160246842A1 (en) * | 2015-02-25 | 2016-08-25 | Futurewei Technologies, Inc. | Query optimization adaptive to system memory load for parallel database systems |
US9529908B2 (en) | 2010-11-22 | 2016-12-27 | Microsoft Technology Licensing, Llc | Tiering of posting lists in search engine index |
WO2016209450A1 (en) * | 2015-06-26 | 2016-12-29 | Mcafee, Inc. | Query engine for remote endpoint information retrieval |
US20170010968A1 (en) * | 2015-07-08 | 2017-01-12 | Futurewei Technologies, Inc. | System and method for data caching in processing nodes of a massively parallel processing (mpp) database system |
US9563648B2 (en) | 2013-02-25 | 2017-02-07 | EMC IP Holding Company LLC | Data analytics platform over parallel databases and distributed file systems |
US9613066B2 (en) | 2012-10-04 | 2017-04-04 | Oracle International Corporation | Efficient pushdown of joins in a heterogeneous database system involving a large-scale low-power cluster |
US20170147656A1 (en) * | 2010-12-28 | 2017-05-25 | Citrix Systems, Inc. | Systems and methods for database proxy request switching |
US20170161323A1 (en) * | 2014-06-30 | 2017-06-08 | Hewlett Packard Enterprise Development Lp | Automatic generation of sub-queries |
US20170262521A1 (en) * | 2016-03-11 | 2017-09-14 | Linkedin Corporation | Partitioning and replicating data in scalable distributed data stores |
US20180157761A1 (en) * | 2016-11-25 | 2018-06-07 | Infosum Limited | Accessing databases |
US10055470B1 (en) * | 2015-04-26 | 2018-08-21 | Ims Health Incorporated | Real-time query transformation and data retrieval |
US10078684B2 (en) | 2014-09-26 | 2018-09-18 | Oracle International Corporation | System and method for query processing with table-level predicate pushdown in a massively parallel or distributed database environment |
US10089357B2 (en) | 2014-09-26 | 2018-10-02 | Oracle International Corporation | System and method for generating partition-based splits in a massively parallel or distributed database environment |
US10180973B2 (en) | 2014-09-26 | 2019-01-15 | Oracle International Corporation | System and method for efficient connection management in a massively parallel or distributed database environment |
CN109753525A (en) * | 2018-12-28 | 2019-05-14 | 国云科技股份有限公司 | It is a kind of based on enterprise query system that can be properties and its implementation |
US10311105B2 (en) * | 2010-12-28 | 2019-06-04 | Microsoft Technology Licensing, Llc | Filtering queried data on data stores |
US10380114B2 (en) | 2014-09-26 | 2019-08-13 | Oracle International Corporation | System and method for generating rowid range-based splits in a massively parallel or distributed database environment |
US10387421B2 (en) | 2014-09-26 | 2019-08-20 | Oracle International Corporation | System and method for generating size-based splits in a massively parallel or distributed database environment |
US10394818B2 (en) | 2014-09-26 | 2019-08-27 | Oracle International Corporation | System and method for dynamic database split generation in a massively parallel or distributed database environment |
US10528596B2 (en) | 2014-09-26 | 2020-01-07 | Oracle International Corporation | System and method for consistent reads between tasks in a massively parallel or distributed database environment |
US10977727B1 (en) | 2010-11-18 | 2021-04-13 | AUTO I.D., Inc. | Web-based system and method for providing comprehensive vehicle build information |
WO2021143199A1 (en) * | 2020-06-30 | 2021-07-22 | 平安科技(深圳)有限公司 | Method and apparatus for searching log, computer device, and storage medium |
US11157835B1 (en) | 2019-01-11 | 2021-10-26 | Experian Information Solutions, Inc. | Systems and methods for generating dynamic models based on trigger events |
US11210276B1 (en) * | 2017-07-14 | 2021-12-28 | Experian Information Solutions, Inc. | Database system for automated event analysis and detection |
US11210351B1 (en) | 2016-06-16 | 2021-12-28 | Experian Information Solutions, Inc. | Systems and methods of managing a database of alphanumeric values |
CN113946600A (en) * | 2021-10-21 | 2022-01-18 | 北京人大金仓信息技术股份有限公司 | Data query method, data query device, computer equipment and medium |
US11257126B2 (en) | 2006-08-17 | 2022-02-22 | Experian Information Solutions, Inc. | System and method for providing a score for a used vehicle |
US11301922B2 (en) | 2010-11-18 | 2022-04-12 | AUTO I.D., Inc. | System and method for providing comprehensive vehicle information |
US20220179861A1 (en) * | 2020-12-08 | 2022-06-09 | International Business Machines Corporation | Scheduling query execution plans on a relational database |
US11366860B1 (en) | 2018-03-07 | 2022-06-21 | Experian Information Solutions, Inc. | Database system for dynamically generating customized models |
US11431658B2 (en) * | 2020-04-02 | 2022-08-30 | Paymentus Corporation | Systems and methods for aggregating user sessions for interactive transactions using virtual assistants |
US11468061B2 (en) * | 2013-03-15 | 2022-10-11 | Teradata Us, Inc. | Incremental simplification and optimization of complex queries using dynamic result feedback |
US11481827B1 (en) | 2014-12-18 | 2022-10-25 | Experian Information Solutions, Inc. | System, method, apparatus and medium for simultaneously generating vehicle history reports and preapproved financing options |
Families Citing this family (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US9251209B2 (en) * | 2012-03-15 | 2016-02-02 | International Business Machines Corporation | Autonomic caching for in memory data grid query processing |
AU2015201361B2 (en) | 2014-11-14 | 2017-03-02 | Tata Consultancy Services Limited | A method and system for efficient performance prediction of structured query for big data |
US10621169B2 (en) * | 2016-10-20 | 2020-04-14 | Diwo, Llc | Method and system for maintaining knowledge required in a decision-making process framework |
CN113961581B (en) * | 2021-09-27 | 2023-09-08 | 北京百度网讯科技有限公司 | Query processing method, device, electronic equipment and storage medium |
Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5590319A (en) * | 1993-12-15 | 1996-12-31 | Information Builders, Inc. | Query processor for parallel processing in homogenous and heterogenous databases |
US5742806A (en) * | 1994-01-31 | 1998-04-21 | Sun Microsystems, Inc. | Apparatus and method for decomposing database queries for database management system including multiprocessor digital data processing system |
US6345267B1 (en) * | 1997-06-30 | 2002-02-05 | International Business Machines Corporation | Method and system for look ahead query evaluation planning based on interesting partition properties |
US20050131877A1 (en) * | 2003-12-16 | 2005-06-16 | Oracle International Corporation | Executing filter subqueries using a parallel single cursor model |
US20060218123A1 (en) * | 2005-03-28 | 2006-09-28 | Sybase, Inc. | System and Methodology for Parallel Query Optimization Using Semantic-Based Partitioning |
US7472112B2 (en) * | 2003-06-23 | 2008-12-30 | Microsoft Corporation | Distributed query engine pipeline method and system |
-
2009
- 2009-04-28 US US12/431,296 patent/US8386508B2/en active Active
Patent Citations (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5590319A (en) * | 1993-12-15 | 1996-12-31 | Information Builders, Inc. | Query processor for parallel processing in homogenous and heterogenous databases |
US5742806A (en) * | 1994-01-31 | 1998-04-21 | Sun Microsystems, Inc. | Apparatus and method for decomposing database queries for database management system including multiprocessor digital data processing system |
US6289334B1 (en) * | 1994-01-31 | 2001-09-11 | Sun Microsystems, Inc. | Apparatus and method for decomposing database queries for database management system including multiprocessor digital data processing system |
US6345267B1 (en) * | 1997-06-30 | 2002-02-05 | International Business Machines Corporation | Method and system for look ahead query evaluation planning based on interesting partition properties |
US7472112B2 (en) * | 2003-06-23 | 2008-12-30 | Microsoft Corporation | Distributed query engine pipeline method and system |
US20050131877A1 (en) * | 2003-12-16 | 2005-06-16 | Oracle International Corporation | Executing filter subqueries using a parallel single cursor model |
US20060218123A1 (en) * | 2005-03-28 | 2006-09-28 | Sybase, Inc. | System and Methodology for Parallel Query Optimization Using Semantic-Based Partitioning |
Cited By (104)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US9219579B2 (en) | 2004-07-23 | 2015-12-22 | Citrix Systems, Inc. | Systems and methods for client-side application-aware prioritization of network communications |
US8914522B2 (en) | 2004-07-23 | 2014-12-16 | Citrix Systems, Inc. | Systems and methods for facilitating a peer to peer route via a gateway |
US8892778B2 (en) | 2004-07-23 | 2014-11-18 | Citrix Systems, Inc. | Method and systems for securing remote access to private networks |
US8954595B2 (en) | 2004-12-30 | 2015-02-10 | Citrix Systems, Inc. | Systems and methods for providing client-side accelerated access to remote applications via TCP buffering |
US8856777B2 (en) | 2004-12-30 | 2014-10-07 | Citrix Systems, Inc. | Systems and methods for automatic installation and execution of a client-side acceleration program |
US8848710B2 (en) | 2005-01-24 | 2014-09-30 | Citrix Systems, Inc. | System and method for performing flash caching of dynamically generated objects in a data communication network |
US12020294B2 (en) | 2006-08-17 | 2024-06-25 | Experian Informaton Solutions, Inc. | System and method for providing a score for a used vehicle |
US11257126B2 (en) | 2006-08-17 | 2022-02-22 | Experian Information Solutions, Inc. | System and method for providing a score for a used vehicle |
US20100198855A1 (en) * | 2009-01-30 | 2010-08-05 | Ranganathan Venkatesan N | Providing parallel result streams for database queries |
US8666966B2 (en) * | 2009-01-30 | 2014-03-04 | Hewlett-Packard Development Company, L.P. | Providing parallel result streams for database queries |
US8990216B2 (en) | 2010-03-19 | 2015-03-24 | Microsoft Corporation | Scalable index build techniques for column stores |
US9547677B2 (en) | 2010-03-19 | 2017-01-17 | Microsoft Technology Licensing, Llc | Scalable index build techniques for column stores |
US20110231403A1 (en) * | 2010-03-19 | 2011-09-22 | Microsoft Corporation | Scalable index build techniques for column stores |
US10216777B2 (en) | 2010-03-19 | 2019-02-26 | Microsoft Technology Licensing, Llc | Scalable index build techniques for column stores |
US10838957B2 (en) * | 2010-06-17 | 2020-11-17 | Microsoft Technology Licensing, Llc | Slicing relational queries using spool operators |
US20110313999A1 (en) * | 2010-06-17 | 2011-12-22 | Microsoft Corporation | Slicing relational queries using spool operators |
US20130091119A1 (en) * | 2010-06-21 | 2013-04-11 | Telefonaktiebolaget L M Ericsson (Publ) | Method and Server for Handling Database Queries |
US8843473B2 (en) * | 2010-06-21 | 2014-09-23 | Telefonaktiebolaget L M Ericsson (Publ) | Method and server for handling database queries |
US8543687B2 (en) * | 2010-07-22 | 2013-09-24 | International Business Machines Corporation | Moving deployment of images between computers |
US20120023222A1 (en) * | 2010-07-22 | 2012-01-26 | International Business Machines Corporation | Moving deployment of images between computers |
US8838624B2 (en) | 2010-09-24 | 2014-09-16 | Hitachi Data Systems Corporation | System and method for aggregating query results in a fault-tolerant database management system |
WO2012039992A1 (en) * | 2010-09-24 | 2012-03-29 | Hitachi Data Systems Corporation | System and method for aggregating query results in a fault-tolerant database management system |
US9355141B2 (en) | 2010-09-24 | 2016-05-31 | Hitachi Data Systems Corporation | System and method for aggregating query results in a fault-tolerant database management system |
US9898514B2 (en) | 2010-09-24 | 2018-02-20 | Hitachi Data Systems Corporation | System and method for aggregating query results in a fault-tolerant database management system |
US11301922B2 (en) | 2010-11-18 | 2022-04-12 | AUTO I.D., Inc. | System and method for providing comprehensive vehicle information |
US11532030B1 (en) | 2010-11-18 | 2022-12-20 | AUTO I.D., Inc. | System and method for providing comprehensive vehicle information |
US11587163B1 (en) | 2010-11-18 | 2023-02-21 | AUTO I.D., Inc. | System and method for providing comprehensive vehicle build information |
US11176608B1 (en) | 2010-11-18 | 2021-11-16 | AUTO I.D., Inc. | Web-based system and method for providing comprehensive vehicle build information |
US10977727B1 (en) | 2010-11-18 | 2021-04-13 | AUTO I.D., Inc. | Web-based system and method for providing comprehensive vehicle build information |
US11836785B1 (en) | 2010-11-18 | 2023-12-05 | AUTO I.D., Inc. | System and method for providing comprehensive vehicle information |
US20120130984A1 (en) * | 2010-11-22 | 2012-05-24 | Microsoft Corporation | Dynamic query master agent for query execution |
US10437892B2 (en) | 2010-11-22 | 2019-10-08 | Microsoft Technology Licensing, Llc | Efficient forward ranking in a search engine |
US9342582B2 (en) | 2010-11-22 | 2016-05-17 | Microsoft Technology Licensing, Llc | Selection of atoms for search engine retrieval |
US9195745B2 (en) * | 2010-11-22 | 2015-11-24 | Microsoft Technology Licensing, Llc | Dynamic query master agent for query execution |
US9424351B2 (en) | 2010-11-22 | 2016-08-23 | Microsoft Technology Licensing, Llc | Hybrid-distribution model for search engine indexes |
US9529908B2 (en) | 2010-11-22 | 2016-12-27 | Microsoft Technology Licensing, Llc | Tiering of posting lists in search engine index |
US8713024B2 (en) | 2010-11-22 | 2014-04-29 | Microsoft Corporation | Efficient forward ranking in a search engine |
US10726029B2 (en) * | 2010-12-28 | 2020-07-28 | Citrix Systems, Inc. | Systems and methods for database proxy request switching |
US20120166483A1 (en) * | 2010-12-28 | 2012-06-28 | Akshat Choudhary | Systems and Methods for Database Proxy Request Switching |
US9589029B2 (en) * | 2010-12-28 | 2017-03-07 | Citrix Systems, Inc. | Systems and methods for database proxy request switching |
US20170147656A1 (en) * | 2010-12-28 | 2017-05-25 | Citrix Systems, Inc. | Systems and methods for database proxy request switching |
US10311105B2 (en) * | 2010-12-28 | 2019-06-04 | Microsoft Technology Licensing, Llc | Filtering queried data on data stores |
US9613066B2 (en) | 2012-10-04 | 2017-04-04 | Oracle International Corporation | Efficient pushdown of joins in a heterogeneous database system involving a large-scale low-power cluster |
US9563648B2 (en) | 2013-02-25 | 2017-02-07 | EMC IP Holding Company LLC | Data analytics platform over parallel databases and distributed file systems |
US9858315B2 (en) | 2013-02-25 | 2018-01-02 | EMC IP Holding Company LLC | Data analytics platform over parallel databases and distributed file systems |
US10838960B2 (en) | 2013-02-25 | 2020-11-17 | EMC IP Holding Company LLC | Data analytics platform over parallel databases and distributed file systems |
US9582520B1 (en) | 2013-02-25 | 2017-02-28 | EMC IP Holding Company LLC | Transaction model for data stores using distributed file systems |
US10769146B1 (en) | 2013-02-25 | 2020-09-08 | EMC IP Holding Company LLC | Data locality based query optimization for scan operators |
US10698891B2 (en) | 2013-02-25 | 2020-06-30 | EMC IP Holding Company LLC | MxN dispatching in large scale distributed system |
US9753980B1 (en) | 2013-02-25 | 2017-09-05 | EMC IP Holding Company LLC | M X N dispatching in large scale distributed system |
US10204140B2 (en) * | 2013-03-14 | 2019-02-12 | Oracle International Corporation | Massively parallel and in-memory execution of grouping and aggregation in a heterogeneous system |
US20140280298A1 (en) * | 2013-03-14 | 2014-09-18 | Oracle International Corporation | Massively Parallel And In-Memory Execution Of Grouping And Aggregation In a Heterogeneous System |
US11126626B2 (en) | 2013-03-14 | 2021-09-21 | Oracle International Corporation | Massively parallel and in-memory execution of grouping and aggregation in a heterogeneous system |
US20140280036A1 (en) * | 2013-03-15 | 2014-09-18 | Teradata Us, Inc. | Techniques for improving the performance of complex queries |
US11468061B2 (en) * | 2013-03-15 | 2022-10-11 | Teradata Us, Inc. | Incremental simplification and optimization of complex queries using dynamic result feedback |
US10268724B2 (en) * | 2013-03-15 | 2019-04-23 | Teradata Us, Inc. | Techniques for improving the performance of complex queries |
US9373322B2 (en) * | 2013-04-10 | 2016-06-21 | Nuance Communications, Inc. | System and method for determining query intent |
US20140309993A1 (en) * | 2013-04-10 | 2014-10-16 | Nuance Communications, Inc. | System and method for determining query intent |
US9983903B2 (en) * | 2013-06-24 | 2018-05-29 | Sap Se | Parallel execution of parsed query based on a concurrency level |
US10545789B2 (en) | 2013-06-24 | 2020-01-28 | Sap Se | Task scheduling for highly concurrent analytical and transaction workloads |
US9329899B2 (en) * | 2013-06-24 | 2016-05-03 | Sap Se | Parallel execution of parsed query based on a concurrency level corresponding to an average number of available worker threads |
US9329937B1 (en) * | 2013-12-31 | 2016-05-03 | Google Inc. | High availability architecture |
US20170161323A1 (en) * | 2014-06-30 | 2017-06-08 | Hewlett Packard Enterprise Development Lp | Automatic generation of sub-queries |
US10747762B2 (en) * | 2014-06-30 | 2020-08-18 | Micro Focus Llc | Automatic generation of sub-queries |
US10387421B2 (en) | 2014-09-26 | 2019-08-20 | Oracle International Corporation | System and method for generating size-based splits in a massively parallel or distributed database environment |
US10394818B2 (en) | 2014-09-26 | 2019-08-27 | Oracle International Corporation | System and method for dynamic database split generation in a massively parallel or distributed database environment |
US10089357B2 (en) | 2014-09-26 | 2018-10-02 | Oracle International Corporation | System and method for generating partition-based splits in a massively parallel or distributed database environment |
US10078684B2 (en) | 2014-09-26 | 2018-09-18 | Oracle International Corporation | System and method for query processing with table-level predicate pushdown in a massively parallel or distributed database environment |
US20160092524A1 (en) * | 2014-09-26 | 2016-03-31 | Oracle International Corporation | System and method for data transfer from jdbc to a data warehouse layer in a massively parallel or distributed database environment |
US10089377B2 (en) * | 2014-09-26 | 2018-10-02 | Oracle International Corporation | System and method for data transfer from JDBC to a data warehouse layer in a massively parallel or distributed database environment |
US10180973B2 (en) | 2014-09-26 | 2019-01-15 | Oracle International Corporation | System and method for efficient connection management in a massively parallel or distributed database environment |
US10380114B2 (en) | 2014-09-26 | 2019-08-13 | Oracle International Corporation | System and method for generating rowid range-based splits in a massively parallel or distributed database environment |
US10528596B2 (en) | 2014-09-26 | 2020-01-07 | Oracle International Corporation | System and method for consistent reads between tasks in a massively parallel or distributed database environment |
US11481827B1 (en) | 2014-12-18 | 2022-10-25 | Experian Information Solutions, Inc. | System, method, apparatus and medium for simultaneously generating vehicle history reports and preapproved financing options |
CN104504154A (en) * | 2015-01-14 | 2015-04-08 | 曙光信息产业(北京)有限公司 | Method and device for data aggregate query |
CN107111653A (en) * | 2015-02-25 | 2017-08-29 | 华为技术有限公司 | The query optimization that Installed System Memory suitable for parallel database system is loaded |
US20160246842A1 (en) * | 2015-02-25 | 2016-08-25 | Futurewei Technologies, Inc. | Query optimization adaptive to system memory load for parallel database systems |
US10055470B1 (en) * | 2015-04-26 | 2018-08-21 | Ims Health Incorporated | Real-time query transformation and data retrieval |
US11429625B2 (en) | 2015-06-26 | 2022-08-30 | Musarubra Us Llc | Query engine for remote endpoint information retrieval |
WO2016209450A1 (en) * | 2015-06-26 | 2016-12-29 | Mcafee, Inc. | Query engine for remote endpoint information retrieval |
US10599662B2 (en) | 2015-06-26 | 2020-03-24 | Mcafee, Llc | Query engine for remote endpoint information retrieval |
CN108064379A (en) * | 2015-06-26 | 2018-05-22 | 迈克菲有限责任公司 | The query engine fetched for remote endpoint information |
US20170010968A1 (en) * | 2015-07-08 | 2017-01-12 | Futurewei Technologies, Inc. | System and method for data caching in processing nodes of a massively parallel processing (mpp) database system |
US9875186B2 (en) * | 2015-07-08 | 2018-01-23 | Futurewei Technologies, Inc. | System and method for data caching in processing nodes of a massively parallel processing (MPP) database system |
US20170262521A1 (en) * | 2016-03-11 | 2017-09-14 | Linkedin Corporation | Partitioning and replicating data in scalable distributed data stores |
US11886519B1 (en) | 2016-06-16 | 2024-01-30 | Experian Information Solutions, Inc. | Systems and methods of managing a database of alphanumeric values |
US11210351B1 (en) | 2016-06-16 | 2021-12-28 | Experian Information Solutions, Inc. | Systems and methods of managing a database of alphanumeric values |
US11568005B1 (en) | 2016-06-16 | 2023-01-31 | Experian Information Solutions, Inc. | Systems and methods of managing a database of alphanumeric values |
US20180157761A1 (en) * | 2016-11-25 | 2018-06-07 | Infosum Limited | Accessing databases |
US10831844B2 (en) * | 2016-11-25 | 2020-11-10 | Infosum Limited | Accessing databases |
US11210276B1 (en) * | 2017-07-14 | 2021-12-28 | Experian Information Solutions, Inc. | Database system for automated event analysis and detection |
US11640433B1 (en) | 2018-03-07 | 2023-05-02 | Experian Information Solutions, Inc. | Database system for dynamically generating customized models |
US11366860B1 (en) | 2018-03-07 | 2022-06-21 | Experian Information Solutions, Inc. | Database system for dynamically generating customized models |
US12019689B1 (en) | 2018-03-07 | 2024-06-25 | Experian Information Solutions, Inc. | Database system for dynamically generating customized models |
CN109753525A (en) * | 2018-12-28 | 2019-05-14 | 国云科技股份有限公司 | It is a kind of based on enterprise query system that can be properties and its implementation |
US11790269B1 (en) | 2019-01-11 | 2023-10-17 | Experian Information Solutions, Inc. | Systems and methods for generating dynamic models based on trigger events |
US11157835B1 (en) | 2019-01-11 | 2021-10-26 | Experian Information Solutions, Inc. | Systems and methods for generating dynamic models based on trigger events |
US11431658B2 (en) * | 2020-04-02 | 2022-08-30 | Paymentus Corporation | Systems and methods for aggregating user sessions for interactive transactions using virtual assistants |
US11991126B2 (en) | 2020-04-02 | 2024-05-21 | Paymentus Corporation | Systems and methods for aggregating user sessions for interactive transactions using virtual assistants |
WO2021143199A1 (en) * | 2020-06-30 | 2021-07-22 | 平安科技(深圳)有限公司 | Method and apparatus for searching log, computer device, and storage medium |
US20220179861A1 (en) * | 2020-12-08 | 2022-06-09 | International Business Machines Corporation | Scheduling query execution plans on a relational database |
GB2615505A (en) * | 2020-12-08 | 2023-08-09 | Ibm | Scheduling query execution plans on a relational database |
GB2615505B (en) * | 2020-12-08 | 2024-01-03 | Ibm | Scheduling query execution plans on a relational database |
CN113946600A (en) * | 2021-10-21 | 2022-01-18 | 北京人大金仓信息技术股份有限公司 | Data query method, data query device, computer equipment and medium |
Also Published As
Publication number | Publication date |
---|---|
US8386508B2 (en) | 2013-02-26 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US8386508B2 (en) | System and method for parallel query evaluation | |
US11755575B2 (en) | Processing database queries using format conversion | |
US10922313B2 (en) | Implementing composite custom indices in a multi-tenant database | |
US20190230000A1 (en) | Intelligent analytic cloud provisioning | |
US9946751B2 (en) | Methods and systems for joining indexes for query optimization in a multi-tenant database | |
US6801903B2 (en) | Collecting statistics in a database system | |
US10073885B2 (en) | Optimizer statistics and cost model for in-memory tables | |
AU761900B2 (en) | Processing precomputed views | |
EP3014488B1 (en) | Incremental maintenance of range-partitioned statistics for query optimization | |
US6477523B1 (en) | Selectivity prediction with compressed histograms in a parallel processing database system | |
US8782075B2 (en) | Query handling in databases with replicated data | |
US9946750B2 (en) | Estimating statistics for generating execution plans for database queries | |
US6138111A (en) | Cardinality-based join ordering | |
US10565201B2 (en) | Query processing management in a database management system | |
US8577871B2 (en) | Method and mechanism for out-of-the-box real-time SQL monitoring | |
US20090248631A1 (en) | System and Method for Balancing Workload of a Database Based Application by Partitioning Database Queries | |
JP2003526159A (en) | Multidimensional database and integrated aggregation server | |
US20080288444A1 (en) | Evaluating Multi-Table Join Selectivity in a Computer Database | |
US10521440B2 (en) | High performance data profiler for big data | |
US9235621B2 (en) | Data-aware scalable parallel execution of rollup operations | |
US10977280B2 (en) | Systems and methods for memory optimization interest-driven business intelligence systems | |
US20130060782A1 (en) | Determining indexes for improving database system performance | |
Saleem | Storage, indexing, query processing, and benchmarking in centralized and distributed RDF engines: a survey | |
Nam et al. | A parallel query processing system based on graph-based database partitioning | |
CN113568931A (en) | Route analysis system and method for data access request |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: INFOSYS TECHNOLOGIES LIMITED, INDIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:KRISHNAMOORTHY, SRIKUMAR;SHANMUGAVEL, S.;GAGRANI, AAKANKSHA;AND OTHERS;REEL/FRAME:023190/0698;SIGNING DATES FROM 20090611 TO 20090723 Owner name: INFOSYS TECHNOLOGIES LIMITED, INDIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:KRISHNAMOORTHY, SRIKUMAR;SHANMUGAVEL, S.;GAGRANI, AAKANKSHA;AND OTHERS;SIGNING DATES FROM 20090611 TO 20090723;REEL/FRAME:023190/0698 |
|
STCF | Information on status: patent grant |
Free format text: PATENTED CASE |
|
AS | Assignment |
Owner name: INFOSYS LIMITED, INDIA Free format text: CHANGE OF NAME;ASSIGNOR:INFOSYS TECHNOLOGIES LIMITED;REEL/FRAME:030050/0683 Effective date: 20110616 |
|
FEPP | Fee payment procedure |
Free format text: PAYOR NUMBER ASSIGNED (ORIGINAL EVENT CODE: ASPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY |
|
CC | Certificate of correction | ||
REMI | Maintenance fee reminder mailed | ||
FPAY | Fee payment |
Year of fee payment: 4 |
|
SULP | Surcharge for late payment | ||
MAFP | Maintenance fee payment |
Free format text: PAYMENT OF MAINTENANCE FEE, 8TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1552); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY Year of fee payment: 8 |