WO2000020998A1 - Analytic logical data model - Google Patents
Analytic logical data model Download PDFInfo
- Publication number
- WO2000020998A1 WO2000020998A1 PCT/US1999/023019 US9923019W WO0020998A1 WO 2000020998 A1 WO2000020998 A1 WO 2000020998A1 US 9923019 W US9923019 W US 9923019W WO 0020998 A1 WO0020998 A1 WO 0020998A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- data
- analytic
- column
- functions
- relational database
- Prior art date
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/2458—Special types of queries, e.g. statistical queries, fuzzy queries or distributed queries
- G06F16/2462—Approximate or statistical 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
- G06F16/24532—Query optimisation of parallel 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/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/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F16/33—Querying
- G06F16/3331—Query processing
- G06F16/334—Query execution
- G06F16/3346—Query execution using probabilistic model
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2216/00—Indexing scheme relating to additional aspects of information retrieval not explicitly covered by G06F16/00 and subgroups
- G06F2216/03—Data mining
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S707/00—Data processing: database and file management or data structures
- Y10S707/953—Organization of data
- Y10S707/954—Relational
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S707/00—Data processing: database and file management or data structures
- Y10S707/953—Organization of data
- Y10S707/961—Associative
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S707/00—Data processing: database and file management or data structures
- Y10S707/99931—Database or file accessing
- Y10S707/99932—Access augmentation or optimizing
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S707/00—Data processing: database and file management or data structures
- Y10S707/99931—Database or file accessing
- Y10S707/99933—Query processing, i.e. searching
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S707/00—Data processing: database and file management or data structures
- Y10S707/99931—Database or file accessing
- Y10S707/99933—Query processing, i.e. searching
- Y10S707/99934—Query formulation, input preparation, or translation
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S707/00—Data processing: database and file management or data structures
- Y10S707/99931—Database or file accessing
- Y10S707/99933—Query processing, i.e. searching
- Y10S707/99936—Pattern matching access
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S707/00—Data processing: database and file management or data structures
- Y10S707/99941—Database schema or data structure
- Y10S707/99942—Manipulating data structure, e.g. compression, compaction, compilation
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S707/00—Data processing: database and file management or data structures
- Y10S707/99941—Database schema or data structure
- Y10S707/99943—Generating database or data structure, e.g. via user interface
Definitions
- This invention relates in general to a relational database management system, and in particular, to an analytic logical data model used for data mining applications in a relational database management system.
- Relational databases are the predominate form of database management systems used in computer systems. Relational database management systems are often used in so-called "data warehouse” applications where enormous amounts of data are stored and processed. In recent years, several trends have converged to create a new class of data warehousing applications known as data mining applications. Data mining is the process of identifying and interpreting patterns in databases, and can be generalized into three stages. Stage one is the reporting stage, which analyzes the data to determine what happened. Generally, most data warehouse implementations start with a focused application in a specific functional area of the business. These applications usually focus on reporting historical snap shots of business information that was previously difficult or impossible to access. Examples include Sales Revenue Reporting, Production Reporting and Inventory Reporting to name a few.
- Stage two is the analyzing stage, which analyzes the data to determine why it happened. As stage one end-users gain previously unseen views of their business, they quickly seek to understand why certain events occurred; for example a decline in sales revenue. After discovering a reported decline in sales, data warehouse users will then obviously ask, "Why did sales go down?" Learning the answer to this question typically involves probing the database through an iterative series of ad hoc or multidimensional queries until the root cause of the condition is discovered. Examples include Sales Analysis, Inventory Analysis or Production Analysis. Stage three is the predicting stage, which tries to determine what will happen. As stage two users become more sophisticated, they begin to extend their analysis to include prediction of unknown events.
- the present invention discloses a method, apparatus, and article of manufacture for performing data mining applications in a massively parallel relational database management system (RDBMS).
- RDBMS massively parallel relational database management system
- An analytic logical data model (LDM) provides logical entity and attribute definitions for advanced analytic processing performed by the relational database management system directly against the relational database.
- An object of the present invention is to provide more efficient usage of parallel processor computer systems.
- An object of the present invention is to provide a foundation for data mining tool sets in relational database management systems. Further, an object of the present invention is to allow data mining of large databases.
- FIG. 1 is a block diagram that illustrates an exemplary computer hardware environment that could be used with the preferred embodiment of the present invention
- FIG. 2 is a block diagram that illustrates an exemplary logical architecture that could be used with the preferred embodiment of the present invention
- FIGS. 3, 4 and 5 are flowcharts that illustrate exemplary logic performed according to the preferred embodiment of the present invention.
- the present invention provides a relational database management system (RDBMS) that supports data mining operations of relational databases.
- RDBMS relational database management system
- advanced analytic processing capabilities for data mining applications are placed where they belong, i.e., close to the data.
- the results of these analytic processing capabilities can be made to persist within the database or can be exported from the database.
- API application programmable interface
- the data mining process is an iterative approach referred to as a "Knowledge Discovery Analytic Process" (KDAP).
- KDAP Knowledge Discovery Analytic Process
- the present invention provides various components for addressing these tasks:
- API Application Programming Interface
- CLI Call Level Interface
- a Data Reduction Utility Program comprised of SQL statements and programmatic iteration.
- LDM analytical logical data model
- a parallel deployer that controls parallel execution of the results of the analytic algorithms that are stored in the analytic logical data model.
- the benefits of the present invention include:
- FIG. 1 is a block diagram that illustrates an exemplary computer hardware environment that could be used with the preferred embodiment of the present invention.
- a massively parallel processing (MPP) computer system 100 is comprised of one or more processors or nodes 102 interconnected by a network 104.
- Each of the nodes 102 is comprised of one or more processors, random access memory (RAM), read-only memory (ROM), and other components.
- RAM random access memory
- ROM read-only memory
- attached to the nodes 102 may be one or more fixed and/or removable data storage units (DSUs) 106 and one or more data communications units (DCUs) 108, as is well known in the art.
- DSUs fixed and/or removable data storage units
- DCUs data communications units
- Each of the nodes 102 executes one or more computer programs, such as a Data Mining Application (APPL) 110 performing data mining operations, Advanced Analytic Processing Components (AAPC) 112 for providing advanced analytic processing capabilities for the data mining operations, and/or a Relational Database Management System (RDBMS) 114 for managing a relational database 116 stored on one or more of the DSUs 106 for use in the data mining applications, wherein various operations are performed in the APPL 110, AAPC 112, and/or RDBMS 114 in response to commands from one or more Clients 118.
- the APPL 110 may be executed in one or more of the Clients 118, or on an application server on a different platform attached to the network 104.
- the computer programs are tangibly embodied in and/or retrieved from RAM, ROM, one or more of the DSUs 106, and/or a remote device coupled to the computer system 100 via one or more of the DCUs 108.
- the computer programs comprise instructions which, when read and executed by a node 102, causes the node 102 to perform the steps necessary to execute the steps or elements of the present invention.
- FIG. 1 is not intended to limit the present invention. Indeed, those skilled in the art will recognize that other alternative hardware environments may be used without departing from the scope of the present invention. In addition, it should be understood that the present invention may also apply to other computer programs than those disclosed herein.
- FIG. 2 is a block diagram that illustrates an exemplary logical architecture of the AAPC 112, and its interaction with the APPL 110, RDBMS 114, relational database 116, and Client 118, according to the preferred embodiment of the present invention.
- the AAPC 112 includes the following components:
- Scalable Data Mining Functions 202 that comprise complex, optimized SQL statements that perform advanced analytic processing in the RDBMS 114,
- API Analytic Application Programming Interface
- Analytic Algorithms 206 comprise:
- a Call Level Interface (CLI) 210 that can be used when a combination of SQL and programmatic iteration is required to implement a certain class of Analytic Algorithms 206, and
- a Data Reduction Utility Program 212 that can be used to implement a certain class of Analytic Algorithms 206 where data is first reduced using SQL followed by programmatic iteration.
- An Analytic Algorithm Application Programming Interface (API) 214 that provides a mechanism for an APPL 110 or other components to invoke the Analytic Algorithms 206,
- a Parallel Deployer 216 that controls parallel executions of the results of an Analytic Algorithm 206 (sometimes referred to as an analytic model) that are stored in the Analytic LDM 200, wherein the results of executing the Parallel Deployer 216 are stored in the RDBMS 114. Note that the use of these various components is optional, and thus only some of the components may be used in any particular configuration.
- the preferred embodiment is oriented towards a multi-tier logical architecture, in which a Client 118 interacts with the various components described above, which, in turn, interface to the RDBMS 114 to utilize a large central repository of enterprise data stored in the relational database 116 for analytic processing.
- a Client 118 interacts with an APPL 110, which interfaces to the Analytic API 204 to invoke one or more of the Scalable Data Mining Functions 202, which are executed by the RDBMS 114.
- the results from the execution of the Scalable Data Mining Functions 202 would be stored in an Analytic LDM 200 in the RDBMS 114.
- a Client 118 interacts with one or more Analytic Algorithms 206 either directly or via the Analytic Algorithm API 214.
- the Analytic Algorithms 206 comprise SQL statements that may or may not include programmatic iteration, and the SQL statements are executed by the RDBMS 114.
- the Analytic Algorithms 206 may or may not interface to the Analytic API 204 to invoke one or more of the Scalable Data Mining Functions 202, which are executed by the RDBMS 114. Regardless, the results from the execution of the Analytic Algorithms 206 would be stored as an analytic model within the Analytic LDM 200 in the RDBMS 114.
- a Client 118 interacts with the Parallel Deployer
- Analytic Model which invokes parallel instances of the results of the Analytic Algorithms 206, sometimes referred to as an Analytic Model.
- the Analytic Model is stored in the Analytic LDM 200 as a result of executing an instance of the Analytic Algorithms 206.
- the results of executing the Parallel Deployer 216 are stored in the RDBMS 114.
- a Client 118 interacts with the APPL 110, which invokes one or more Analytic Algorithms 206 either directly or via the Analytic Algorithm API 214.
- the results would be stored in an analytic model within the Analytic LDM 200 in the RDBMS 114.
- the overall goal is to significantly improve the performance, efficiency, and scalability of data mining operations by performing compute and/or I/O intensive operations in the various components.
- the preferred embodiment achieves this not only through the parallelism provided by the MPP computer system 100, but also from reducing the amount of data that flows between the APPL 110, AAPC 112, RDBMS 114, Client 118, and other components.
- Scalable Data Mining Functions 202 comprise complex, optimized SQL statements that are created, in the preferred embodiment, by parameterizing and instantiating the corresponding Analytic APIs 204.
- the Scalable Data Mining Functions 202 perform much of the advanced analytic processing for data mining applications, when performed by the RDBMS 114, without having to move data from the relational database 116.
- the Scalable Data Mining Functions 202 can be categorized by the following functions:
- Data Description The ability to understand and describe the available data using statistical techniques. For example, the generation of descriptive statistics, frequencies and/or histogram bins.
- Data Derivation The ability to generate new variables (transformations) based upon existing detailed data when designing an analytic model. For example, the generation of predictive variables such as bitmaps, ranges, codes and mathematical functions.
- Data Reduction The ability to reduce the number of variables (columns) or observations (rows) used when designing an analytic model. For example, creating Covariance, Correlation, or Sum of Squares and Cross-Products (SSCP) Matrices.
- Data Reorganization The ability to join or denormalize pre- processed results into a wide analytic data set.
- Data Sampling/Partitioning The ability to intelligently request different data samples or data partitions. For example, hash data partitioning or data sampling.
- the principal theme of the Scalable Data Mining Functions 202 is to facilitate analytic operations within the RDBMS 114, which process data collections stored in the database 116 and produce results that also are stored in the database 116. Since data mining operations tend to be iterative and exploratory, the database 116 in the preferred embodiment comprises a combined storage and work space environment. As such, a sequence of data mining operations is viewed as a set of steps that start with some collection of tables in the database 116, generate a series of intermediate work tables, and finally produce a result table or view.
- This category of functions provides a variety of descriptive statistical functions, giving the analyst an intimate knowledge of the data to be mined. Such descriptive statistical analysis is valuable for several reasons. First, it can provide business insight in its own right. Second, it uncovers data quality issues, which, if not corrected or compensated for, would jeopardize the accuracy of any analytic models that are based on the data. Next, it isolates the data that should be used in building analytic models. Further, some statistical processes used in analytic modeling require a certain type of distribution of data. Descriptive statistical analysis can determine the suitability of various data elements for model input and can suggest which transformations may be required for these data elements. The Data Description components are shown in the following Table:
- This category of functions provides a variety of column derivations or transformations that are useful prior to designing the analytic model. Sometimes these derivations are required by the analytical modeling method to be used (for example, some methods may require categorical input, while other methods may require numeric input). Even when these derivations are not required by the analytical modeling method, the results of analytical modeling are greatly affected by the measures that can be derived to characterize some type of behavior or quality. This is one of the areas of data mining requiring the most trial and error, and reliance on past experience. Substantial timesaving can be gained by automating the derivation process, and insights from past experiences can be reused by saving and reapplying prior derivation techniques.
- the Data Derivation functions are shown in the following Table:
- This category of functions provides utility-based matrix building operations to reduce the amount of data required for analytic algorithms. Numeric columns in potentially huge relational tables are reduced to a comparatively compact matrix (n- by-n if there are n-columns), which is delivered to the APPL 110, Client 118, or some other program for further analysis.
- the Data Reduction functions are shown in the following Table:
- the functions in this category provide the ability to reorganize data by joining and/or denormalizing pre-processed results into a wide analytic data set.
- the result of these functions is a newly restructured table that has been constructed from one or more existing tables.
- the functions in this category provide the ability to construct a new table containing a randomly selected subset of the rows in an existing table or view.
- sampling is often necessary to create multiple data sets used for training, testing, and validation. Sampling can also be useful during simple trial periods when it would otherwise be unwieldy to perform an analytic process because of the volume of data available. This is especially true for compute intensive analytic modeling tasks, such as neural network modeling.
- analytic tasks which can be classified as descriptive in nature, are ideally performed prior to sampling, and may in fact suggest data constraints that should be used before sampling.
- Partitioning is similar to sampling but allows mutually distinct but all- inclusive subsets of data to be requested by separate processes. For example, a table can be partitioned into three distinct pieces.
- the Analytic Algorithms 206 provide statistical and/or "machine learning" methods to create analytic models within the Analytic LDM 200 from the data residing in the relational database 116.
- Analytic Algorithms 206 that are completely data driven, such as association can be implemented solely in Extended ANSI SQL 208.
- Analytic Algorithms 206 that require a combination of SQL and programmatic iteration, such as induction can be implemented using the CLI 210.
- Analytic Algorithms 206 that require almost complete programmatic iteration, such as clustering can be implemented using a Data Reduction Utility Program 212. This approach involves data pre-processing that reduces the amount of data that a non-SQL algorithm can then process.
- the Analytic Algorithms 206 significantly improve the performance and efficiency of data mining operations by providing the technology components to perform advanced analytic operations directly against the RDBMS 114.
- the Analytic Algorithms 206 leverage the parallelism that exists in the MPP computer system 100, the RDBMS 114, and the database 116.
- the Analytic Algorithms 206 provide data analysts with an unprecedented option to train and apply "machine learning" analytics against massive amounts of data in the relational database 116. Prior techniques have failed as their sequential design is not optimal in an RDBMS 114 environment. Because the Analytic Algorithms 206 are implemented in Extended ANSI SQL 208, through the CLI 210, and/or by means of the Data Reduction Utility Program 212, they can therefore leverage the scalability available on the MPP computer system 100. In addition, taking a data-driven approach to analysis, through the use of complete Extended ANSI SQL 208, allows people other than highly educated statisticians to leverage the advanced analytic techniques offered by the Analytic Algorithms 206.
- Analytic Algorithms 206 that are completely data driven, such as affinity analysis, can be implemented solely in Extended ANSI SQL 208.
- these type of algorithms operate against a set of tables in the relational database 116 that are populated with transaction-level data, the source of which could be point-of-sale devices, automated teller machines, call centers, the Internet, etc.
- the SQL statements used to process this data typically build relationships between and among data elements in the tables.
- the SQL statements used to process data from point-of-sale devices may build relationships between and among products and pairs of products.
- the dimension of time can be added in such a way that these relationships can be analyzed to determine how they change over time.
- the design takes advantage of the hardware and software environment of the preferred embodiment by decomposing the SQL statements into a plurality of sort and merge steps that can be executed concurrently in parallel by the MPP computer system 100.
- Analytic Algorithms 206 that require a mix of programmatic iteration along with Extended ANSI SQL statements, such as inductive inference, can be implemented using the CLI 210.
- SQL approach is appropriate for business problems that are descriptive in nature
- inference problems are predictive in nature and typically require a training phase where the APPL 110 "learns" various rules based upon the data description, followed by testing and application, and where the rules are validated and applied against a new data set.
- This class of algorithms are compute-intensive and historically can not handle large volumes of data because they expect the analyzed data to be in a specific fixed or variable flat file format.
- the RDBMS 114 can be leveraged to perform computations and order data within the relational database 116, and then extract the information using very little memory in the APPL 110. Additionally, computations, aggregations and/or ordering can be run in parallel, because of the massively parallel nature of the RDBMS 114.
- Analytic Algorithms 206 that can operate on a reduced or scaled data set, such as regression or clustering, the Data Reduction Utility Program 212 can be used.
- the problem of creating analytic models from massive amounts of detailed data has often been addressed by sampling, mainly because compute intensive algorithms cannot handle large volumes of data.
- the approach of the Data Reduction Utility Program 212 is to reduce data through operations such as matrix calculations or histogram binning, and then use this reduced or scaled data as input to a non-SQL algorithm. This method intentionally reduces fine numerical data details by assigning them to ranges, or bins, correlating their values or determining their covariances.
- the capacity of the preferred embodiment for creating these data structures from massive amounts of data in parallel gives it a special opportunity in this area.
- the Analytic LDM 200 which is integrated with the relational database 116 and the RDBMS 114, provides logical entity and attribute definitions for advanced analytic processing, i.e., the Scalable Data Mining Functions 202 and Analytic Algorithms 206, performed by the RDBMS 114 directly against the relational database 116. These logical entity and attribute definitions comprise metadata that define the characteristics of data stored in the relational database 116, as well as metadata that determines how the RDBMS 114 performs the advanced analytic processing.
- the Analytic LDM 200 also stores processing results from this advanced analytic processing, which includes both result tables and derived data for the Scalable Data Mining Functions 202, Analytic Algorithms 206, and the Parallel Deployer 216.
- the Analytic LDM 200 is a dynamic model, since the logical entities and attributes definitions change depending upon parameterization of the advanced analytic processing, and since the Analytic LDM 200 is updated with the results of the advanced analytic processing.
- This table supports the BIN function to bin numeric column(s) giving counts including optional overlay variables and statistics options.
- the BIN function takes as parameters a table name, the name of one or more numeric columns, and one of the following:
- This function calculates the boundaries of each bin along with the bin number, count, and percentages over the requested rows (which will always add up to 100). It optionally further provides sub-totals within each bin of the count, percentage within the bin, and percentage overall for each value or combination of values of one or more overlaid columns. A further option is provided to accumulate the values of a binned column or another column as a sum, mean, or standard deviation.
- BINPLUS Results Table This table supports the BINPLUS function that modifies the computed equal sized bins to include a separate bin for each spike value and to further subdivide an overpopulated bin, returning counts and boundaries for each resulting bin.
- the BINPLUS function takes as parameters a table name, the name of a numeric column, the desired number of equal sized bins, the frequency percentage above which a value should be treated as a "spike", and a similar percentage above which a bin should be further subdivided. Subdividing is performed by first subdividing by the same number of bins and then merging this with a subdivision in the region of the mean value within the bin.
- Subdivision near the mean is done by subdividing by the same number of bins the region around the mean, -/+ the standard deviation (if outside of the original bin, then from the bin boundary to the mean value). Subdividing may optionally be done using quantiles, giving approximately equally distributed bins.
- This function differs from the BIN function in that the BIN function includes spike values in the precomputed bins, which can distort the bin counts, and does not subdivide overpopulated bins.
- This function also does not have many of the specialized options of the BIN function, such as binning by width, binning by boundary, binning by quantile, overlays, stats, or binning over multiple dimensions.
- This table supports the COR function that creates a "small" Pearson Product-Moment Correlation Matrix.
- This function takes as parameters a table name and a list of numeric columns. It then calculates the correlation matrix of all pair-wise combinations of the variables with values stored in the lower triangular portion, l's along the diagonal, and null values in the upper triangular portion instead of the actual symmetric values.
- This table supports the COV function to create a Covariance Matrix.
- This function takes as parameters a table name and a list of numeric columns. It then calculates the covariance matrix of all pair- wise combinations of the variables with values stored in the lower triangular portion and along the diagonal, and null values in the upper triangular portion, instead of the actual symmetric values.
- This table supports the SSCP function to create a "Sum of Squares and Cross Products" Matrix.
- This function takes as parameters a table name and a list of numeric columns. It then calculates the sum of squares and cross-products matrix for all pair- wise combinations of the variables, with values stored in the lower triangular portion and along the diagonal, and null values in the upper triangular portion, instead of the actual symmetric values.
- This table supports the FREQ function to compute the frequency of column values or multi-column combined values when cross-tabs are not used.
- This function takes as parameters a table name and the name of one or more columns, and calculates the number of occurrences of each value of the column or columns individually or in combination, along with the percentage of all rows in the selected table.
- This table supports the FREQWEB function to compute the frequency of values for pairs of columns in column list.
- This function takes as parameters a table name and a list of columns, and counts the number of occurrences in the table of each pair-wise combination of distinct values within the columns specified by the list, including the percentage of the total number of rows.
- the function will combine each column in the first list with each column in the second list and count the number of occurrences of each combination of values as above.
- This table supports the MODES function to calculate modes, or the most frequently occurring value(s) for a column.
- This function takes as parameters a table name and column name, and determines the value(s) of the column that occurs most frequently. Note that this may result in more than one row as more than one value can occur the maximum number of times. By default, the smaller of these maximum occurring values is returned along with the number of modes or modality.
- the user can request that all modal values be returned. The count and a percentage are also returned either the percentage of all selected records or, if the group option is used, the percentage within each group.
- This table supports the OVERLAP function to count overlapping column values in combinations of tables.
- This function takes as parameters a column name and a list of table names, and calculates the number of instances of that column which each pair-wise combination of tables has in common.
- STATS Results Table This table supports the STATS function to calculate descriptive statistics for numeric column (s). This function takes as parameters a table name and the name of a numeric column or column (s), and derives descriptive statistics for the data in the column (s). Statistics provided include minimum, maximum, mean, standard deviation, skewness, kurtosis, standard mean error, coefficient of variance, variance, sum, uncorrected sum of squares and corrected sum of squares.
- the user can request an extended option to additionally obtain the result of the values, modes and quantile functions, as well as the top 5 and bottom 5 distinct values along with the basic statistics.
- modes can ordinarily return more than one value, only the minimum modal value is utilized and an additional column called "xnbrmodes" for the number of modes or modality is returned.
- xnbrmodes additional column
- the top 5 and bottom 5 values are determined as distinct values, with counts also provided.
- This table supports the VALUES function to count the number of values of various kinds for a given column.
- This function takes as parameters a table name and the name of a column, and calculates the number of:
- This table supports the BINCODE function that takes as parameters a table name, the name of a numeric column, and either the desired number of equal sized bins, the bin width, the boundary values with any spacing, or the number of bins with nearly equal number of values in each bin.
- This function derives a new column with the bin number as the value.
- RECODE Results Table This table supports the RECODE function that takes as parameters a table name, the name of a column, the old column values and new column values, and key column name. This function translates the old column values into new user specified ones.
- DUMMYCODE Results Table This table supports the RECODE function that takes as parameters a table name, the name of a column, the old column values and new column values, and key column name. This function translates the old column values into new user specified ones.
- This table supports the DUMMYCODE function that takes as parameters a table name, the name of a column, and a list of values to "dummy-code". This function creates a new column for each listed value, with a value of 0 or 1 depending on whether that value is assumed by the original variable. A list of result column names, one per value, is used to name the resulting new columns.
- This table supports the BMAP function that takes as parameters an account/product ownership summary table, (one row for each account/product of owned by each customer), a start and end date, and an account/product type, to derive a bit map variable reflecting customer ownership in a particular time period for a particular account/product list.
- Each bit position in the derived bitmap represents a particular account/product type, and is either 0 if an account/product is not owned, or 1 if one or more accounts/products of the given type is owned in the given time period.
- This table supports the BMAPTIME function that takes as parameters an account/product ownership summary table, (one row for each account/product of owned by each customer), a start and end date, and an account/product type, to derive a bit map variable reflecting customer ownership in a particular time period list for a particular account/product.
- Each bit position in the derived bitmap represents a particular time period and is either 0 if an account/product is not owned, or 1 if one or more accounts/products of the given type is owned in the given time period.
- This table supports the SIGMOID function that takes as parameters a table name, the name of a numeric column and the key column for the result set, to derive the sigmoid transformation of the values of the column.
- This table supports the LOG function that takes as parameters a table name, the name of a numeric column, and the key column for the result set, to scale the column to its base 10 logarithm value.
- This table supports the ZSCORE function that takes as parameters a table name, the name of a numeric column, and the key column for the result set, to transform the column into their z score value, which comprises the number of standard deviations a value is away from the mean.
- This table supports the POWER function that takes as parameters a table name, the name of a numeric column, the key column for the result set, and the power to raise it to, to generate transformed values of the column.
- This table supports the LN function that takes as parameters a table name, the name of a numeric column, and the key column for the result set, to scale the column to its natural logarithm value.
- This table supports the EXP function that takes as parameters a table name, the name of a numeric column, and the key column for the result set, to scale the column via the exponential function.
- This table supports the RESCALE function that takes as parameters a table name, the name of a numeric column, the key column for the result set, and a left and/or right value boundary, to re-scale the values of the column to fall within the requested boundaries.
- This table supports the DERIVE function that takes as parameters a table name, and one or more columns and/or SQL expressions, to derive a new table defined by the columns or expressions. This function is useful for deriving several new columns at once using user-specified SQL expressions.
- RANK Results Table This table supports the RANK function that takes as parameters a table name, the sort expression list by which to compute rank, the result column, and the key column for the result set, to derive a new column for each, indicating the rank of the rows when sorted by the specified column or expression.
- This table supports the QUANTILE function that takes as parameters a table name, the sort expression list by which to compute quantile, the number of quantile partitions, the result column, and the key column for the result set, to derive a new column for each sort expression list, giving the quantile partition that each row belongs in based on the sort list.
- This table supports the MAVG function that takes as parameters a table name, one or more value expressions, widths and corresponding sort expression lists, the result column, and the key column for the result set, to derive a new column for each value expression giving the moving average of the value expression over "width" rows when sorted by the sort expression list. For rows that have less than width - 1 rows preceding it in the table or group, the function is computed using all preceding rows.
- This table supports the MDIFF function that takes as parameters a table name, one or more value expressions, widths and corresponding sort expression lists, the result column, and the key column for the result set, to derive a new column for each value expression giving the moving difference of the value expression when the rows are sorted by the sort expression list.
- the moving difference is calculated as the difference between the current value and the Nth previous value, where N equals the width.
- the moving difference is NULL if there is no Nth preceding row in the table or group.
- This table supports the CSUM function that takes as parameters a table name, one or more value expressions, widths and corresponding sort expression lists, the result column, and the key column for the result set, to derive a new column for each value expression giving the cumulative sum of the value expression when sorted by the sort expression list.
- CSUM function takes as parameters a table name, one or more value expressions, widths and corresponding sort expression lists, the result column, and the key column for the result set, to derive a new column for each value expression giving the cumulative sum of the value expression when sorted by the sort expression list.
- This table supports the MSUM function that takes as parameters a table name, one or more value expressions, widths and corresponding sort expression lists, the result column, and the key column for the result set, to derive a new column for each value expression giving the moving sum of the value expression over "width" rows when sorted by the sort expression list. For rows that have less than width - 1 rows preceding it in the table or group, the function is computed using all preceding rows.
- MLINREG Results Table This table supports the MLINREG function that takes as parameters a table name, one or more value expressions, widths and corresponding sort expression lists, the result column, and the key column for the result set, to derive a new column giving the moving linear regression extrapolation of the value expression over "width" rows when sorted by the sort expression, using the sort expression as the independent variable.
- the current and width - 1 rows after sorting are used to calculate the simple least squares linear regression. For rows that have less than width - 1 rows preceding it in the table or group, the function is computed using all preceding rows. The first two rows in the table or group however will have the NULL value.
- This table supports the TRANINT function that derives counts, amounts, percentage means, and intensities from a transaction summary file.
- This function takes as parameters a start time period and end time period to calculate average period counts, amounts, percentage means, and intensity measures from previously computed transaction summary data.
- This table supports the TRANVAR function that derives variabilities from transaction summary data.
- This function takes as parameters a start time period and end time period, and transaction type to calculate the average periodic transaction counts and transaction amounts by customer and transaction type (such as debit or credit) from a transaction summary table.
- This table supports the JOIN function that joins tables together into a combined result table.
- This function takes as parameters a list of tables, keys, and column lists to combine new derived variables into an analytic data set, prior to building a matrix or analytic model.
- an INNER join is performed on the given tables based on the given key columns. This means that rows will be returned only for key column values that appear in both tables.
- a LEFT outer join can be requested, which returns rows for all key column values found in the first table specified, and fills in any missing values from the other tables with null values.
- This table supports the DENORM function that selects or creates a new denormalized table.
- This function takes as parameters a table name, the name of key column(s) to remove, the names of key columns to retain, the names of remaining columns to denormalize, and the values of the removed key columns to denormalize by. All columns other than the retained key and denormalized columns are dropped in the new table, unless they are specified as retained columns. However, in this case, they should already be denormalized, i.e., have the same value for each of the removed key columns. New columns created as a result of denormalization each have new names formed by preceding their name with a combination of the values of the removed keys and preceded by an underscore character. The user may, however, specify the prefix to be used for any of the key values.
- This table supports the SAMPLE function that selects one or more samples from a table by size or fraction.
- an extra column xsampleid
- the sample function returns a pseudo-random selection of rows, which will likely vary from one run to the next.
- PARTITION Results Table This table supports the PARTITION function that selects a specific partition or range of partitions from a table using a hash key. For example, the third partition out of ten might be requested, or partitions 1 through 3 out of 10 might be requested.
- the start and end partition are set to the same selected value. If a range of partitions is requested and the select option is used, the partition number is also returned as "xpartid", which may be used with the order option.
- Analytic Metadata -- Table and Column Definition Two different types of analytic metadata are required by the functions: (1) data reduction metadata for the matrix builder; and (2) transaction and account summary metadata for the TRANINT and TRANVAR functions, and the BMAP and BMAPTIME functions, respectively.
- Matrix Builder Tables Two different types of analytic metadata are required by the functions: (1) data reduction metadata for the matrix builder; and (2) transaction and account summary metadata for the TRANINT and TRANVAR functions, and the BMAP and BMAPTIME functions, respectively.
- This metadata is kept for the large Covariance, Correlation and Sum of Squares and Cross-Products Matrices. This metadata has been designed to allow matrices with more that 255 variables to be defined within the RDBMS. Additionally, it has been tuned specifically for performance reasons when dealing with this particular type of wide data set. Three tables make up this metadata, as described in more detail below.
- This table supports the BLDMAT, GETMAT and RSTMAT functions to track the various types of matrices (COR, COV, SSCP) and their associated descriptions.
- This table supports the BLDMAT, GETMAT and RSTMAT functions to track internal table and column indexes, and their associated names and aliases.
- This table supports the BLDMAT, GETMAT and RSTMAT functions to help keep track of what columns were used to join multiple tables.
- This table supports the BLDMAT, GETMAT and RSTMAT functions to persist the actual matrix calculation, using the internal table, column and select identifiers.
- the second type of metadata is comprised of summarized data.
- Several of the derivation functions namely BMAP, BMAPTIME, TRANINT and TRANVAR
- BMAP, BMAPTIME, TRANINT and TRANVAR require "input" data sets that are comprised of summarized account and transaction level data. Once these data sets are built, these functions can generate a variety of new columns.
- This table supports the BMAP and BMAPTIME functions to derive a bit map variable reflecting either customer ownership in a particular time period for a particular account/product list, or a bit map variable reflecting customer ownership of a particular product for a particular time period list.
- TRAN ACCTS Table This table supports the TRANINT and TRANVAR functions to derive counts, amounts, percentage means and intensities from a transaction summary file, or variabilities from transaction summary data.
- FIGS. 3, 4 and 5 Logic of the Preferred Embodiment Flowcharts which illustrate the logic of the preferred embodiment of the present invention are provided in FIGS. 3, 4 and 5. Those skilled in the art will recognize that this logic is provided for illustrative purposes only and that different logic may be used to accomplish the same results.
- this flowchart illustrates the logic of the Scalable Data Mining Functions 202 according to the preferred embodiment of the present invention.
- Block 300 represents the one or more of the Scalable Data Mining Functions 202 being created via the API 204. This may entail, for example, the instantiation of an object providing the desired function.
- Block 302 represents certain parameters being passed to the API 204, in order to control the operation of the Scalable Data Mining Functions 202.
- Block 304 represents the metadata in the Analytic LDM 200 being accessed, if necessary for the operation of the Scalable Data Mining Function 202.
- Block 306 represents the API 204 generating a Scalable Data Mining Function 204 in the form of a data mining query based on the passed parameters and optional metadata.
- Block 308 represents the Scalable Data Mining Function 204 being passed to the RDBMS 114 for execution.
- this flowchart illustrates the logic of the Analytic Algorithms 206 according to the preferred embodiment of the present invention.
- Block 400 represents the Analytic Algorithms 206 being invoked, either directly or via the Analytic Algorithm API 214.
- Block 402 represents certain parameters being passed to the Analytic
- Algorithms 206 in order to control their operation.
- Block 404 represents the metadata in the Analytic LDM 200 being accessed, if necessary for the operation of the Analytic Algorithms 206.
- Block 406 represents the Analytic Algorithms 206 passing SQL statements to the RDBMS 114 for execution and Block 408 optionally represents the Analytic Algorithms 206 performing programmatic iteration.
- Block 408 optionally represents the Analytic Algorithms 206 performing programmatic iteration.
- Block 410 represents the Analytic Algorithms 206 storing results in the
- this flowchart illustrates the logic performed by the RDBMS 114 according to the preferred embodiment of the present invention.
- Block 500 represents the RDBMS 114 receiving a query or other SQL statements.
- Block 502 represents the RDBMS 114 analyzing the query.
- Block 504 represents the RDBMS 114 generating a plan that enables the RDBMS 114 to retrieve the correct information from the relational database 116 to satisfy the query.
- Block 506 represents the RDBMS 114 compiling the plan into object code for more efficient execution by the RDBMS 114, although it could be interpreted rather than compiled.
- Block 508 represents the RDBMS 114 initiating execution of the plan.
- Block 510 represents the RDBMS 114 generating results from the execution of the plan.
- Block 512 represents the RDBMS 114 either storing the results in the Analytic LDM 200, or returning the results to the Analytic Algorithm 206, APPL 110, and/or Client 118.
- analytic logical data model provides logical entity and attribute definitions for advanced analytic processing performed by the relational database management system directly against the relational database.
Abstract
Description
Claims
Priority Applications (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
AU64123/99A AU6412399A (en) | 1998-10-02 | 1999-10-01 | Analytic logical data model |
US09/806,678 US6553366B1 (en) | 1998-10-02 | 1999-10-01 | Analytic logical data model |
EP99951749A EP1121653A4 (en) | 1998-10-02 | 1999-10-01 | Analytic logical data model |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US10283198P | 1998-10-02 | 1998-10-02 | |
US60/102,831 | 1998-10-02 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2000020998A1 true WO2000020998A1 (en) | 2000-04-13 |
Family
ID=22291906
Family Applications (4)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/US1999/023031 WO2000020999A1 (en) | 1998-10-02 | 1999-10-01 | Techniques for deploying analytic models in parallel |
PCT/US1999/022995 WO2000020997A1 (en) | 1998-10-02 | 1999-10-01 | Data mining assists in a relational database management system |
PCT/US1999/022966 WO2000020982A1 (en) | 1998-10-02 | 1999-10-01 | Sql-based analytic algorithms |
PCT/US1999/023019 WO2000020998A1 (en) | 1998-10-02 | 1999-10-01 | Analytic logical data model |
Family Applications Before (3)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/US1999/023031 WO2000020999A1 (en) | 1998-10-02 | 1999-10-01 | Techniques for deploying analytic models in parallel |
PCT/US1999/022995 WO2000020997A1 (en) | 1998-10-02 | 1999-10-01 | Data mining assists in a relational database management system |
PCT/US1999/022966 WO2000020982A1 (en) | 1998-10-02 | 1999-10-01 | Sql-based analytic algorithms |
Country Status (4)
Country | Link |
---|---|
US (4) | US6549910B1 (en) |
EP (4) | EP1121653A4 (en) |
AU (4) | AU6412099A (en) |
WO (4) | WO2000020999A1 (en) |
Families Citing this family (118)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6553366B1 (en) * | 1998-10-02 | 2003-04-22 | Ncr Corporation | Analytic logical data model |
US7016910B2 (en) * | 1999-12-30 | 2006-03-21 | Decode Genetics Ehf. | Indexing, rewriting and efficient querying of relations referencing semistructured data |
US6434557B1 (en) | 1999-12-30 | 2002-08-13 | Decode Genetics Ehf. | Online syntheses programming technique |
US6356900B1 (en) * | 1999-12-30 | 2002-03-12 | Decode Genetics Ehf | Online modifications of relations in multidimensional processing |
US6643645B1 (en) * | 2000-02-08 | 2003-11-04 | Microsoft Corporation | Retrofitting recommender system for achieving predetermined performance requirements |
AU2001257077A1 (en) * | 2000-04-17 | 2001-10-30 | Brio Technology, Inc. | Analytical server including metrics engine |
US6748394B2 (en) | 2000-04-27 | 2004-06-08 | Hyperion Solutions Corporation | Graphical user interface for relational database |
US7080090B2 (en) | 2000-04-27 | 2006-07-18 | Hyperion Solutions Corporation | Allocation measures and metric calculations in star schema multi-dimensional data warehouse |
US7167859B2 (en) | 2000-04-27 | 2007-01-23 | Hyperion Solutions Corporation | Database security |
US7072897B2 (en) | 2000-04-27 | 2006-07-04 | Hyperion Solutions Corporation | Non-additive measures and metric calculation |
US6732115B2 (en) | 2000-04-27 | 2004-05-04 | Hyperion Solutions Corporation | Chameleon measure and metric calculation |
US6643661B2 (en) | 2000-04-27 | 2003-11-04 | Brio Software, Inc. | Method and apparatus for implementing search and channel features in an enterprise-wide computer system |
US6941311B2 (en) | 2000-04-27 | 2005-09-06 | Hyperion Solutions Corporation | Aggregate navigation system |
US20020116237A1 (en) * | 2000-05-26 | 2002-08-22 | Marc-David Cohen | Cross-selling optimizer |
US6816848B1 (en) * | 2000-06-12 | 2004-11-09 | Ncr Corporation | SQL-based analytic algorithm for cluster analysis |
US7117215B1 (en) | 2001-06-07 | 2006-10-03 | Informatica Corporation | Method and apparatus for transporting data for data warehousing applications that incorporates analytic data interface |
AU8561501A (en) * | 2000-09-22 | 2002-04-02 | Cryosite Ltd | System and method for management of specimens |
AU9124801A (en) | 2000-09-28 | 2002-04-08 | Oracle Corp | Enterprise web mining system and method |
US7117208B2 (en) | 2000-09-28 | 2006-10-03 | Oracle Corporation | Enterprise web mining system and method |
US6941291B1 (en) * | 2000-12-07 | 2005-09-06 | Cisco Technology, Inc. | Method and device for a user profile repository |
US6496834B1 (en) * | 2000-12-22 | 2002-12-17 | Ncr Corporation | Method for performing clustering in very large databases |
US7725423B1 (en) * | 2001-02-08 | 2010-05-25 | Teradata Us, Inc. | Analyzing associations in the order of transactions |
US20020120435A1 (en) * | 2001-02-28 | 2002-08-29 | Frazier John D. | Implementing a neural network in a database system |
US7191183B1 (en) * | 2001-04-10 | 2007-03-13 | Rgi Informatics, Llc | Analytics and data warehousing infrastructure and services |
US6778994B2 (en) | 2001-05-02 | 2004-08-17 | Victor Gogolak | Pharmacovigilance database |
US7542961B2 (en) | 2001-05-02 | 2009-06-02 | Victor Gogolak | Method and system for analyzing drug adverse effects |
US7925612B2 (en) * | 2001-05-02 | 2011-04-12 | Victor Gogolak | Method for graphically depicting drug adverse effect risks |
US20020183965A1 (en) * | 2001-05-02 | 2002-12-05 | Gogolak Victor V. | Method for analyzing drug adverse effects employing multivariate statistical analysis |
US20030033155A1 (en) * | 2001-05-17 | 2003-02-13 | Randy Peerson | Integration of data for user analysis according to departmental perspectives of a customer |
US6732085B1 (en) * | 2001-05-31 | 2004-05-04 | Oracle International Corporation | Method and system for sample size determination for database optimizers |
US7162643B1 (en) | 2001-06-15 | 2007-01-09 | Informatica Corporation | Method and system for providing transfer of analytic application data over a network |
US6789096B2 (en) * | 2001-06-25 | 2004-09-07 | Informatica Corporation | Real time sessions in an analytic application |
US6728703B1 (en) * | 2001-06-29 | 2004-04-27 | Qiang Wan | System and method for processing movement/delta metrics |
US7720842B2 (en) | 2001-07-16 | 2010-05-18 | Informatica Corporation | Value-chained queries in analytic applications |
US7461006B2 (en) * | 2001-08-29 | 2008-12-02 | Victor Gogolak | Method and system for the analysis and association of patient-specific and population-based genomic data with drug safety adverse event data |
US20070179717A1 (en) * | 2001-09-21 | 2007-08-02 | Milliken Gordon L | System and method for management of specimens |
US7069197B1 (en) * | 2001-10-25 | 2006-06-27 | Ncr Corp. | Factor analysis/retail data mining segmentation in a data mining system |
US20030149613A1 (en) * | 2002-01-31 | 2003-08-07 | Marc-David Cohen | Computer-implemented system and method for performance assessment |
US6820077B2 (en) | 2002-02-22 | 2004-11-16 | Informatica Corporation | Method and system for navigating a large amount of data |
US7117201B2 (en) * | 2002-03-20 | 2006-10-03 | Hewlett-Packard Development Company, L.P. | Resource searching |
US8868544B2 (en) * | 2002-04-26 | 2014-10-21 | Oracle International Corporation | Using relational structures to create and support a cube within a relational database system |
US7415457B2 (en) * | 2002-04-26 | 2008-08-19 | Oracle International Corporation | Using a cache to provide cursor isolation |
US7366730B2 (en) * | 2002-04-26 | 2008-04-29 | Oracle International Corporation | Registration of solved cubes within a relational database management system |
EP1500020A2 (en) * | 2002-04-30 | 2005-01-26 | Veridiem Inc. | Marketing optimization system |
US8001112B2 (en) * | 2002-05-10 | 2011-08-16 | Oracle International Corporation | Using multidimensional access as surrogate for run-time hash table |
US7174336B2 (en) * | 2002-05-10 | 2007-02-06 | Oracle International Corporation | Rule generation model building |
US7080063B2 (en) * | 2002-05-10 | 2006-07-18 | Oracle International Corporation | Probabilistic model generation |
US7447687B2 (en) * | 2002-05-10 | 2008-11-04 | International Business Machines Corporation | Methods to browse database query information |
US20040073496A1 (en) * | 2002-09-30 | 2004-04-15 | Marc-David Cohen | Computer-implemented offer optimization system and method |
US7716167B2 (en) * | 2002-12-18 | 2010-05-11 | International Business Machines Corporation | System and method for automatically building an OLAP model in a relational database |
US7953694B2 (en) * | 2003-01-13 | 2011-05-31 | International Business Machines Corporation | Method, system, and program for specifying multidimensional calculations for a relational OLAP engine |
US7895191B2 (en) * | 2003-04-09 | 2011-02-22 | International Business Machines Corporation | Improving performance of database queries |
US7447676B2 (en) * | 2003-04-21 | 2008-11-04 | Oracle International Corporation | Method and system of collecting execution statistics of query statements |
US8200612B2 (en) * | 2003-05-07 | 2012-06-12 | Oracle International Corporation | Efficient SQL access to multidimensional data |
US8209280B2 (en) * | 2003-05-07 | 2012-06-26 | Oracle International Corporation | Exposing multidimensional calculations through a relational database server |
US8612421B2 (en) * | 2003-05-07 | 2013-12-17 | Oracle International Corporation | Efficient processing of relational joins of multidimensional data |
US7403934B2 (en) * | 2003-06-10 | 2008-07-22 | Sbc Properties, L.P. | Script generator for automating system administration operations |
US7243100B2 (en) * | 2003-07-30 | 2007-07-10 | International Business Machines Corporation | Methods and apparatus for mining attribute associations |
US7421458B1 (en) | 2003-10-16 | 2008-09-02 | Informatica Corporation | Querying, versioning, and dynamic deployment of database objects |
US7831615B2 (en) * | 2003-10-17 | 2010-11-09 | Sas Institute Inc. | Computer-implemented multidimensional database processing method and system |
US20050102303A1 (en) * | 2003-11-12 | 2005-05-12 | International Business Machines Corporation | Computer-implemented method, system and program product for mapping a user data schema to a mining model schema |
US7349919B2 (en) * | 2003-11-21 | 2008-03-25 | International Business Machines Corporation | Computerized method, system and program product for generating a data mining model |
US7254590B2 (en) | 2003-12-03 | 2007-08-07 | Informatica Corporation | Set-oriented real-time data processing based on transaction boundaries |
US7529764B2 (en) | 2004-01-12 | 2009-05-05 | Hitachi Global Storage Technologies Netherlands B.V. | GUI for data pipeline |
US20050154696A1 (en) * | 2004-01-12 | 2005-07-14 | Hitachi Global Storage Technologies | Pipeline architecture for data summarization |
US7293026B1 (en) * | 2004-04-30 | 2007-11-06 | Ncr Corp. | Integrating a data warehouse and a database |
US7707143B2 (en) * | 2004-06-14 | 2010-04-27 | International Business Machines Corporation | Systems, methods, and computer program products that automatically discover metadata objects and generate multidimensional models |
WO2006110485A2 (en) * | 2005-04-07 | 2006-10-19 | Insightful Corporation | Method and system for handling large data sets in a statistical language |
US20060230083A1 (en) * | 2005-04-08 | 2006-10-12 | Microsoft Corporation | Method and system for profiling and populating a database |
US7509337B2 (en) * | 2005-07-05 | 2009-03-24 | International Business Machines Corporation | System and method for selecting parameters for data mining modeling algorithms in data mining applications |
US7516152B2 (en) * | 2005-07-05 | 2009-04-07 | International Business Machines Corporation | System and method for generating and selecting data mining models for data mining applications |
US7512626B2 (en) * | 2005-07-05 | 2009-03-31 | International Business Machines Corporation | System and method for selecting a data mining modeling algorithm for data mining applications |
US7917482B1 (en) * | 2005-08-10 | 2011-03-29 | Infoblox Inc. | Indexing of database queries |
US7624054B2 (en) * | 2005-08-25 | 2009-11-24 | Sas Institute Inc. | Financial risk mitigation optimization systems and methods |
US7634431B2 (en) * | 2006-03-08 | 2009-12-15 | Sas Institute Inc. | Systems and methods for costing reciprocal relationships |
US7813948B2 (en) * | 2006-08-25 | 2010-10-12 | Sas Institute Inc. | Computer-implemented systems and methods for reducing cost flow models |
US7680765B2 (en) | 2006-12-27 | 2010-03-16 | Microsoft Corporation | Iterate-aggregate query parallelization |
US8000996B1 (en) | 2007-04-10 | 2011-08-16 | Sas Institute Inc. | System and method for markdown optimization |
US8160917B1 (en) | 2007-04-13 | 2012-04-17 | Sas Institute Inc. | Computer-implemented promotion optimization methods and systems |
US20080288527A1 (en) * | 2007-05-16 | 2008-11-20 | Yahoo! Inc. | User interface for graphically representing groups of data |
US8122056B2 (en) | 2007-05-17 | 2012-02-21 | Yahoo! Inc. | Interactive aggregation of data on a scatter plot |
US7739229B2 (en) | 2007-05-22 | 2010-06-15 | Yahoo! Inc. | Exporting aggregated and un-aggregated data |
US7756900B2 (en) * | 2007-05-22 | 2010-07-13 | Yahoo!, Inc. | Visual interface to indicate custom binning of items |
US8024241B2 (en) * | 2007-07-13 | 2011-09-20 | Sas Institute Inc. | Computer-implemented systems and methods for cost flow analysis |
US7930200B1 (en) | 2007-11-02 | 2011-04-19 | Sas Institute Inc. | Computer-implemented systems and methods for cross-price analysis |
US8200518B2 (en) | 2008-02-25 | 2012-06-12 | Sas Institute Inc. | Computer-implemented systems and methods for partial contribution computation in ABC/M models |
US8812338B2 (en) | 2008-04-29 | 2014-08-19 | Sas Institute Inc. | Computer-implemented systems and methods for pack optimization |
US8392406B1 (en) | 2008-05-30 | 2013-03-05 | Oracle International Corporation | Determining a height-balanced histogram incrementally |
US8296182B2 (en) * | 2008-08-20 | 2012-10-23 | Sas Institute Inc. | Computer-implemented marketing optimization systems and methods |
US8271318B2 (en) * | 2009-03-26 | 2012-09-18 | Sas Institute Inc. | Systems and methods for markdown optimization when inventory pooling level is above pricing level |
US20110035257A1 (en) * | 2009-08-06 | 2011-02-10 | Rajendra Singh Solanki | Systems And Methods For Generating Planograms In The Presence Of Multiple Objectives |
US8515835B2 (en) | 2010-08-30 | 2013-08-20 | Sas Institute Inc. | Systems and methods for multi-echelon inventory planning with lateral transshipment |
US8549004B2 (en) | 2010-09-30 | 2013-10-01 | Hewlett-Packard Development Company, L.P. | Estimation of unique database values |
US8688497B2 (en) | 2011-01-10 | 2014-04-01 | Sas Institute Inc. | Systems and methods for determining pack allocations |
US8788315B2 (en) | 2011-01-10 | 2014-07-22 | Sas Institute Inc. | Systems and methods for determining pack allocations |
US8856151B2 (en) | 2011-01-25 | 2014-10-07 | Hewlett-Packard Development Company, L.P. | Output field mapping of user defined functions in databases |
US9355145B2 (en) | 2011-01-25 | 2016-05-31 | Hewlett Packard Enterprise Development Lp | User defined function classification in analytical data processing systems |
US8538954B2 (en) | 2011-01-25 | 2013-09-17 | Hewlett-Packard Development Company, L.P. | Aggregate function partitions for distributed processing |
US9984124B2 (en) | 2011-05-11 | 2018-05-29 | International Business Machines Corporation | Data management in relational databases |
US9076156B2 (en) | 2011-05-26 | 2015-07-07 | Nice Systems Technologies Uk Limited | Real-time adaptive binning through partition modification |
TWI478080B (en) * | 2011-12-08 | 2015-03-21 | Chunghwa Telecom Co Ltd | Differentiation Performance Target Value Assignment Method and Its Program Storage Media |
US9697316B1 (en) * | 2011-12-13 | 2017-07-04 | Amazon Technologies, Inc. | System and method for efficient data aggregation with sparse exponential histogram |
US8938444B2 (en) * | 2011-12-29 | 2015-01-20 | Teradata Us, Inc. | Techniques for external application-directed data partitioning in data exporting from a database management system |
FR2994358B1 (en) * | 2012-08-01 | 2015-06-19 | Netwave | SYSTEM FOR PROCESSING CONNECTION DATA TO A PLATFORM OF AN INTERNET SITE |
US9239741B2 (en) * | 2012-10-16 | 2016-01-19 | Futurewei Technologies, Inc. | System and method for flexible distributed massively parallel processing (MPP) |
WO2014193470A1 (en) * | 2013-05-28 | 2014-12-04 | Dynasim Technical Services, Inc. | Method of managing relational data in a single matrix representation |
US9424337B2 (en) | 2013-07-09 | 2016-08-23 | Sas Institute Inc. | Number of clusters estimation |
US9202178B2 (en) * | 2014-03-11 | 2015-12-01 | Sas Institute Inc. | Computerized cluster analysis framework for decorrelated cluster identification in datasets |
US9495405B2 (en) * | 2014-04-28 | 2016-11-15 | International Business Machines Corporation | Big data analytics brokerage |
WO2017147396A1 (en) * | 2016-02-24 | 2017-08-31 | Data2Discovery | Object oriented system and method having semantic substructures for machine learning |
WO2017165914A1 (en) * | 2016-03-31 | 2017-10-05 | Wisetech Global Limited | "methods and systems for database optimisation" |
US10747824B2 (en) * | 2016-12-06 | 2020-08-18 | International Business Machines Corporation | Building a data query engine that leverages expert data preparation operations |
US10650050B2 (en) * | 2016-12-06 | 2020-05-12 | Microsoft Technology Licensing, Llc | Synthesizing mapping relationships using table corpus |
US10949438B2 (en) * | 2017-03-08 | 2021-03-16 | Microsoft Technology Licensing, Llc | Database query for histograms |
US11190419B1 (en) | 2017-05-24 | 2021-11-30 | Amazon Technologies, Inc. | Tunable-granularity multi-level histograms for efficient computer system metric analysis |
US10983888B1 (en) * | 2018-12-12 | 2021-04-20 | Amazon Technologies, Inc. | System and method for generating dynamic sparse exponential histograms |
US11556838B2 (en) * | 2019-01-09 | 2023-01-17 | Sap Se | Efficient data relationship mining using machine learning |
US11188510B2 (en) | 2020-01-30 | 2021-11-30 | PagerDuty, Inc. | Analytical platform for distributed data |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5701400A (en) * | 1995-03-08 | 1997-12-23 | Amado; Carlos Armando | Method and apparatus for applying if-then-else rules to data sets in a relational data base and generating from the results of application of said rules a database of diagnostics linked to said data sets to aid executive analysis of financial data |
US5734887A (en) * | 1995-09-29 | 1998-03-31 | International Business Machines Corporation | Method and apparatus for logical data access to a physical relational database |
Family Cites Families (22)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5448727A (en) | 1991-04-30 | 1995-09-05 | Hewlett-Packard Company | Domain based partitioning and reclustering of relations in object-oriented relational database management systems |
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 |
US5495604A (en) | 1993-08-25 | 1996-02-27 | Asymetrix Corporation | Method and apparatus for the modeling and query of database structures using natural language-like constructs |
US5802509A (en) * | 1993-09-21 | 1998-09-01 | Hitachi, Ltd. | Rule generation system and method of generating rule |
US5692107A (en) * | 1994-03-15 | 1997-11-25 | Lockheed Missiles & Space Company, Inc. | Method for generating predictive models in a computer system |
GB9420742D0 (en) * | 1994-10-14 | 1994-11-30 | Lewis Owen M | Data processing apparatus and technique |
US6078925A (en) | 1995-05-01 | 2000-06-20 | International Business Machines Corporation | Computer program product for database relational extenders |
US5710915A (en) * | 1995-12-21 | 1998-01-20 | Electronic Data Systems Corporation | Method for accelerating access to a database clustered partitioning |
US5724573A (en) * | 1995-12-22 | 1998-03-03 | International Business Machines Corporation | Method and system for mining quantitative association rules in large relational tables |
US5806066A (en) | 1996-03-26 | 1998-09-08 | Bull Hn Information Systems Inc. | Method of integrating schemas of distributed heterogeneous databases |
US5787413A (en) * | 1996-07-29 | 1998-07-28 | International Business Machines Corporation | C++ classes for a digital library |
US5924091A (en) * | 1996-08-28 | 1999-07-13 | Sybase, Inc. | Database system with improved methods for radix sorting |
US5787425A (en) | 1996-10-01 | 1998-07-28 | International Business Machines Corporation | Object-oriented data mining framework mechanism |
US5822751A (en) * | 1996-12-16 | 1998-10-13 | Microsoft Corporation | Efficient multidimensional data aggregation operator implementation |
US6134555A (en) * | 1997-03-10 | 2000-10-17 | International Business Machines Corporation | Dimension reduction using association rules for data mining application |
US5960435A (en) * | 1997-03-11 | 1999-09-28 | Silicon Graphics, Inc. | Method, system, and computer program product for computing histogram aggregations |
US6061682A (en) * | 1997-08-12 | 2000-05-09 | International Business Machine Corporation | Method and apparatus for mining association rules having item constraints |
US5895465A (en) * | 1997-09-09 | 1999-04-20 | Netscape Communications Corp. | Heuristic co-identification of objects across heterogeneous information sources |
US6298342B1 (en) * | 1998-03-16 | 2001-10-02 | Microsoft Corporation | Electronic database operations for perspective transformations on relational tables using pivot and unpivot columns |
US6009432A (en) * | 1998-07-08 | 1999-12-28 | Required Technologies, Inc. | Value-instance-connectivity computer-implemented database |
US6278989B1 (en) * | 1998-08-25 | 2001-08-21 | Microsoft Corporation | Histogram construction using adaptive random sampling with cross-validation for database systems |
US6278997B1 (en) * | 1999-02-05 | 2001-08-21 | International Business Machines Corporation | System and method for constraint-based rule mining in large, dense data-sets |
-
1999
- 1999-10-01 EP EP99951749A patent/EP1121653A4/en not_active Withdrawn
- 1999-10-01 US US09/410,534 patent/US6549910B1/en not_active Expired - Lifetime
- 1999-10-01 US US09/411,818 patent/US6438552B1/en not_active Expired - Lifetime
- 1999-10-01 AU AU64120/99A patent/AU6412099A/en not_active Abandoned
- 1999-10-01 WO PCT/US1999/023031 patent/WO2000020999A1/en not_active Application Discontinuation
- 1999-10-01 EP EP99951742A patent/EP1208480A4/en not_active Withdrawn
- 1999-10-01 WO PCT/US1999/022995 patent/WO2000020997A1/en active Application Filing
- 1999-10-01 AU AU64123/99A patent/AU6412399A/en not_active Abandoned
- 1999-10-01 AU AU61693/99A patent/AU6169399A/en not_active Abandoned
- 1999-10-01 WO PCT/US1999/022966 patent/WO2000020982A1/en active Application Filing
- 1999-10-01 WO PCT/US1999/023019 patent/WO2000020998A1/en active Application Filing
- 1999-10-01 US US09/410,528 patent/US6611829B1/en not_active Expired - Lifetime
- 1999-10-01 US US09/411,809 patent/US6421665B1/en not_active Expired - Lifetime
- 1999-10-01 EP EP99950121A patent/EP1116125A4/en not_active Withdrawn
- 1999-10-01 AU AU62846/99A patent/AU6284699A/en not_active Abandoned
- 1999-10-01 EP EP99948531A patent/EP1125224A4/en not_active Withdrawn
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5701400A (en) * | 1995-03-08 | 1997-12-23 | Amado; Carlos Armando | Method and apparatus for applying if-then-else rules to data sets in a relational data base and generating from the results of application of said rules a database of diagnostics linked to said data sets to aid executive analysis of financial data |
US5734887A (en) * | 1995-09-29 | 1998-03-31 | International Business Machines Corporation | Method and apparatus for logical data access to a physical relational database |
Also Published As
Publication number | Publication date |
---|---|
EP1208480A1 (en) | 2002-05-29 |
US6611829B1 (en) | 2003-08-26 |
EP1125224A4 (en) | 2006-10-25 |
EP1208480A4 (en) | 2006-10-18 |
AU6412399A (en) | 2000-04-26 |
US6421665B1 (en) | 2002-07-16 |
AU6169399A (en) | 2000-04-26 |
EP1116125A1 (en) | 2001-07-18 |
WO2000020999A1 (en) | 2000-04-13 |
US6549910B1 (en) | 2003-04-15 |
EP1116125A4 (en) | 2007-05-02 |
EP1121653A1 (en) | 2001-08-08 |
WO2000020982A1 (en) | 2000-04-13 |
US6438552B1 (en) | 2002-08-20 |
WO2000020997A1 (en) | 2000-04-13 |
EP1121653A4 (en) | 2006-06-14 |
AU6284699A (en) | 2000-04-26 |
AU6412099A (en) | 2000-04-26 |
EP1125224A1 (en) | 2001-08-22 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US6553366B1 (en) | Analytic logical data model | |
EP1121653A1 (en) | Analytic logical data model | |
US6718322B1 (en) | SQL-based analytic algorithm for rule induction | |
US8266147B2 (en) | Methods and systems for database organization | |
US6301575B1 (en) | Using object relational extensions for mining association rules | |
US6714940B2 (en) | Systems, methods, and computer program products to rank and explain dimensions associated with exceptions in multidimensional data | |
US7865509B2 (en) | Creating profiling indices | |
US6816848B1 (en) | SQL-based analytic algorithm for cluster analysis | |
US7162464B1 (en) | Data mining assists in a relational database management system | |
US6704717B1 (en) | Analytic algorithm for enhanced back-propagation neural network processing | |
US6687695B1 (en) | SQL-based analytic algorithms | |
Ordonez et al. | Managing big data analytics workflows with a database system | |
US6772166B1 (en) | SQL-based analytic algorithm for clustering | |
Wojciechowski et al. | Itemset materializing for fast mining of association rules | |
Jovanovic et al. | Foundations of predictive data mining | |
Andrassyova et al. | Knowledge discovery in databases: A comparison of different views | |
IBRAHIM et al. | AN ENHANCED DYNAMIC ALGORITHM FOR ASSOCIATION RULES MINING | |
Scott et al. | Experiences of using Data Mining in a Banking Application | |
George et al. | A parallel data mining architecture for massive data sets | |
CODREANU et al. | ARCHITECTURE ON-LINE ANALYTICAL PROCESSING | |
Manjunath et al. | An Effective Indexing Method for High Dimensional Databases | |
Barlos et al. | A join ordering approach for multicomputer relational databases with highly skewed data | |
Schreiber | EXPERIMENTAL METHODS AND TECHNIQUES IN ENGINEERING | |
Ordonez et al. | Migration of data mining preprocessing into the DBMS | |
El-Ragal et al. | Query Optimization Techniques for OLAP Applications: An ORACLE versus MS-SQL Server Comparative Study |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
ENP | Entry into the national phase |
Ref country code: AU Ref document number: 1999 64123 Kind code of ref document: A Format of ref document f/p: F |
|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): AE AL AM AT AU AZ BA BB BG BR BY CA CH CN CR CU CZ DE DK DM EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MD MG MK MN MW MX NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT TZ UA UG US UZ VN YU ZA ZW |
|
AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): GH GM KE LS MW SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
DFPE | Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101) | ||
WWE | Wipo information: entry into national phase |
Ref document number: 1999951749 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 09806678 Country of ref document: US |
|
REG | Reference to national code |
Ref country code: DE Ref legal event code: 8642 |
|
WWP | Wipo information: published in national office |
Ref document number: 1999951749 Country of ref document: EP |