WO2011088293A1 - Managing data queries - Google Patents

Managing data queries Download PDF

Info

Publication number
WO2011088293A1
WO2011088293A1 PCT/US2011/021260 US2011021260W WO2011088293A1 WO 2011088293 A1 WO2011088293 A1 WO 2011088293A1 US 2011021260 W US2011021260 W US 2011021260W WO 2011088293 A1 WO2011088293 A1 WO 2011088293A1
Authority
WO
WIPO (PCT)
Prior art keywords
query
data
database
data source
plan
Prior art date
Application number
PCT/US2011/021260
Other languages
French (fr)
Inventor
Ian Schechter
Glenn John Allin
Iii Joseph Skeffington Wholey
Original Assignee
Ab Initio Technology Llc
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Ab Initio Technology Llc filed Critical Ab Initio Technology Llc
Priority to KR1020127018891A priority Critical patent/KR101784785B1/en
Priority to CN201180014176.7A priority patent/CN102822819B/en
Priority to KR1020177027578A priority patent/KR101877481B1/en
Priority to AU2011205787A priority patent/AU2011205787B2/en
Priority to EP11702533A priority patent/EP2524328A1/en
Priority to CA2786042A priority patent/CA2786042C/en
Priority to JP2012549105A priority patent/JP2013517574A/en
Publication of WO2011088293A1 publication Critical patent/WO2011088293A1/en
Priority to AU2016202098A priority patent/AU2016202098B2/en
Priority to AU2017202501A priority patent/AU2017202501B2/en

Links

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/24534—Query rewriting; Transformation
    • G06F16/24542—Plan optimisation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F15/00—Digital computers in general; Data processing equipment in general
    • G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a program unit and a register, e.g. for a simultaneous processing of several programs
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/10—File systems; File servers
    • G06F16/18—File system types
    • G06F16/182—Distributed file systems
    • 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/21—Design, administration or maintenance of databases
    • 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/242—Query formulation
    • G06F16/2425—Iterative querying; Query formulation based on the results of a preceding query
    • 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/242—Query formulation
    • G06F16/2433—Query languages
    • 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/242—Query formulation
    • G06F16/2433—Query languages
    • G06F16/244—Grouping and aggregation
    • 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/2452—Query translation
    • G06F16/24522—Translation of natural language queries to structured queries
    • 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
    • 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/2455—Query execution
    • 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/2458—Special types of queries, e.g. statistical queries, fuzzy queries or distributed queries
    • G06F16/2465—Query processing support for facilitating data mining operations in structured databases
    • 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/25—Integrating or interfacing systems involving database management systems
    • G06F16/258—Data format conversion from or to a database
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
    • G06F16/33—Querying
    • G06F16/332—Query formulation
    • G06F16/3325—Reformulation based on results of preceding query
    • G06F16/3326—Reformulation based on results of preceding query using relevance feedback from the user, e.g. relevance feedback on documents, documents sets, document terms or passages
    • G06F16/3328—Reformulation based on results of preceding query using relevance feedback from the user, e.g. relevance feedback on documents, documents sets, document terms or passages using graphical result space presentation or visualisation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/70—Information retrieval; Database structures therefor; File system structures therefor of video data
    • G06F16/73—Querying
    • G06F16/732—Query formulation
    • G06F16/7343—Query language or query format

Definitions

  • This description relates to managing data queries.
  • Data can be stored in databases and arranged in various forms such as database tables.
  • a database table can contain a set of data having a common theme or purpose.
  • the arrangement of a database table can be defined by a database scheme, and multiple database tables can have similar or identical arrangements. Further, the contents of a database and its associated database tables can change over time as data is adjusted, appended or deleted.
  • Various techniques can be used to transfer data into and out of a database and to manipulate the data in the database.
  • a method of preparing a database query for use by a data management system includes receiving a database query, receiving information about a data source, such as a database table, from a data storage, the database table being populated with data elements, producing a structural representation of the database table wherein the structural representation includes a formatted data organization reflective of the database table and is absent the data elements of the database table, and providing the structural representation and the database query to a plan generator capable of producing a query plan representing operations for executing the database query on the database table.
  • a data source such as a database table
  • aspects can include one or more of the following features.
  • the database query includes an SQL query.
  • Producing the structural representation of the database table includes determining data types from data structures in the database table, and assigning the data types to corresponding data structures in the structural representation.
  • Producing the structural representation of the database table includes determining data storage sizes of the data elements in the database table, and assigning the calculated data storage sizes to the structural representation.
  • Receiving the information about the database table includes identifying the database table based on a data source registry.
  • the data source registry contains data formats, keys, and indices of data sources.
  • a method of generating a dataflow graph representing a database query includes receiving a query plan from a plan generator, the query plan representing operations for executing a database query on a database table, and producing a dataflow graph from the query plan, wherein the dataflow graph includes at least one node that represents at least one operation represented by the query plan, and includes at least one link that represents at least one dataflow associated with the query plan.
  • aspects can include one or more of the following features.
  • the database query includes an SQL query.
  • Thee dataflow graph includes at least one node receiving a flow of data from at least one input dataset, and at least one node providing a flow of data to at least one output dataset.
  • the method further includes providing the database table to the dataflow graph, and executing the dataflow graph.
  • the method further includes receiving the output of the database query from the dataflow graph.
  • the plan generator includes a query optimizer.
  • Generating a specification of a dataflow graph includes mapping query operations of the query plan to components of the dataflow graph.
  • the query plan includes data types of parameters in the database query.
  • the database query contains a reference to an executable function, and the specification of a dataflow graph includes a component representing the executable function.
  • a method of generating a dataflow graph representing a database query includes receiving an SQL query, receiving information about a database table from a data storage, the database table being populated with data elements, producing a structural representation of the database table wherein the structural representation includes a formatted data organization reflective of the database table and is absent the data of the database table, providing the structural representation and the SQL query to a plan generator capable of producing a query plan representing operations for executing the SQL query on the database table, receiving a query plan from the plan generator, and producing a dataflow graph from the query plan, wherein the dataflow graph includes at least one node that represents at least one operation represented by the query plan, and includes at least one link that represents at least one dataflow associated with the query plan.
  • a system for preparing a database query for use by a data management system includes a data storage containing information about a database table, the database table being populated with data elements, and a computer system configured to receive a database query, produce a structural representation of the database table wherein the structural representation includes a formatted data
  • a system for generating a dataflow graph representing a database query includes a computer system configured to receive a query plan from a plan generator, the query plan representing operations for executing a database query on a database table, and produce a dataflow graph from the query plan, wherein the dataflow graph includes at least one node that represents at least one operation represented by the query plan, and includes at least one link that represents at least one dataflow associated with the query plan.
  • a system for preparing a database query for use by a data management system includes means for storing information about a database table, the database table being populated with data elements, and means for processing database queries, the processing including receiving a database query, producing a structural representation of the database table wherein the structural representation includes a formatted data organization reflective of the database table and is absent the data elements of the database table, and providing the structural representation and the database query to a plan generator capable of producing a query plan representing operations for executing the database query on the database table.
  • a system for generating a dataflow graph representing a database query includes means for processing a query plan, the processing including receiving a query plan from a plan generator, the query plan representing operations for executing a database query on a database table, and producing a dataflow graph from the query plan, wherein the dataflow graph includes at least one node that represents at least one operation represented by the query plan, and includes at least one link that represents at least one dataflow associated with the query plan.
  • a computer-readable medium storing a computer program for preparing a database query for use by a data management system includes instructions for causing a computer to receive a database query, receive information about a database table from a data storage, the database table being populated with data elements, produce a structural representation of the database table wherein the structural representation includes a formatted data organization reflective of the database table and is absent the data elements of the database table, and provide the structural representation and the database query to a plan generator capable of producing a query plan representing operations for executing the database query on the database table.
  • a computer-readable medium storing a computer program for generating a dataflow graph representing a database query includes instructions for causing a computer to receive a query plan from a plan generator, the query plan representing operations for executing a database query on a database table, and produce a dataflow graph from the query plan, wherein the dataflow graph includes at least one node that represents at least one operation represented by the query plan, and includes at least one link that represents at least one dataflow associated with the query plan.
  • FIG. 1 is a block diagram of a dataflow graph.
  • FIG. 2 illustrates a database query and a dataflow graph.
  • FIG. 3 is an overview of a database system and associated components.
  • FIG. 4 represents the execution of a dataflow graph.
  • FIG. 5 is a database table and a structural representation of a database table.
  • FIG. 6 illustrates a database query and a dataflow graph each containing an executable function.
  • FIGS. 7-8 are flowcharts for operations of a database system.
  • a database management system handles data stored in one or more data sources.
  • data sources can take one or more forms such as database tables, which can be collections of data organized into data structures such as rows and columns.
  • each row represents a record of data
  • each column represents a field within each of the rows.
  • a database query is a set of instructions describing a subset of the database contents and actions to take upon the data in that subset.
  • database queries written in a dedicated database query language such as Structured Query Language (SQL).
  • SQL Structured Query Language
  • an SQL query is the primary instrument for manipulating the contents of the database.
  • database queries and other computations associated with a database management system in a graphical representation may be represented as passing through a collection of operations, referred to as a dataflow.
  • a dataflow may be provided through a directed graph, with components of the computation being associated with the vertices of the graph and dataflows between the components corresponding to links (arcs, edges) of the graph.
  • a graph is a modular entity and may be connected to or combined with other modular graphs. Each graph can be made up of one or more other graphs, and a particular graph can be a component in a larger graph.
  • a graphical development environment (GDE) provides a user interface for specifying executable graphs and defining parameters for the graph components.
  • an example of a dataflow graph 101 includes an input component 102 providing a collection of data to be processed by the executable components 104a - 104j of the dataflow graph 101.
  • the input component 102 is a data source that can comprise data records associated with a database system or transactions associated with a transaction processing system. The data records may be stored in various forms such as a database table, for example.
  • Each executable component 104a - 104j is associated with a portion of the computation defined by the overall dataflow graph 101.
  • Work elements e.g., individual data records from the data collection or database table
  • output work elements which are in some cases the input work elements, or processed versions of the input work elements
  • output work elements from components 104e, 104g, and 104j are stored in output data components 102a - 102c.
  • Some graph-based database systems are used to process database queries. For example, a database query can be applied to one or more database tables to extract an identified subset of the database table contents, for example, for processing in a dataflow.
  • a graph-based database system accepts and executes database queries in the form of dataflow graphs. Other database systems may use other types of database queries.
  • one or more database tables are moved to a graph-based database system from another kind of database system that uses SQL.
  • the other database system may have many SQL queries already written that are incompatible with the graph-based database system.
  • the SQL queries can be converted to database queries compatible with the graph-based database system.
  • FIG. 2 shows an example of a database query 200 written in SQL.
  • This example database query 200 is intended to operate on database tables 202, 204 managed by a graph-based database management system.
  • the graph-based database management system can recognize the data in the database tables 202, 204 because the database tables are in a format native to the graph-based database management system.
  • the database tables 202, 204 might contain data obtained from other database tables, for example, database tables originating from a database system that recognizes SQL queries and does not use dataflow graphs.
  • the graph-based database management system does not have built-in functionality for processing SQL queries, so a graph-based database query can be produced to emulate the SQL database query 200.
  • the graph-based database query is recognizable by the graph-based database system.
  • the database query 200 can be converted 206 from an SQL query into a dataflow graph 208.
  • the dataflow graph 208 operates on the database tables 202, 204 by accepting them as input, and provides the execution results of the database query 200 as output. 2 Query Plans
  • a query plan is a description of the database operations that may be performed if the database query is executed.
  • the query plan may describe one possible arrangement of database operations, even if other arrangements of the operations or a different set of operations would accomplish the same result.
  • a database system may include a query plan generator (also sometimes called a query planner).
  • the query plan generator can produce a query plan when a database query is being executed, or the query plan generator can generate a query plan before any decision about executing the query is made.
  • database operations may be executed in various orders while still providing equivalent outputs.
  • the query plan generator may have functionality that determines an optimal query plan.
  • an optimal query plan could be the query plan that describes the arrangement of database operations for executing the database query in the least amount of time, or using the least amount of database resources such as data storage space, or otherwise accomplishing the database query within constraints that have been identified by the database system.
  • the query plan generator's functionality for determining an optimal query plan may include functionality that scores or ranks many possible query plans, and may also include functionality that rearranges possible query plans to an optimal or efficient configuration.
  • a single database query can be executed multiple times, and each execution could have a unique optimal query plan.
  • the data within a database table could change between two executions of a database query.
  • the operations described in the query plan that was generated for the first execution of the database query may need more or less execution time during the second execution of the database query than during the first execution.
  • a different arrangement of operations may be better suited to the second execution of the database query, for example, a different arrangement of the same operations, or an arrangement of different operations.
  • a query plan optimized for the second execution of the database query can be generated for that execution, taking into account the momentary state of the database table.
  • FIG. 3 shows a database query management system 300 for preparing a database query 302 for execution on a database management computer system 304.
  • the database management computer system 304 shown includes a graph execution engine 306 that handles database operations implemented as dataflow graphs.
  • the database query management system 300 also includes a graph generation computer system 308 having a graph generation engine 310 that can build a dataflow graph 312 from a description of operations to be performed by the dataflow graph. For example, the description of operations could be a query plan 314.
  • the database query management system 300 also includes a query planning computer system 316 that executes a query plan generator 318.
  • the query plan generator 318 can be any query plan generator that produces a query plan from a database query, and need not be designed with any functionality related to dataflow graphs or graph generation.
  • the database query management system 300 also includes a database computer system 320 having a database 322 in a data storage (e.g. a hard drive, optical disc, etc.) and containing one or more database tables 324a, 324b, 324c.
  • the computer systems can be connected to each other using a computer network such as a local area network (LAN), a wide-area network (WAN), a network such as the Internet, or another kind of computer network.
  • LAN local area network
  • WAN wide-area network
  • Internet another kind of computer network.
  • a database query and a database table 326 are received and processed by the graph generation computer system 308 prior to an execution of the dataflow graph.
  • the graph generation computer system 308 receives the database table 326 from the database computer system 320.
  • the database table 326 can take any of several forms.
  • the database table 326 could be a relational database table, a partial database table, a flat file, or another kind of data file or collection of data files.
  • the database table 326 could be received in the form of information about the database table, e.g. metadata about the database table, or a description of the database table.
  • the database table 326 could be identified by a data registry associated with the database computer system 320 or otherwise accessible to the graph generation computer system 308.
  • the data registry could be in the form of lookup file catalog, for example, which may contain a data file location associated with the database table 326, and primary key and index information associated with the database table.
  • the data registry could also provide information about the data formats for different types of database tables. Further, the data registry could also provide information about how a dataflow graph 312 can access the database table.
  • the graph generation computer system 308 also receives a database query 302 to be applied to the database table 326.
  • the database query could be an SQL query.
  • the database query 302 could be received from any number of possible sources.
  • the database query 302 could be received from a user interface 328 where a user 330 has entered the database query.
  • the database query 302 is received from a data storage, or the database query is received from a computer network such as the Internet, or the database query is generated based on another previously- received database query.
  • the graph generation computer system 308 provides (as represented by an arrow 332) a version of the database table 326 to the query planning computer system 316, produced from information about the database table 326.
  • the version of the database table 326 provided to the query planning computer system 316 could be a structural representation 334 of the database table that is smaller in size than the database table and thus requires fewer computational resources to process.
  • the structural representation 334 of the database table 326 may contain information about the database table, but is absent some or all of the data of the database table.
  • the structural representation 334 of the database table 326 could contain a format that reflects the format of the database table, such as the columns, rows, or fields of the database table.
  • the structural representation 334 of the database table 326 could also contain information about the data, such as data storage sizes of elements in the database table, or the data types of elements in the database table.
  • the graph generation computer system provides (as represented by the arrow 332) the database query 302 and the structural representation 334 of the database table 326 to the query planning computer system 316.
  • the query planning computer system 316 executes the query plan generator 318, which produces a query plan optimized for executing the database query 302 over the database table 326.
  • the structural representation 334 of the database table 326 supplies the same information used by the query plan generator 318 as would be supplied by the database table 326 itself, for example, data sizes, data types, and other information about the data contained in the database table.
  • the structural representation 334 of the database table 326 includes an index of data elements that is used to optimize data lookup and retrieval.
  • the query plan generator 318 can use the index to calculate the speed of identifying and retrieving data elements from the indexed database table 326.
  • the graph generation computer system 308 receives a query plan 314 from the query planning computer system 316.
  • the query plan 314 describes an arrangement of database operations that can be used to execute the database query 302 over the database table 326.
  • the operations in the query plan 314 can correspond to nodes of a dataflow graph 312.
  • the query plan 314 can also include information about the data types used by the operations in the query plan.
  • the operations in the query plan could have parameters, and the data types of the parameters could be described in the query plan.
  • the query plan 314 is provided to the graph generation computer system 308 for dataflow graph 312 production by the graph generation engine 310.
  • the graph generation engine 310 outputs a dataflow graph 312 corresponding to the query plan 314.
  • the dataflow graph 312 has nodes representing operations described in the query plan, and node links representing flows of data between the operations. Because a dataflow graph 312 may be generated for each instance of preparing a database query for execution, the graph generation engine 310 can generate a dataflow graph quickly enough to respond to real-time requests to execute a database query. In some implementations, the graph generation engine 310 can generate a dataflow graph from a query plan in less than one second.
  • the graph generation computer system 308 provides (represented by an arrow 336) the dataflow graph 312 generated by the graph generation engine 316 to the database management computer system 304.
  • the graph generation computer system 308 also prepares the database table 326 for use by the database management computer system and provides the prepared database table 338.
  • graph generation computer system 308 might convert the database table 326 from a format used by the graph generation computer system 308 to a format used by the database management computer system 304.
  • the dataflow graph 312 is prepared for execution. As shown in FIG. 4, the database management computer system 304 can execute operations of the dataflow graph 312 and use the database table 326 in order to produce results 402 of the database query.
  • the database management computer system 304 provides the database table 326 to one or more nodes 404a, 404b, 404c of the dataflow graph 312 and executes the dataflow graph using the graph execution engine 306.
  • the graph execution engine 306 performs the operations represented by the nodes 404a, 404b, 404c of the dataflow graph 312, which correspond to database operations for executing the underlying database query. Further, links 408a, 408b, 408c between the nodes represent flows of data between the database operations as the database table is processed.
  • the dataflow graph 312 outputs the results 402 of the database query.
  • FIG. 5 shows an example of a database table 500 and a structural representation 502 of the database table (containing none of the data from the database table).
  • the database table 500 has columns 504a-504i that may contain similar or different types of data.
  • the database table 500 also has rows 508a-508e each containing a field
  • Each field of a row contains a data element 510a, 510b, 510c of the data type of the corresponding column (e.g. character string, integer, floating point number, etc.).
  • each row 508a-508e has an inherent data storage size 512a- 512e.
  • the data storage size 512a-512e might be the amount of storage space used by the data elements of the row when the row resides in data storage such as memory.
  • the structural representation 502 of the database table 500 (produced by the graph generation computer system 308 as shown in FIG. 3) has columns 514a-514i identical to the database table, including the same data types as the original columns 504a-504i.
  • the structural representation 502 of the database table 500 also has rows 518a-518e corresponding to the rows 508a-508e of the database table. However, the rows 518a- 518e do not contain the data elements 510a, 510b, 510c from the database table 500.
  • Each row 518a-518e is associated with a data storage size value 520a-520e.
  • the data storage size 512a-512e of a row in the database table 500 could be calculated from the data storage sizes of the individual data elements 510a, 510b, 510c
  • the data storage size value 520a-520e of each row 518a-518e can itself be a data element stored alongside each row in the structural representation 502 of the database table.
  • the total data storage size of the structural representation 502 of the database table 500 may be a small percentage of the total data storage size of the database table, because the fields 522a, 522b, 522c of the structural representation of the database table are absent the data elements 510a, 510b, 510c from the fields of the database table.
  • the structural representation 502 of the database table 500 may retain some data elements from the database table, for example, the structural representation of the database table may retain data elements corresponding to key values 524, 526 or other data elements used in the structure, organization, or format of the database table.
  • the structural representation 502 of the database table 500 may contain an index or another data structure that provides information used in data retrieval.
  • the structural representation 502 of the database table 500 may contain other statistics about the data contained in the database table.
  • a custom graph function 602 can be embedded in a database query 604.
  • the custom graph function 602 might represent an operation that a dataflow graph 606 can carry out during the execution of the dataflow graph.
  • the custom graph function 602 might not have any functionality within the context of the database query 604, and is placed in the database query to be passed to the generated dataflow graph 606.
  • the custom graph function 602 might be added to a database query 604 to prepare it for conversion to a dataflow graph but replacing or augmenting part of the existing database query.
  • the query plan generator might not have information about the functionality of the custom graph function 602.
  • the custom graph function 602 may be a function that has no equivalent function in the language of the database query 604.
  • the query plan generator may be aware of the input data type or output data type for the custom graph function 602. When the dataflow graph 606 is generated 608, the custom graph function 602 could act as a node 610 of the dataflow graph.
  • the custom graph function 602 may be a function used for accessing data in a special or customized format, or the custom graph function may be a function used to execute a regular expression or pattern matching expression, or the custom graph function may be a function implemented by a user, for example, a user of the database management computer system.
  • FIG. 7 is a flowchart 700 showing exemplary operations of the graph generation computer system 308 (shown in FIG. 3).
  • the graph generation computer system receives a database query, for example, from a user interface or from data storage.
  • the graph generation computer system receives information a database table from a database on a database system, e.g., the graph generation computer system may receive the database table itself from a data storage, or the graph generation computer system may receive metadata about the database table, or the graph generation computer system may receive information about the database table as entered by a user at a user interface.
  • the graph generation computer system generates a structural representation of the database table that includes a formatted data organization reflective of the database table and is absent the data of the database table.
  • the graph generation computer system provides the structural representation of the database table and the database query to a query planning computer system for use by a query plan generator.
  • the graph generation computer system receives a query plan, produced by the query plan generator, from the query planning computer system.
  • the graph generation computer system uses a graph generation engine to generate a dataflow graph from the query plan based on the operations described in the query plan.
  • the graph generation computer system provides the dataflow graph for execution (e.g by a graph execution engine of a database management system).
  • FIG. 8 is a flowchart 800 showing exemplary operations of the graph generation computer system 308 (shown in FIG. 3).
  • the graph generation computer system receives information about a database table, for example, the graph generation computer system may receive a database table previously received from a user interface or from data storage, or may receive metadata describing the database table.
  • the graph generation computer system generates a new database table having the same column and row format of the received database table.
  • the graph generation computer system identifies the data types associated with the received database table by extracting the data types from the columns of the database table.
  • the graph generation computer system assigns the identified data types to the columns of the new database table.
  • the graph generation computer system calculates data statistics about the received database table, for example, the data storage sizes of the data elements of the rows of the received database table.
  • the graph generation computer system assigns the calculated data statistics to the new database table, which serves as the structural representation of the received database table.
  • the database query managing approach described above can be implemented using software for execution on a computer.
  • the software forms procedures in one or more computer programs that execute on one or more programmed or programmable computer systems (which may be of various architectures such as distributed, client/server, or grid) each including at least one processor, at least one data storage system (including volatile and non- volatile memory and/or storage elements), at least one input device or port, and at least one output device or port.
  • the software may form one or more modules of a larger program, for example, that provides other services related to the design and configuration of computation graphs.
  • the nodes and elements of the graph can be implemented as data structures stored in a computer readable medium or other organized data conforming to a data model stored in a data repository.
  • the software may be provided on a storage medium, such as a CD-ROM, readable by a general or special purpose programmable computer or delivered (encoded in a propagated signal) over a communication medium of a network to the computer where it is executed. All of the functions may be performed on a special purpose computer, or using special-purpose hardware, such as coprocessors.
  • the software may be implemented in a distributed manner in which different parts of the computation specified by the software are performed by different computers.
  • Each such computer program is preferably stored on or downloaded to a storage media or device (e.g., solid state memory or media, or magnetic or optical media) readable by a general or special purpose programmable computer, for configuring and operating the computer when the storage media or device is read by the computer system to perform the procedures described herein.
  • a storage media or device e.g., solid state memory or media, or magnetic or optical media
  • the inventive system may also be considered to be implemented as a computer-readable storage medium, configured with a computer program, where the storage medium so configured causes a computer system to operate in a specific and predefined manner to perform the functions described herein.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Databases & Information Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Data Mining & Analysis (AREA)
  • Computational Linguistics (AREA)
  • Mathematical Physics (AREA)
  • Operations Research (AREA)
  • Software Systems (AREA)
  • Computer Hardware Design (AREA)
  • Fuzzy Systems (AREA)
  • Probability & Statistics with Applications (AREA)
  • Artificial Intelligence (AREA)
  • Multimedia (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

One method includes receiving a database query, receiving information about a data source (102) such as a database table (324a, 324b, 324c) in data storage populated with data elements, producing a structural representation (334) of the database table that includes a formatted data organization reflective of the database table and is absent the data elements of the database table, and providing the structural representation and the database query to a plan generator (318) capable of producing a query plan (314). Another method includes receiving a query plan (314) from a plan generator (318), the plan representing operations for executing a database query on a data source (102) such as a database table (324a, 324b, 324c), and producing a dataflow graph (312) from the query plan.

Description

MANAGING DATA QUERIE S
BACKGROUND
This description relates to managing data queries.
Data can be stored in databases and arranged in various forms such as database tables. A database table can contain a set of data having a common theme or purpose. The arrangement of a database table can be defined by a database scheme, and multiple database tables can have similar or identical arrangements. Further, the contents of a database and its associated database tables can change over time as data is adjusted, appended or deleted. Various techniques can be used to transfer data into and out of a database and to manipulate the data in the database.
SUMMARY
In one aspect, in general, a method of preparing a database query for use by a data management system includes receiving a database query, receiving information about a data source, such as a database table, from a data storage, the database table being populated with data elements, producing a structural representation of the database table wherein the structural representation includes a formatted data organization reflective of the database table and is absent the data elements of the database table, and providing the structural representation and the database query to a plan generator capable of producing a query plan representing operations for executing the database query on the database table.
Aspects can include one or more of the following features.
The database query includes an SQL query.
Producing the structural representation of the database table includes determining data types from data structures in the database table, and assigning the data types to corresponding data structures in the structural representation.
Producing the structural representation of the database table includes determining data storage sizes of the data elements in the database table, and assigning the calculated data storage sizes to the structural representation. Receiving the information about the database table includes identifying the database table based on a data source registry.
The data source registry contains data formats, keys, and indices of data sources.
In one aspect, in general, a method of generating a dataflow graph representing a database query includes receiving a query plan from a plan generator, the query plan representing operations for executing a database query on a database table, and producing a dataflow graph from the query plan, wherein the dataflow graph includes at least one node that represents at least one operation represented by the query plan, and includes at least one link that represents at least one dataflow associated with the query plan.
Aspects can include one or more of the following features.
The database query includes an SQL query.
Thee dataflow graph includes at least one node receiving a flow of data from at least one input dataset, and at least one node providing a flow of data to at least one output dataset.
The method further includes providing the database table to the dataflow graph, and executing the dataflow graph.
The method further includes receiving the output of the database query from the dataflow graph.
The plan generator includes a query optimizer.
Generating a specification of a dataflow graph includes mapping query operations of the query plan to components of the dataflow graph.
The query plan includes data types of parameters in the database query.
The database query contains a reference to an executable function, and the specification of a dataflow graph includes a component representing the executable function.
In one aspect, in general, a method of generating a dataflow graph representing a database query includes receiving an SQL query, receiving information about a database table from a data storage, the database table being populated with data elements, producing a structural representation of the database table wherein the structural representation includes a formatted data organization reflective of the database table and is absent the data of the database table, providing the structural representation and the SQL query to a plan generator capable of producing a query plan representing operations for executing the SQL query on the database table, receiving a query plan from the plan generator, and producing a dataflow graph from the query plan, wherein the dataflow graph includes at least one node that represents at least one operation represented by the query plan, and includes at least one link that represents at least one dataflow associated with the query plan.
In one aspect, in general, a system for preparing a database query for use by a data management system includes a data storage containing information about a database table, the database table being populated with data elements, and a computer system configured to receive a database query, produce a structural representation of the database table wherein the structural representation includes a formatted data
organization reflective of the database table and is absent the data elements of the database table, and provide the structural representation and a database query to a plan generator capable of producing a query plan representing operations for executing the database query on the database table.
In one aspect, in general, a system for generating a dataflow graph representing a database query includes a computer system configured to receive a query plan from a plan generator, the query plan representing operations for executing a database query on a database table, and produce a dataflow graph from the query plan, wherein the dataflow graph includes at least one node that represents at least one operation represented by the query plan, and includes at least one link that represents at least one dataflow associated with the query plan.
In one aspect, in general, a system for preparing a database query for use by a data management system includes means for storing information about a database table, the database table being populated with data elements, and means for processing database queries, the processing including receiving a database query, producing a structural representation of the database table wherein the structural representation includes a formatted data organization reflective of the database table and is absent the data elements of the database table, and providing the structural representation and the database query to a plan generator capable of producing a query plan representing operations for executing the database query on the database table. In one aspect, in general, a system for generating a dataflow graph representing a database query includes means for processing a query plan, the processing including receiving a query plan from a plan generator, the query plan representing operations for executing a database query on a database table, and producing a dataflow graph from the query plan, wherein the dataflow graph includes at least one node that represents at least one operation represented by the query plan, and includes at least one link that represents at least one dataflow associated with the query plan.
In one aspect, in general, a computer-readable medium storing a computer program for preparing a database query for use by a data management system includes instructions for causing a computer to receive a database query, receive information about a database table from a data storage, the database table being populated with data elements, produce a structural representation of the database table wherein the structural representation includes a formatted data organization reflective of the database table and is absent the data elements of the database table, and provide the structural representation and the database query to a plan generator capable of producing a query plan representing operations for executing the database query on the database table.
In one aspect, in general, a computer-readable medium storing a computer program for generating a dataflow graph representing a database query includes instructions for causing a computer to receive a query plan from a plan generator, the query plan representing operations for executing a database query on a database table, and produce a dataflow graph from the query plan, wherein the dataflow graph includes at least one node that represents at least one operation represented by the query plan, and includes at least one link that represents at least one dataflow associated with the query plan.
DESCRIPTION OF DRAWINGS
FIG. 1 is a block diagram of a dataflow graph.
FIG. 2 illustrates a database query and a dataflow graph.
FIG. 3 is an overview of a database system and associated components.
FIG. 4 represents the execution of a dataflow graph.
FIG. 5 is a database table and a structural representation of a database table. FIG. 6 illustrates a database query and a dataflow graph each containing an executable function.
FIGS. 7-8 are flowcharts for operations of a database system.
DESCRIPTION
1 Databases, Queries, and Graphs
A database management system handles data stored in one or more data sources. Such data sources can take one or more forms such as database tables, which can be collections of data organized into data structures such as rows and columns. In one construct, each row represents a record of data, and each column represents a field within each of the rows.
The information contained in a database can be accessed and processed (e.g., modified) using database queries. A database query is a set of instructions describing a subset of the database contents and actions to take upon the data in that subset. For example, some database systems perform database queries written in a dedicated database query language such as Structured Query Language (SQL). In theses database systems, an SQL query is the primary instrument for manipulating the contents of the database.
In some implementations, database queries and other computations associated with a database management system in a graphical representation. For example, data may be represented as passing through a collection of operations, referred to as a dataflow. In one arrangement, a dataflow may be provided through a directed graph, with components of the computation being associated with the vertices of the graph and dataflows between the components corresponding to links (arcs, edges) of the graph. A graph is a modular entity and may be connected to or combined with other modular graphs. Each graph can be made up of one or more other graphs, and a particular graph can be a component in a larger graph. A graphical development environment (GDE) provides a user interface for specifying executable graphs and defining parameters for the graph components. A system that implements such graph-based computations is described in U.S. Patent 5,966,072, EXECUTING COMPUTATIONS EXPRESSED AS GRAPHS, which is incorporated herein by reference in its entirety. Referring to FIG. 1, an example of a dataflow graph 101 includes an input component 102 providing a collection of data to be processed by the executable components 104a - 104j of the dataflow graph 101. In some example example, the input component 102 is a data source that can comprise data records associated with a database system or transactions associated with a transaction processing system. The data records may be stored in various forms such as a database table, for example. Each executable component 104a - 104j is associated with a portion of the computation defined by the overall dataflow graph 101. Work elements (e.g., individual data records from the data collection or database table) enter one or more input ports of a component, and output work elements (which are in some cases the input work elements, or processed versions of the input work elements) typically leave one or more output ports of the component. In dataflow graph 101, output work elements from components 104e, 104g, and 104j are stored in output data components 102a - 102c.
Some graph-based database systems are used to process database queries. For example, a database query can be applied to one or more database tables to extract an identified subset of the database table contents, for example, for processing in a dataflow. In some implementations, a graph-based database system accepts and executes database queries in the form of dataflow graphs. Other database systems may use other types of database queries.
In some cases, one or more database tables are moved to a graph-based database system from another kind of database system that uses SQL. The other database system may have many SQL queries already written that are incompatible with the graph-based database system. In some implementations, the SQL queries can be converted to database queries compatible with the graph-based database system.
FIG. 2 shows an example of a database query 200 written in SQL. This example database query 200 is intended to operate on database tables 202, 204 managed by a graph-based database management system. The graph-based database management system can recognize the data in the database tables 202, 204 because the database tables are in a format native to the graph-based database management system. The database tables 202, 204 might contain data obtained from other database tables, for example, database tables originating from a database system that recognizes SQL queries and does not use dataflow graphs.
However, the graph-based database management system does not have built-in functionality for processing SQL queries, so a graph-based database query can be produced to emulate the SQL database query 200. The graph-based database query is recognizable by the graph-based database system. For example, the database query 200 can be converted 206 from an SQL query into a dataflow graph 208. The dataflow graph 208 operates on the database tables 202, 204 by accepting them as input, and provides the execution results of the database query 200 as output. 2 Query Plans
Some database systems carry out database queries such as SQL queries based on a query plan (also sometimes called an explain plan). A query plan is a description of the database operations that may be performed if the database query is executed. The query plan may describe one possible arrangement of database operations, even if other arrangements of the operations or a different set of operations would accomplish the same result.
To provide such query plans, a database system may include a query plan generator (also sometimes called a query planner). For example, the query plan generator can produce a query plan when a database query is being executed, or the query plan generator can generate a query plan before any decision about executing the query is made.
In some arrangements, database operations may be executed in various orders while still providing equivalent outputs. As such, the query plan generator may have functionality that determines an optimal query plan. For example, an optimal query plan could be the query plan that describes the arrangement of database operations for executing the database query in the least amount of time, or using the least amount of database resources such as data storage space, or otherwise accomplishing the database query within constraints that have been identified by the database system. The query plan generator's functionality for determining an optimal query plan may include functionality that scores or ranks many possible query plans, and may also include functionality that rearranges possible query plans to an optimal or efficient configuration.
A single database query can be executed multiple times, and each execution could have a unique optimal query plan. For example, the data within a database table could change between two executions of a database query. In this example, the operations described in the query plan that was generated for the first execution of the database query may need more or less execution time during the second execution of the database query than during the first execution. In this case, a different arrangement of operations may be better suited to the second execution of the database query, for example, a different arrangement of the same operations, or an arrangement of different operations. A query plan optimized for the second execution of the database query can be generated for that execution, taking into account the momentary state of the database table.
3 System Overview
A query plan generator can be used in producing a graph-based database query that emulates another kind of database query such as an SQL query. FIG. 3 shows a database query management system 300 for preparing a database query 302 for execution on a database management computer system 304. The database management computer system 304 shown includes a graph execution engine 306 that handles database operations implemented as dataflow graphs. The database query management system 300 also includes a graph generation computer system 308 having a graph generation engine 310 that can build a dataflow graph 312 from a description of operations to be performed by the dataflow graph. For example, the description of operations could be a query plan 314.
The database query management system 300 also includes a query planning computer system 316 that executes a query plan generator 318. The query plan generator 318 can be any query plan generator that produces a query plan from a database query, and need not be designed with any functionality related to dataflow graphs or graph generation. Further, the database query management system 300 also includes a database computer system 320 having a database 322 in a data storage (e.g. a hard drive, optical disc, etc.) and containing one or more database tables 324a, 324b, 324c. Although separate computer systems are shown for the database management computer system 304, the graph generation computer system 308, the query planning computer system 316, and the database computer system 320, two or more of these computer systems could be the same computer system, or components of the same computer system. All of the computer systems have at least one processor for executing their respective executable components and at least one data storage system. The computer systems can be connected to each other using a computer network such as a local area network (LAN), a wide-area network (WAN), a network such as the Internet, or another kind of computer network.
To demonstrate the production of a dataflow graph 312 from one or more database queries 302, a database query and a database table 326 are received and processed by the graph generation computer system 308 prior to an execution of the dataflow graph. The graph generation computer system 308 receives the database table 326 from the database computer system 320.
The database table 326 can take any of several forms. For example, the database table 326 could be a relational database table, a partial database table, a flat file, or another kind of data file or collection of data files. In some examples, the database table 326 could be received in the form of information about the database table, e.g. metadata about the database table, or a description of the database table.
In some implementations, the database table 326 could be identified by a data registry associated with the database computer system 320 or otherwise accessible to the graph generation computer system 308. The data registry could be in the form of lookup file catalog, for example, which may contain a data file location associated with the database table 326, and primary key and index information associated with the database table. The data registry could also provide information about the data formats for different types of database tables. Further, the data registry could also provide information about how a dataflow graph 312 can access the database table.
The graph generation computer system 308 also receives a database query 302 to be applied to the database table 326. For example, the database query could be an SQL query. The database query 302 could be received from any number of possible sources. For example, the database query 302 could be received from a user interface 328 where a user 330 has entered the database query. In some examples, the database query 302 is received from a data storage, or the database query is received from a computer network such as the Internet, or the database query is generated based on another previously- received database query.
In some implementations, the graph generation computer system 308 provides (as represented by an arrow 332) a version of the database table 326 to the query planning computer system 316, produced from information about the database table 326. For example, the version of the database table 326 provided to the query planning computer system 316 could be a structural representation 334 of the database table that is smaller in size than the database table and thus requires fewer computational resources to process. The structural representation 334 of the database table 326 may contain information about the database table, but is absent some or all of the data of the database table. For example, the structural representation 334 of the database table 326 could contain a format that reflects the format of the database table, such as the columns, rows, or fields of the database table. The structural representation 334 of the database table 326 could also contain information about the data, such as data storage sizes of elements in the database table, or the data types of elements in the database table.
The graph generation computer system provides (as represented by the arrow 332) the database query 302 and the structural representation 334 of the database table 326 to the query planning computer system 316. The query planning computer system 316 executes the query plan generator 318, which produces a query plan optimized for executing the database query 302 over the database table 326. The structural
representation 334 of the database table 326 supplies the same information used by the query plan generator 318 as would be supplied by the database table 326 itself, for example, data sizes, data types, and other information about the data contained in the database table. In some implementations, the structural representation 334 of the database table 326 includes an index of data elements that is used to optimize data lookup and retrieval. The query plan generator 318 can use the index to calculate the speed of identifying and retrieving data elements from the indexed database table 326.
The graph generation computer system 308 receives a query plan 314 from the query planning computer system 316. The query plan 314 describes an arrangement of database operations that can be used to execute the database query 302 over the database table 326. For example, the operations in the query plan 314 can correspond to nodes of a dataflow graph 312. The query plan 314 can also include information about the data types used by the operations in the query plan. For example, the operations in the query plan could have parameters, and the data types of the parameters could be described in the query plan.
Once produced, the query plan 314 is provided to the graph generation computer system 308 for dataflow graph 312 production by the graph generation engine 310. The graph generation engine 310 outputs a dataflow graph 312 corresponding to the query plan 314. In some implementations, the dataflow graph 312 has nodes representing operations described in the query plan, and node links representing flows of data between the operations. Because a dataflow graph 312 may be generated for each instance of preparing a database query for execution, the graph generation engine 310 can generate a dataflow graph quickly enough to respond to real-time requests to execute a database query. In some implementations, the graph generation engine 310 can generate a dataflow graph from a query plan in less than one second.
The graph generation computer system 308 provides (represented by an arrow 336) the dataflow graph 312 generated by the graph generation engine 316 to the database management computer system 304. In some implementations, the graph generation computer system 308 also prepares the database table 326 for use by the database management computer system and provides the prepared database table 338. For example, graph generation computer system 308 might convert the database table 326 from a format used by the graph generation computer system 308 to a format used by the database management computer system 304.
Once provided to the database management computer system 304, the dataflow graph 312 is prepared for execution. As shown in FIG. 4, the database management computer system 304 can execute operations of the dataflow graph 312 and use the database table 326 in order to produce results 402 of the database query. The database management computer system 304 provides the database table 326 to one or more nodes 404a, 404b, 404c of the dataflow graph 312 and executes the dataflow graph using the graph execution engine 306. The graph execution engine 306 performs the operations represented by the nodes 404a, 404b, 404c of the dataflow graph 312, which correspond to database operations for executing the underlying database query. Further, links 408a, 408b, 408c between the nodes represent flows of data between the database operations as the database table is processed. The dataflow graph 312 outputs the results 402 of the database query.
4 Structural Representation
FIG. 5 shows an example of a database table 500 and a structural representation 502 of the database table (containing none of the data from the database table). The database table 500 has columns 504a-504i that may contain similar or different types of data. The database table 500 also has rows 508a-508e each containing a field
corresponding to each column. Each field of a row contains a data element 510a, 510b, 510c of the data type of the corresponding column (e.g. character string, integer, floating point number, etc.). Further, each row 508a-508e has an inherent data storage size 512a- 512e. For example, the data storage size 512a-512e might be the amount of storage space used by the data elements of the row when the row resides in data storage such as memory.
The structural representation 502 of the database table 500 (produced by the graph generation computer system 308 as shown in FIG. 3) has columns 514a-514i identical to the database table, including the same data types as the original columns 504a-504i. The structural representation 502 of the database table 500 also has rows 518a-518e corresponding to the rows 508a-508e of the database table. However, the rows 518a- 518e do not contain the data elements 510a, 510b, 510c from the database table 500. Each row 518a-518e is associated with a data storage size value 520a-520e. While the data storage size 512a-512e of a row in the database table 500 could be calculated from the data storage sizes of the individual data elements 510a, 510b, 510c, the data storage size value 520a-520e of each row 518a-518e can itself be a data element stored alongside each row in the structural representation 502 of the database table. The total data storage size of the structural representation 502 of the database table 500 may be a small percentage of the total data storage size of the database table, because the fields 522a, 522b, 522c of the structural representation of the database table are absent the data elements 510a, 510b, 510c from the fields of the database table. In some implementations, the structural representation 502 of the database table 500 may retain some data elements from the database table, for example, the structural representation of the database table may retain data elements corresponding to key values 524, 526 or other data elements used in the structure, organization, or format of the database table. In some implementations, the structural representation 502 of the database table 500 may contain an index or another data structure that provides information used in data retrieval. In some implementations, the structural representation 502 of the database table 500 may contain other statistics about the data contained in the database table.
5 Function Calls
As shown in FIG. 6, in some implementations, a custom graph function 602 can be embedded in a database query 604. For example, the custom graph function 602 might represent an operation that a dataflow graph 606 can carry out during the execution of the dataflow graph. The custom graph function 602 might not have any functionality within the context of the database query 604, and is placed in the database query to be passed to the generated dataflow graph 606. For example, the custom graph function 602 might be added to a database query 604 to prepare it for conversion to a dataflow graph but replacing or augmenting part of the existing database query. Further, the query plan generator might not have information about the functionality of the custom graph function 602. The custom graph function 602 may be a function that has no equivalent function in the language of the database query 604. In some implementations, the query plan generator may be aware of the input data type or output data type for the custom graph function 602. When the dataflow graph 606 is generated 608, the custom graph function 602 could act as a node 610 of the dataflow graph.
In some implementations, the custom graph function 602 may be a function used for accessing data in a special or customized format, or the custom graph function may be a function used to execute a regular expression or pattern matching expression, or the custom graph function may be a function implemented by a user, for example, a user of the database management computer system. 6 Flow of Operation
FIG. 7 is a flowchart 700 showing exemplary operations of the graph generation computer system 308 (shown in FIG. 3). In step 702, the graph generation computer system receives a database query, for example, from a user interface or from data storage. In step 704, the graph generation computer system receives information a database table from a database on a database system, e.g., the graph generation computer system may receive the database table itself from a data storage, or the graph generation computer system may receive metadata about the database table, or the graph generation computer system may receive information about the database table as entered by a user at a user interface. In step 706, the graph generation computer system generates a structural representation of the database table that includes a formatted data organization reflective of the database table and is absent the data of the database table. In step 708, the graph generation computer system provides the structural representation of the database table and the database query to a query planning computer system for use by a query plan generator. In step 710, the graph generation computer system receives a query plan, produced by the query plan generator, from the query planning computer system. In step 712, the graph generation computer system uses a graph generation engine to generate a dataflow graph from the query plan based on the operations described in the query plan. In step 714, the graph generation computer system provides the dataflow graph for execution (e.g by a graph execution engine of a database management system).
FIG. 8 is a flowchart 800 showing exemplary operations of the graph generation computer system 308 (shown in FIG. 3). In step 802, the graph generation computer system receives information about a database table, for example, the graph generation computer system may receive a database table previously received from a user interface or from data storage, or may receive metadata describing the database table. In step 804, the graph generation computer system generates a new database table having the same column and row format of the received database table. In step 806, the graph generation computer system identifies the data types associated with the received database table by extracting the data types from the columns of the database table. In step 808, the graph generation computer system assigns the identified data types to the columns of the new database table. In step 810, the graph generation computer system calculates data statistics about the received database table, for example, the data storage sizes of the data elements of the rows of the received database table. In step 812, the graph generation computer system assigns the calculated data statistics to the new database table, which serves as the structural representation of the received database table.
The database query managing approach described above can be implemented using software for execution on a computer. For instance, the software forms procedures in one or more computer programs that execute on one or more programmed or programmable computer systems (which may be of various architectures such as distributed, client/server, or grid) each including at least one processor, at least one data storage system (including volatile and non- volatile memory and/or storage elements), at least one input device or port, and at least one output device or port. The software may form one or more modules of a larger program, for example, that provides other services related to the design and configuration of computation graphs. The nodes and elements of the graph can be implemented as data structures stored in a computer readable medium or other organized data conforming to a data model stored in a data repository.
The software may be provided on a storage medium, such as a CD-ROM, readable by a general or special purpose programmable computer or delivered (encoded in a propagated signal) over a communication medium of a network to the computer where it is executed. All of the functions may be performed on a special purpose computer, or using special-purpose hardware, such as coprocessors. The software may be implemented in a distributed manner in which different parts of the computation specified by the software are performed by different computers. Each such computer program is preferably stored on or downloaded to a storage media or device (e.g., solid state memory or media, or magnetic or optical media) readable by a general or special purpose programmable computer, for configuring and operating the computer when the storage media or device is read by the computer system to perform the procedures described herein. The inventive system may also be considered to be implemented as a computer-readable storage medium, configured with a computer program, where the storage medium so configured causes a computer system to operate in a specific and predefined manner to perform the functions described herein. A number of embodiments of the invention have been described. Nevertheless, it will be understood that various modifications may be made without departing from the spirit and scope of the invention. For example, some of the steps described above may be order independent, and thus can be performed in an order different from that described.
It is to be understood that the foregoing description is intended to illustrate and not to limit the scope of the invention, which is defined by the scope of the appended claims. For example, a number of the function steps described above may be performed in a different order without substantially affecting overall processing. Other
embodiments are within the scope of the following claims.

Claims

What is claimed is:
A method of preparing a database query for use by a data management system, the method including:
receiving a database query;
receiving information about a data source from a data storage, the data source being populated with data elements;
producing a structural representation of the data source wherein the structural representation includes a formatted data organization reflective of the data source and is absent the data elements of the data source; and
providing the structural representation and the database query to a plan
generator capable of producing a query plan representing operations for executing the database query on the data source.
The method of claim 1, wherein the database query includes an SQL query.
The method of claim 1 , wherein producing the structural representation of the data source includes:
determining data types from data structures in the data source; and assigning the data types to corresponding data structures in the structural representation.
The method of claim 1 , wherein producing the structural representation of the data source includes:
determining data storage sizes of the data elements in the data source; and assigning the calculated data storage sizes to the structural representation.
The method of claim 1 , wherein receiving the information about the data source includes identifying the data source based on a data source registry.
6. The method of claim 5, wherein the data source registry contains data formats, keys, and indices of data sources.
7. A method of generating a dataflow graph representing a database query, the
method including:
receiving a query plan from a plan generator, the query plan representing operations for executing a database query on a data source; and producing a dataflow graph from the query plan, wherein the dataflow graph includes at least one node that represents at least one operation represented by the query plan, and includes at least one link that represents at least one dataflow associated with the query plan.
8. The method of claim 7, wherein the database query includes an SQL query.
9. The method of claim 7, wherein the dataflow graph includes:
at least one node receiving a flow of data from at least one input dataset, and at least one node providing a flow of data to at least one output dataset.
10. The method of claim 7, further including:
providing the data source to the dataflow graph; and
executing the dataflow graph.
11. The method of claim 10, further including receiving the output of the database query from the dataflow graph.
12. The method of claim 7, wherein the plan generator includes a query optimizer.
13. The method of claim 7, wherein generating a specification of a dataflow graph includes mapping query operations of the query plan to components of the dataflow graph.
14. The method of claim 7, wherein the query plan includes data types of parameters in the database query.
15. The method of claim 7, wherein the database query contains a reference to an executable function, and the specification of a dataflow graph includes a component representing the executable function.
16. A method of generating a dataflow graph representing a database query, the
method including:
receiving an SQL query;
receiving information about a data source from a data storage, the data source being populated with data elements;
producing a structural representation of the data source wherein the structural representation includes a formatted data organization reflective of the data source and is absent the data of the data source;
providing the structural representation and the SQL query to a plan generator capable of producing a query plan representing operations for executing the SQL query on the data source;
receiving a query plan from the plan generator; and
producing a dataflow graph from the query plan, wherein the dataflow graph includes at least one node that represents at least one operation represented by the query plan, and includes at least one link that represents at least one dataflow associated with the query plan.
17. A system for preparing a database query for use by a data management system, the system including:
a data storage containing information about a data source, the data source being populated with data elements; and
a computer system configured to
receive a database query, produce a structural representation of the data source wherein the structural representation includes a formatted data organization reflective of the data source and is absent the data elements of the data source, and
provide the structural representation and a database query to a plan
generator capable of producing a query plan representing operations for executing the database query on the data source.
18. A system for generating a dataflow graph representing a database query, the system including:
a computer system configured to
receive a query plan from a plan generator, the query plan representing operations for executing a database query on a data source, and produce a dataflow graph from the query plan, wherein the dataflow graph includes at least one node that represents at least one operation represented by the query plan, and includes at least one link that represents at least one dataflow associated with the query plan.
19. A system for preparing a database query for use by a data management system, the system including:
means for storing information about a data source, the data source being
populated with data elements; and
means for processing database queries, the processing including
receiving a database query,
producing a structural representation of the data source wherein the
structural representation includes a formatted data organization reflective of the data source and is absent the data elements of the data source, and
providing the structural representation and the database query to a plan generator capable of producing a query plan representing operations for executing the database query on the data source.
20. A system for generating a dataflow graph representing a database query, the system including:
means for processing a query plan, the processing including
receiving a query plan from a plan generator, the query plan representing operations for executing a database query on a data source, and producing a dataflow graph from the query plan, wherein the dataflow graph includes at least one node that represents at least one operation represented by the query plan, and includes at least one link that represents at least one dataflow associated with the query plan.
21. A computer-readable medium storing a computer program for preparing a
database query for use by a data management system, the computer program including instructions for causing a computer to:
receive a database query;
receive information about a data source from a data storage, the data source being populated with data elements;
produce a structural representation of the data source wherein the structural representation includes a formatted data organization reflective of the data source and is absent the data elements of the data source; and provide the structural representation and the database query to a plan
generator capable of producing a query plan representing operations for executing the database query on the data source.
22. A computer-readable medium storing a computer program for generating a
dataflow graph representing a database query, the computer program including instructions for causing a computer to:
receive a query plan from a plan generator, the query plan representing
operations for executing a database query on a data source; and produce a dataflow graph from the query plan, wherein the dataflow graph includes at least one node that represents at least one operation represented by the query plan, and includes at least one link that represents at least one dataflow associated with the query plan.
PCT/US2011/021260 2010-01-15 2011-01-14 Managing data queries WO2011088293A1 (en)

Priority Applications (9)

Application Number Priority Date Filing Date Title
KR1020127018891A KR101784785B1 (en) 2010-01-15 2011-01-14 Managing data queries
CN201180014176.7A CN102822819B (en) 2010-01-15 2011-01-14 Management data inquiry
KR1020177027578A KR101877481B1 (en) 2010-01-15 2011-01-14 Managing data queries
AU2011205787A AU2011205787B2 (en) 2010-01-15 2011-01-14 Managing data queries
EP11702533A EP2524328A1 (en) 2010-01-15 2011-01-14 Managing data queries
CA2786042A CA2786042C (en) 2010-01-15 2011-01-14 Managing data queries
JP2012549105A JP2013517574A (en) 2010-01-15 2011-01-14 Managing data queries
AU2016202098A AU2016202098B2 (en) 2010-01-15 2016-04-04 Managing data queries
AU2017202501A AU2017202501B2 (en) 2010-01-15 2017-04-18 Managing data queries

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US12/688,316 2010-01-15
US12/688,316 US9665620B2 (en) 2010-01-15 2010-01-15 Managing data queries

Publications (1)

Publication Number Publication Date
WO2011088293A1 true WO2011088293A1 (en) 2011-07-21

Family

ID=43755268

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2011/021260 WO2011088293A1 (en) 2010-01-15 2011-01-14 Managing data queries

Country Status (9)

Country Link
US (2) US9665620B2 (en)
EP (2) EP3324311A1 (en)
JP (4) JP2013517574A (en)
KR (2) KR101877481B1 (en)
CN (2) CN106055584B (en)
AU (3) AU2011205787B2 (en)
CA (1) CA2786042C (en)
HK (1) HK1255489A1 (en)
WO (1) WO2011088293A1 (en)

Families Citing this family (28)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9665620B2 (en) 2010-01-15 2017-05-30 Ab Initio Technology Llc Managing data queries
JP6338579B2 (en) * 2012-07-24 2018-06-06 アビニシオ テクノロジー エルエルシー Mapping entities in the data model
US10180821B2 (en) 2013-12-05 2019-01-15 Ab Initio Technology Llc Managing interfaces for sub-graphs
CA2929716C (en) 2013-12-06 2021-08-31 Ab Initio Technology Llc Source code translation
CN103729471B (en) * 2014-01-21 2017-03-08 华为软件技术有限公司 Data base query method and device
KR102371811B1 (en) 2014-03-14 2022-03-07 아브 이니티오 테크놀로지 엘엘시 Mapping attributes of keyed entities
US10437819B2 (en) 2014-11-14 2019-10-08 Ab Initio Technology Llc Processing queries containing a union-type operation
US10417281B2 (en) * 2015-02-18 2019-09-17 Ab Initio Technology Llc Querying a data source on a network
CN106156162A (en) * 2015-04-15 2016-11-23 阿里巴巴集团控股有限公司 Data base querying amount statistical method and equipment
US10210236B2 (en) 2015-11-23 2019-02-19 Ab Initio Technology Llc Storing and retrieving data of a data cube
US10671669B2 (en) 2015-12-21 2020-06-02 Ab Initio Technology Llc Sub-graph interface generation
WO2017223464A1 (en) 2016-06-23 2017-12-28 Schneider Electric USA, Inc. Contextual-characteristic data driven sequential federated query methods for distributed systems
CN106446170A (en) * 2016-09-27 2017-02-22 努比亚技术有限公司 Data querying method and device
US11016973B2 (en) * 2016-11-29 2021-05-25 Sap Se Query plan execution engine
KR102549994B1 (en) * 2017-03-29 2023-06-29 아브 이니티오 테크놀로지 엘엘시 Systems and methods for performing data processing operations using variable level parallelism
US11354348B2 (en) * 2017-06-29 2022-06-07 Microsoft Technology Licensing, Llc Optimized record placement in graph database
CN107480287A (en) * 2017-08-25 2017-12-15 成都优力德新能源有限公司 Data integration device based on cloud computing
CN110471888A (en) * 2018-05-09 2019-11-19 株式会社日立制作所 A kind of method, apparatus of automatic data collection, medium, equipment and system
US12032631B2 (en) 2018-05-30 2024-07-09 Ab Initio Technology Llc Systems and methods for dataflow graph optimization
US12013856B2 (en) * 2018-08-13 2024-06-18 Amazon Technologies, Inc. Burst performance of database queries according to query size
CN109299094A (en) * 2018-09-18 2019-02-01 深圳壹账通智能科技有限公司 Tables of data processing method, device, computer equipment and storage medium
CN109614400A (en) * 2018-11-30 2019-04-12 深圳前海微众银行股份有限公司 The influence and Source Tracing method, apparatus, equipment and storage medium of failed tasks
US11327970B1 (en) 2019-03-25 2022-05-10 Amazon Technologies, Inc. Context dependent execution time prediction for redirecting queries
US11308100B2 (en) 2019-06-25 2022-04-19 Amazon Technologies, Inc. Dynamically assigning queries to secondary query processing resources
US11093223B2 (en) 2019-07-18 2021-08-17 Ab Initio Technology Llc Automatically converting a program written in a procedural programming language into a dataflow graph and related systems and methods
CN110472068B (en) * 2019-08-20 2020-04-24 星环信息科技（上海）有限公司 Big data processing method, equipment and medium based on heterogeneous distributed knowledge graph
CN111143397B (en) * 2019-12-10 2021-04-13 跬云(上海)信息科技有限公司 Hybrid data query method and device and storage medium
CN111209309B (en) * 2020-01-13 2023-03-10 腾讯科技（深圳）有限公司 Method, device and equipment for determining processing result of data flow graph and storage medium

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2110761A2 (en) * 2008-04-15 2009-10-21 Sap Ag Hybrid database system using runtime reconfigurable hardware

Family Cites Families (182)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4586137A (en) 1982-10-18 1986-04-29 Dresser Industries, Inc. Method for generating variable well logging data composites
JPH01108638A (en) 1987-10-21 1989-04-25 Hitachi Ltd Parallelized compilation system
JP2738692B2 (en) 1988-01-29 1998-04-08 株式会社日立製作所 Parallel compilation method
JPH0267682A (en) 1988-09-02 1990-03-07 Hitachi Ltd Data base system
US5072371A (en) 1989-03-01 1991-12-10 The United States Of America As Represented By The United States Department Of Energy Method for simultaneous overlapped communications between neighboring processors in a multiple
US5121494A (en) 1989-10-05 1992-06-09 Ibm Corporation Joining two database relations on a common field in a parallel relational database field
US5367619A (en) 1990-04-27 1994-11-22 Eaton Corporation Electronic data entry system employing an expert system to facilitate generation of electronic data forms with complex interrelationships between fields and subforms
US5347639A (en) 1991-07-15 1994-09-13 International Business Machines Corporation Self-parallelizing computer system and method
US5632022A (en) 1991-11-13 1997-05-20 The United States Of America As Represented By The Administrator Of The National Aeronautics And Space Administration Encyclopedia of software components
US5313584A (en) 1991-11-25 1994-05-17 Unisys Corporation Multiple I/O processor system
FR2696853B1 (en) 1992-10-12 1994-12-23 Bull Sa Method for helping to optimize a request from a management system, relational database and resulting syntactic analysis method.
JPH05257709A (en) 1992-03-16 1993-10-08 Hitachi Ltd Parallelism discriminating method and parallelism supporting method using the same
US5412806A (en) 1992-08-20 1995-05-02 Hewlett-Packard Company Calibration of logical cost formulae for queries in a heterogeneous DBMS using synthetic database
US5432940A (en) 1992-11-02 1995-07-11 Borland International, Inc. System and methods for improved computer-based training
US5574898A (en) 1993-01-08 1996-11-12 Atria Software, Inc. Dynamic software version auditor which monitors a process to provide a list of objects that are accessed
US5446915A (en) 1993-05-25 1995-08-29 Intel Corporation Parallel processing system virtual connection method and apparatus with protection and flow control
US5475842A (en) 1993-08-11 1995-12-12 Xerox Corporation Method of compilation optimization using an N-dimensional template for relocated and replicated alignment of arrays in data-parallel programs for reduced data communication during execution
JPH0765032A (en) 1993-08-27 1995-03-10 Toshiba Corp Information processing system having data base language converting function
US5600833A (en) 1993-09-17 1997-02-04 Digital Equipment Corp. Attribute portion based document retrieval system with system query language interface
JP4050339B2 (en) 1994-04-28 2008-02-20 株式会社東芝 Concurrent program creation support device, parallel program creation method, and parallel program execution device
US5588150A (en) 1994-09-29 1996-12-24 International Business Machines Corporation Push down optimization in a distributed, multi-database system
US5768564A (en) 1994-10-07 1998-06-16 Tandem Computers Incorporated Method and apparatus for translating source code from one high-level computer language to another
FI98690C (en) 1994-10-18 1997-07-25 Nokia Telecommunications Oy A method for establishing an area group call in a mobile communication system and a mobile communication system
US5734886A (en) 1994-11-16 1998-03-31 Lucent Technologies Inc. Database dependency resolution method and system for identifying related data files
FI98973C (en) 1994-11-22 1997-09-10 Nokia Telecommunications Oy Procedure for maintaining group data in a mobile telephone system as well as a mobile telephone system
US5546576A (en) * 1995-02-17 1996-08-13 International Business Machines Corporation Query optimizer system that detects and prevents mutating table violations of database integrity in a query before execution plan generation
US5619692A (en) 1995-02-17 1997-04-08 International Business Machines Corporation Semantic optimization of query order requirements using order detection by normalization in a query compiler system
FI100215B (en) 1995-03-17 1997-10-15 Nokia Telecommunications Oy Updating subscriber data in a mobile communication system
US5706509A (en) 1995-04-28 1998-01-06 Intel Corporation Application independent record level synchronization
US5678044A (en) 1995-06-02 1997-10-14 Electronic Data Systems Corporation System and method for improved rehosting of software systems
US5682537A (en) 1995-08-31 1997-10-28 Unisys Corporation Object lock management system with improved local lock management and global deadlock detection in a parallel data processing system
US5712971A (en) 1995-12-11 1998-01-27 Ab Initio Software Corporation Methods and systems for reconstructing the state of a computation
US5819021A (en) 1995-12-11 1998-10-06 Ab Initio Software Corporation Overpartitioning system and method for increasing checkpoints in component-based parallel applications
US5909681A (en) 1996-03-25 1999-06-01 Torrent Systems, Inc. Computer system and computerized method for partitioning data for parallel processing
US6311265B1 (en) 1996-03-25 2001-10-30 Torrent Systems, Inc. Apparatuses and methods for programming parallel computers
JPH09319757A (en) 1996-05-29 1997-12-12 N T T Data Tsushin Kk Information retrieving system
US5799149A (en) 1996-06-17 1998-08-25 International Business Machines Corporation System partitioning for massively parallel processors
US5870743A (en) 1996-06-24 1999-02-09 Oracle Corporation Method and apparatus for parallelizing operations that create a table
US5966072A (en) 1996-07-02 1999-10-12 Ab Initio Software Corporation Executing computations expressed as graphs
JP4533974B2 (en) 1996-08-01 2010-09-01 康 清木 Heterogeneous database integration system
JPH1091494A (en) 1996-09-19 1998-04-10 Hitachi Ltd Method and device for converting data base operation program
JPH10232875A (en) 1997-02-19 1998-09-02 Hitachi Ltd Data base managing method and parallel data base managing system
US6330008B1 (en) 1997-02-24 2001-12-11 Torrent Systems, Inc. Apparatuses and methods for monitoring performance of parallel computing
US5999729A (en) 1997-03-06 1999-12-07 Continuum Software, Inc. System and method for developing computer programs for execution on parallel processing systems
US5956074A (en) 1997-03-11 1999-09-21 Sclafani; Peter J. Cable television return display unit
JP3155991B2 (en) 1997-04-09 2001-04-16 日本アイ・ビー・エム株式会社 Aggregate operation execution method and computer system
US5956704A (en) * 1997-06-05 1999-09-21 Oracle Corporation Method and apparatus for parallelizing operations that insert data into an existing data container
US6092062A (en) * 1997-06-30 2000-07-18 International Business Machines Corporation Relational database query optimization to perform query evaluation plan, pruning based on the partition properties
US6077313A (en) 1997-10-22 2000-06-20 Microsoft Corporation Type partitioned dataflow analyses
US6295518B1 (en) 1997-12-09 2001-09-25 Mci Communications Corporation System and method for emulating telecommunications network devices
US6266804B1 (en) 1997-12-23 2001-07-24 Ab Initio Software Corporation Method for analyzing capacity of parallel processing systems
US6625593B1 (en) * 1998-06-29 2003-09-23 International Business Machines Corporation Parallel query optimization strategies for replicated and partitioned tables
US6205465B1 (en) 1998-07-22 2001-03-20 Cisco Technology, Inc. Component extensible parallel execution of multiple threads assembled from program components specified with partial inter-component sequence information
US6453464B1 (en) 1998-09-03 2002-09-17 Legacyj. Corp., Inc. Method and apparatus for converting COBOL to Java
US6339769B1 (en) 1998-09-14 2002-01-15 International Business Machines Corporation Query optimization by transparently altering properties of relational tables using materialized views
US6378126B2 (en) 1998-09-29 2002-04-23 International Business Machines Corporation Compilation of embedded language statements in a source code program
IL140805A0 (en) * 1998-10-02 2002-02-10 Ibm Structure skeletons for efficient voice navigation through generic hierarchical objects
JP2000148699A (en) 1998-11-06 2000-05-30 Nec Corp Network management system
JP4406944B2 (en) * 1998-11-11 2010-02-03 株式会社日立製作所 Computer system and distributed processing system for queries
US7047232B1 (en) 1999-01-13 2006-05-16 Ab Initio Software Corporation Parallelizing applications of script-driven tools
JP4794709B2 (en) * 1999-03-01 2011-10-19 新日鉄ソリューションズ株式会社 Data management system and computer-readable recording medium
US7080062B1 (en) * 1999-05-18 2006-07-18 International Business Machines Corporation Optimizing database queries using query execution plans derived from automatic summary table determining cost based queries
US6560593B1 (en) 1999-07-20 2003-05-06 Computer Associates Think, Inc. Method and apparatus for viewing the effect of changes to an index for a database table on an optimization plan for a database query
JP4552242B2 (en) 1999-10-06 2010-09-29 株式会社日立製作所 Virtual table interface and query processing system and method using the interface
US6615203B1 (en) 1999-12-17 2003-09-02 International Business Machines Corporation Method, computer program product, and system for pushdown analysis during query plan generation
JP3795289B2 (en) 2000-02-07 2006-07-12 日本電信電話株式会社 Database execution control unit
US6947934B1 (en) * 2000-02-16 2005-09-20 International Business Machines Corporation Aggregate predicates and search in a database management system
JP4483034B2 (en) 2000-06-06 2010-06-16 株式会社日立製作所 Heterogeneous data source integrated access method
US7164422B1 (en) 2000-07-28 2007-01-16 Ab Initio Software Corporation Parameterized graphs with conditional components
US6785668B1 (en) 2000-11-28 2004-08-31 Sas Institute Inc. System and method for data flow analysis of complex data filters
JP4543563B2 (en) * 2001-02-28 2010-09-15 株式会社日立製作所 Query optimization method in integrated database system
US7418441B2 (en) 2001-02-28 2008-08-26 International Business Machines Corporation Data loading from a remote data source record by record
US8412746B2 (en) 2001-05-25 2013-04-02 International Business Machines Corporation Method and system for federated querying of data sources
US6877000B2 (en) 2001-08-22 2005-04-05 International Business Machines Corporation Tool for converting SQL queries into portable ODBC
US6725212B2 (en) * 2001-08-31 2004-04-20 International Business Machines Corporation Platform-independent method and system for graphically presenting the evaluation of a query in a database management system
JP2003099441A (en) 2001-09-21 2003-04-04 Hitachi Ltd Data retrieving procedure searching method
US6915290B2 (en) 2001-12-11 2005-07-05 International Business Machines Corporation Database query optimization apparatus and method that represents queries as graphs
US7409474B2 (en) 2002-06-27 2008-08-05 Broadcom Corporation Method and system for rate adaptation
US7167850B2 (en) 2002-10-10 2007-01-23 Ab Initio Software Corporation Startup and control of graph-based computation
US7953891B2 (en) * 2003-03-18 2011-05-31 Microsoft Corporation Systems and methods for scheduling data flow execution based on an arbitrary graph describing the desired data flow
CA2429910A1 (en) 2003-05-27 2004-11-27 Cognos Incorporated System and method of query transformation
US7249120B2 (en) * 2003-06-27 2007-07-24 Microsoft Corporation Method and apparatus for selecting candidate statistics to estimate the selectivity value of the conditional selectivity expression in optimize queries based on a set of predicates that each reference a set of relational database tables
US20050038788A1 (en) 2003-08-14 2005-02-17 International Business Machines Corporation Annotation security to prevent the divulgence of sensitive information
US20050177557A1 (en) * 2003-09-06 2005-08-11 Oracle International Corporation Automatic prevention of run-away query execution
WO2005028627A2 (en) * 2003-09-19 2005-03-31 Netezza Corporation Performing sequence analysis as a relational join
US7165063B2 (en) * 2003-11-19 2007-01-16 International Business Machines Corporation Context quantifier transformation in XML query rewrite
US7133861B2 (en) * 2003-12-04 2006-11-07 International Business Machines Corporation Query access plan rebuilds
US7310637B2 (en) 2004-05-05 2007-12-18 International Business Machines Corporation Dynamic database access via standard query language and abstraction technology
US7930432B2 (en) * 2004-05-24 2011-04-19 Microsoft Corporation Systems and methods for distributing a workplan for data flow execution based on an arbitrary graph describing the desired data flow
US20060047696A1 (en) 2004-08-24 2006-03-02 Microsoft Corporation Partially materialized views
CN100518079C (en) 2004-09-30 2009-07-22 北京航空航天大学 Distributed performance data acquisition method
US7899833B2 (en) 2004-11-02 2011-03-01 Ab Initio Technology Llc Managing related data objects
US7461052B2 (en) 2004-12-06 2008-12-02 International Business Machines Corporation Abstract query plan
US7890532B2 (en) 2004-12-15 2011-02-15 Microsoft Corporation Complex data access
US7359922B2 (en) * 2004-12-22 2008-04-15 Ianywhere Solutions, Inc. Database system and methodology for generalized order optimization
US20060265362A1 (en) 2005-05-18 2006-11-23 Content Analyst Company, Llc Federated queries and combined text and relational data
US7856523B2 (en) 2005-06-01 2010-12-21 Microsoft Corporation Random Access Memory (RAM) based Content Addressable Memory (CAM) management
US8935273B2 (en) 2005-06-23 2015-01-13 International Business Machines Corporation Method of processing and decomposing a multidimensional query against a relational data source
CA2519604C (en) 2005-06-23 2011-07-12 Cognos Incorporated Master-detail provider and method of providing master-detail functionality
US7716630B2 (en) 2005-06-27 2010-05-11 Ab Initio Technology Llc Managing parameters for graph-based computations
US7584205B2 (en) * 2005-06-27 2009-09-01 Ab Initio Technology Llc Aggregating data with complex operations
US7877350B2 (en) 2005-06-27 2011-01-25 Ab Initio Technology Llc Managing metadata for graph-based computations
WO2007006143A1 (en) 2005-07-13 2007-01-18 The Hospital For Sick Children Compositions and methods for detecting transformed cells
CA2519001A1 (en) 2005-09-13 2007-03-13 Cognos Incorporated System and method of data agnostic business intelligence query
CA2519010A1 (en) 2005-09-13 2007-03-13 Cognos Incorporated Query framework system and method
US20070067274A1 (en) 2005-09-16 2007-03-22 International Business Machines Corporation Hybrid push-down/pull-up of unions with expensive operations in a federated query processor
US7464084B2 (en) 2006-01-30 2008-12-09 International Business Machines Corporation Method for performing an inexact query transformation in a heterogeneous environment
US7945562B2 (en) 2006-03-15 2011-05-17 Oracle International Corporation Join predicate push-down optimizations
US7870556B2 (en) 2006-05-16 2011-01-11 Ab Initio Technology Llc Managing computing resources in graph-based computations
US8341112B2 (en) * 2006-05-19 2012-12-25 Microsoft Corporation Annotation by search
DE502006007802D1 (en) * 2006-06-01 2010-10-14 Mediareif Moestl & Reif Kommun METHOD FOR CONTROLLING A RELATIONAL DATABASE SYSTEM
AU2007286155B2 (en) 2006-08-10 2013-12-12 Ab Initio Technology Llc. Distributing services in graph-based computations
JP4872529B2 (en) 2006-08-22 2012-02-08 株式会社日立製作所 Reverse engineering support method
US7979453B2 (en) 2006-08-23 2011-07-12 Innovative Solutions, Inc. Efficient search result update mechanism
TWI348139B (en) 2006-08-24 2011-09-01 Wintek Corp A lcd scan lines driving method
JP2008084028A (en) 2006-09-27 2008-04-10 Toshiba Corp Database retrieval system and database retrieving method
JP2008158664A (en) 2006-12-21 2008-07-10 Sony Corp Communication system, server, communication terminal and communication method
US8069129B2 (en) 2007-04-10 2011-11-29 Ab Initio Technology Llc Editing and compiling business rules
US8122088B2 (en) 2007-06-28 2012-02-21 International Business Machines Corporation Adding personal note capabilities to text exchange clients
EP2026479A1 (en) 2007-08-17 2009-02-18 Leica Geosystems AG Transimpedance amplifier switch for a photo detector
US9424315B2 (en) 2007-08-27 2016-08-23 Teradata Us, Inc. Methods and systems for run-time scheduling database operations that are executed in hardware
US20100005077A1 (en) * 2008-07-07 2010-01-07 Kickfire, Inc. Methods and systems for generating query plans that are compatible for execution in hardware
JP5453273B2 (en) 2007-09-20 2014-03-26 アビニシオ テクノロジー エルエルシー Data flow management in graph-based calculations
US7673065B2 (en) 2007-10-20 2010-03-02 Oracle International Corporation Support for sharing computation between aggregations in a data stream management system
US8527976B2 (en) 2007-11-14 2013-09-03 Nec Laboratories America, Inc. System and method for generating error traces for concurrency bugs
CN101436192B (en) 2007-11-16 2011-03-16 国际商业机器公司 Method and apparatus for optimizing inquiry aiming at vertical storage type database
US9165032B2 (en) 2007-11-21 2015-10-20 Hewlett-Packard Development Company, L.P. Allocation of resources for concurrent query execution via adaptive segmentation
US8429601B2 (en) * 2007-11-29 2013-04-23 Red Hat, Inc. Code completion for object relational mapping query language (OQL) queries
US20090198703A1 (en) 2008-01-31 2009-08-06 Hewlett-Packard Development Company, L.P. Intelligent data storage system
KR101517460B1 (en) 2008-02-26 2015-05-15 아브 이니티오 테크놀로지 엘엘시 Graphic representations of data relationships
US7933916B2 (en) * 2008-02-28 2011-04-26 Microsoft Corporation Querying nonSQL data stores with a SQL-style language
US8537160B2 (en) * 2008-03-05 2013-09-17 Microsoft Corporation Generating distributed dataflow graphs
JP2009217405A (en) 2008-03-07 2009-09-24 Nec Corp System and program for automatically creating job network
US8538985B2 (en) 2008-03-11 2013-09-17 International Business Machines Corporation Efficient processing of queries in federated database systems
US20100295833A1 (en) 2008-04-11 2010-11-25 Masaaki Nishio Display device and method of driving display device
JP5349581B2 (en) 2008-04-16 2013-11-20 インターナショナル・ビジネス・マシーンズ・コーポレーション Query processing visualizing system, method for visualizing query processing, and computer program
US20100057695A1 (en) * 2008-08-28 2010-03-04 Microsoft Corporation Post-processing search results on a client computer
US7917463B2 (en) 2008-10-10 2011-03-29 Business.Com, Inc. System and method for data warehousing and analytics on a distributed file system
US7962500B2 (en) * 2008-10-24 2011-06-14 Yahoo! Inc. Digital image retrieval by aggregating search results based on visual annotations
US20100121868A1 (en) 2008-11-07 2010-05-13 Yann Le Biannic Converting a database query to a multi-dimensional expression query
US8489622B2 (en) * 2008-12-12 2013-07-16 Sas Institute Inc. Computer-implemented systems and methods for providing paginated search results from a database
US9218209B2 (en) 2008-12-31 2015-12-22 Pivotal Software, Inc. Apparatus and method for parallel processing of a query
US8666966B2 (en) 2009-01-30 2014-03-04 Hewlett-Packard Development Company, L.P. Providing parallel result streams for database queries
JP4659888B2 (en) 2009-02-13 2011-03-30 株式会社日立製作所 Database processing system, computer and database processing method
CN105843684B (en) 2009-02-13 2020-03-03 起元技术有限责任公司 Managing task execution
US20100241893A1 (en) 2009-03-18 2010-09-23 Eric Friedman Interpretation and execution of a customizable database request using an extensible computer process and an available computing environment
US8392398B2 (en) * 2009-07-29 2013-03-05 International Business Machines Corporation Query optimization over graph data streams
US9477778B2 (en) 2009-08-21 2016-10-25 Oracle International Corporation XML query optimization with order analysis of XML schema
US9064047B2 (en) 2009-09-24 2015-06-23 International Business Machines Corporation Parallel processing of ETL jobs involving extensible markup language documents
US8620903B2 (en) 2009-11-04 2013-12-31 Nec Laboratories America, Inc. Database distribution system and methods for scale-out applications
US8326797B2 (en) 2009-11-11 2012-12-04 International Business Machines Corporation Supporting set-level slice and dice in data warehouses
US8688683B2 (en) 2009-11-30 2014-04-01 Business Objects Software Ltd. Query plan reformulation
KR101302563B1 (en) * 2009-12-15 2013-09-02 한국전자통신연구원 System and method for constructing named entity dictionary
US9665620B2 (en) 2010-01-15 2017-05-30 Ab Initio Technology Llc Managing data queries
US8204903B2 (en) 2010-02-16 2012-06-19 Microsoft Corporation Expressing and executing semantic queries within a relational database
US9286370B2 (en) 2010-02-24 2016-03-15 International Business Machines Corporation Viewing a dimensional cube as a virtual data source
US8555265B2 (en) 2010-05-04 2013-10-08 Google Inc. Parallel processing of data
US9495427B2 (en) 2010-06-04 2016-11-15 Yale University Processing of data using a database system in communication with a data processing framework
CN107066241B (en) 2010-06-15 2021-03-09 起元技术有限责任公司 System and method for dynamically loading graph-based computations
KR101009924B1 (en) * 2010-06-25 2011-01-20 한국과학기술정보연구원 Named entity database or mining rule database update apparatus and method using named entity database and mining rule merged ontology schema
JP5536568B2 (en) 2010-07-01 2014-07-02 インターナショナル・ビジネス・マシーンズ・コーポレーション Method, system, and program for aggregating and processing transactions
JP5199317B2 (en) 2010-08-25 2013-05-15 株式会社日立製作所 Database processing method, database processing system, and database server
US8326821B2 (en) 2010-08-25 2012-12-04 International Business Machines Corporation Transforming relational queries into stream processing
US9128983B2 (en) 2010-10-13 2015-09-08 Aol Inc. Systems and methods for query optimization
US8850574B1 (en) 2011-02-28 2014-09-30 Google Inc. Safe self-modifying code
US20120246158A1 (en) 2011-03-25 2012-09-27 Microsoft Corporation Co-range partition for query plan optimization and data-parallel programming model
US9116955B2 (en) 2011-05-02 2015-08-25 Ab Initio Technology Llc Managing data queries
US8782081B2 (en) 2011-05-11 2014-07-15 Google Inc. Query template definition and transformation
US8898145B2 (en) 2011-06-15 2014-11-25 Microsoft Corporation Query optimization techniques for business intelligence systems
US8635206B2 (en) 2011-06-30 2014-01-21 International Business Machines Corporation Database query optimization
US9449030B2 (en) 2011-06-30 2016-09-20 International Business Machines Corporation Method for native program to inherit same transaction content when invoked by primary program running in separate environment
JP5357286B2 (en) 2011-09-21 2013-12-04 前田建設工業株式会社 Information processing apparatus, information processing method, and program
US9177022B2 (en) 2011-11-02 2015-11-03 Microsoft Technology Licensing, Llc User pipeline configuration for rule-based query transformation, generation and result display
KR101255957B1 (en) * 2011-12-09 2013-04-24 포항공과대학교 산학협력단 Method and apparatus for tagging named entity
US9317551B1 (en) 2012-03-23 2016-04-19 The Mathworks, Inc. Transforming a search query into a format understood by a technical computing environment (TCE)-based search engine
JP5835084B2 (en) 2012-05-02 2015-12-24 富士通株式会社 Query integration method, query integration program, and integrated component generation device
US9182957B2 (en) 2012-07-10 2015-11-10 Loring Craymer Method and system for automated improvement of parallelism in program compilation
JP6338579B2 (en) 2012-07-24 2018-06-06 アビニシオ テクノロジー エルエルシー Mapping entities in the data model
US9342557B2 (en) 2013-03-13 2016-05-17 Cloudera, Inc. Low latency query engine for Apache Hadoop
US9135301B2 (en) 2013-03-14 2015-09-15 Oracle International Corporation Pushdown of sorting and set operations (union, intersection, minus) to a large number of low-power cores in a heterogeneous system
US9633104B2 (en) 2013-05-03 2017-04-25 Sas Institute Inc. Methods and systems to operate on group-by sets with high cardinality
US10417281B2 (en) 2015-02-18 2019-09-17 Ab Initio Technology Llc Querying a data source on a network

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2110761A2 (en) * 2008-04-15 2009-10-21 Sap Ag Hybrid database system using runtime reconfigurable hardware

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
JOSIFOVSKI V ET AL: "Optimizing queries in distributed and composable mediators", 2 September 1999, COOPERATIVE INFORMATION SYSTEMS, 1999. COOPIS '99. PROCEEDINGS. 1999 I FCIS INTERNATIONAL CONFERENCE ON EDINBURGH, UK 2-4 SEPT. 1999, LOS ALAMITOS, CA, USA,IEEE COMPUT. SOC, US, PAGE(S) 291 - 302, ISBN: 978-0-7695-0384-4, XP010351857 *
PANAYIOTIS ADAMOS MICHAEL ET AL: "Architectural Principles of the Streamonas Data Stream Management System and Performance Evaluation Based on the Linear Road Benchmark", COMPUTER SCIENCE AND SOFTWARE ENGINEERING, 2008 INTERNATIONAL CONFERENCE ON, IEEE, PISCATAWAY, NJ, USA, 12 December 2008 (2008-12-12), pages 643 - 646, XP031377814, ISBN: 978-0-7695-3336-0 *
See also references of EP2524328A1 *
SESHADRI S ET AL: "Optimizing Multiple Queries in Distributed Data Stream Systems", DATA ENGINEERING WORKSHOPS, 2006. PROCEEDINGS. 22ND INTERNATIONAL CONF ERENCE ON ATLANTA, GA, USA 03-07 APRIL 2006, PISCATAWAY, NJ, USA,IEEE, 3 April 2006 (2006-04-03), pages 25 - 25, XP010911920, ISBN: 978-0-7695-2571-6, DOI: DOI:10.1109/ICDEW.2006.107 *

Also Published As

Publication number Publication date
KR20170121272A (en) 2017-11-01
JP2017016677A (en) 2017-01-19
AU2016202098B2 (en) 2017-02-23
AU2016202098A1 (en) 2016-04-28
EP3324311A1 (en) 2018-05-23
US20110179014A1 (en) 2011-07-21
JP2017220268A (en) 2017-12-14
KR101877481B1 (en) 2018-07-11
JP6216423B2 (en) 2017-10-18
US20170228426A1 (en) 2017-08-10
CA2786042A1 (en) 2011-07-21
AU2011205787B2 (en) 2016-02-18
CA2786042C (en) 2019-03-19
JP2015212968A (en) 2015-11-26
CN106055584B (en) 2019-07-16
JP6000415B2 (en) 2016-09-28
CN102822819B (en) 2016-05-11
AU2017202501B2 (en) 2018-11-22
KR101784785B1 (en) 2017-10-12
JP2013517574A (en) 2013-05-16
EP2524328A1 (en) 2012-11-21
US11593369B2 (en) 2023-02-28
CN102822819A (en) 2012-12-12
AU2017202501A1 (en) 2017-05-04
CN106055584A (en) 2016-10-26
KR20120106827A (en) 2012-09-26
JP6578333B2 (en) 2019-09-18
US9665620B2 (en) 2017-05-30
AU2011205787A1 (en) 2012-07-12
HK1255489A1 (en) 2019-08-16

Similar Documents

Publication Publication Date Title
AU2017202501B2 (en) Managing data queries
US10521427B2 (en) Managing data queries
AU2017202899B2 (en) Managing data queries

Legal Events

Date Code Title Description
WWE Wipo information: entry into national phase

Ref document number: 201180014176.7

Country of ref document: CN

121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 11702533

Country of ref document: EP

Kind code of ref document: A1

DPE1 Request for preliminary examination filed after expiration of 19th month from priority date (pct application filed from 20040101)
WWE Wipo information: entry into national phase

Ref document number: 2011205787

Country of ref document: AU

WWE Wipo information: entry into national phase

Ref document number: 2012549105

Country of ref document: JP

ENP Entry into the national phase

Ref document number: 2786042

Country of ref document: CA

WWE Wipo information: entry into national phase

Ref document number: 5918/CHENP/2012

Country of ref document: IN

ENP Entry into the national phase

Ref document number: 2011205787

Country of ref document: AU

Date of ref document: 20110114

Kind code of ref document: A

WWE Wipo information: entry into national phase

Ref document number: 2011702533

Country of ref document: EP

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 20127018891

Country of ref document: KR

Kind code of ref document: A