Patent US6772166B1 successfully refreshed from Google Patents.
← Back to Patent Explorer
US6772166B1 Expired / Lapsed US ⏱️ 0.0 years remaining

SQL-based analytic algorithm for clustering

Assignee: Teradata US Inc
•
Filing: 1999-10-01
•
Granted: 2004-08-03
•
Expires: 2019-10-01
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method, apparatus, and article of manufacture for performing data mining applications in a relational database management system. An analytic algorithm for clustering is performed by the computer. The analytic algorithm for clustering includes SQL statements performed by the relational database management system for reducing data retrieved from the relational database in bulk, and programmatic iteration for operating on the reduced data to find clusters therein. The analytic algorithm for clustering creates at least one analytic model within the analytic logical data model from data residing in the relational database.

Inventors

  • 👤 James Dean Hildreth

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-30 21:00
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/20; G06F16/28; G06F16/284; G06F16/285; Y; Y10; Y10S; Y10S707/00; Y10S707/99931; Y10S707/99932; Y10S707/99933; Y10S707/99937; Y10S707/99941; Y10S707/99942; Y10S707/99943

Claims Analysis

Total Claims: 39
Claim 1
Independent Claim 129 words
A system for performing data mining applications, comprising: (a) a computer having one or more data storage devices connected thereto; (b) a relational database management system, executed by the computer, for managing a relational database stored on the data storage devices; and (c) an analytic algorithm for clustering performed by the computer, wherein the analytic algorithm for clustering includes SQL statements performed by the relational database management system for reducing data retrieved from the relational database in bulk by reducing the number of columns or rows in the data, the analytic algorithm for clustering includes programmatic iteration for operating on the reduced data to find clusters therein, and the analytic algorithm for clustering creates at least one analytic model within an analytic logical data model from the reduced data.
Claim 2
Independent Claim 129 words
A system for performing data mining applications, comprising: (a) a computer having one or more data storage devices connected thereto; (b) a relational database management system, executed by the computer, for managing a relational database stored on the data storage devices; and (c) an analytic algorithm for clustering performed by the computer, wherein the analytic algorithm for clustering includes SQL statements performed by the relational database management system for reducing data retrieved from the relational database in bulk by reducing the number of columns or rows in the data, the analytic algorithm for clustering includes programmatic iteration for operating on the reduced data to find clusters therein, and the analytic algorithm for clustering creates at least one analytic model within an analytic logical data model from the reduced data.
Claim 3
Dependent Claim 36 words
The system of claim 1 , wherein the computer is a massively parallel processing (MPP) computer system, and the analytic algorithm for clustering is executed concurrently in parallel on the massively parallel processing (MPP) computer system.
Claim 4
Dependent Claim 21 words
The system of claim 1 , wherein the analytic algorithm for clustering uses a category utility (CU) function for its analysis.
Claim 5
Dependent Claim 37 words
The system of claim 1 , wherein the analytic algorithm for clustering is implemented as a combination of SQL statements performed by the relational database management system and the programmatic iteration is performed by an application program.
Claim 6
Dependent Claim 16 words
The system of claim 4 , wherein the application program comprises a Data Reduction Utility Program.
Claim 7
Dependent Claim 35 words
The system of claim 4 , wherein the relational database management system executes the SQL statements to reduce data from the relational database and the application program performs the programmatic iteration to find clusters therein.
Claim 8
Dependent Claim 28 words
The system of claim 1 , wherein the SQL statements preprocess the data in the relational database to reduce fine numerical details therein to create the reduced data.
Claim 9
Dependent Claim 18 words
The system of claim 7 , wherein the fine numerical details are reduced by assigning them to ranges.
Claim 10
Dependent Claim 18 words
The system of claim 7 , wherein the fine numerical details are reduced by assigning them to bins.
Claim 11
Dependent Claim 17 words
The system of claim 7 , wherein the fine numerical details are reduced by correlating their values.
Claim 12
Dependent Claim 17 words
The system of claim 7 , wherein the fine numerical details are reduced by determining their covariances.
Claim 13
Dependent Claim 15 words
The system of claim 7 , wherein the fine numerical details are reduced by scaling.
Claim 14
Independent Claim 113 words
A method for performing data mining applications, comprising: (a) managing a relational database stored on one or more data storage devices connected to a computer; and (b) performing an analytic algorithm for clustering in the computer, wherein the analytic algorithm for clustering includes SQL statements performed by the relational database management system for reducing data retrieved from the relational database in bulk by reducing the number of columns or rows in the data, the analytic algorithm for clustering includes programmatic iteration for operating on the reduced data to find clusters therein, and the analytic algorithm for clustering creates at least one analytic model within an analytic logical data model from the reduced data.
Claim 15
Independent Claim 113 words
A method for performing data mining applications, comprising: (a) managing a relational database stored on one or more data storage devices connected to a computer; and (b) performing an analytic algorithm for clustering in the computer, wherein the analytic algorithm for clustering includes SQL statements performed by the relational database management system for reducing data retrieved from the relational database in bulk by reducing the number of columns or rows in the data, the analytic algorithm for clustering includes programmatic iteration for operating on the reduced data to find clusters therein, and the analytic algorithm for clustering creates at least one analytic model within an analytic logical data model from the reduced data.
Claim 16
Dependent Claim 40 words
The method of claim 13 , wherein the computer is a massively parallel processing (MPP) computer system, and the performing step further comprises executing the analytic algorithm for clustering concurrently in parallel on the massively parallel processing (MPP) computer systen.
Claim 17
Dependent Claim 21 words
The method of claim 13 , wherein the analytic algorithm for clustering uses a category utility (CU) function for its analysis.
Claim 18
Dependent Claim 37 words
The method of claim 13 , wherein the analytic algorithm for clustering is implemented as a combination of SQL statements performed by the relational database management system and the programmatic iteration is performed by an application prograrm.
Claim 19
Dependent Claim 16 words
The method of claim 16 , wherein the application program comprises a Data Reduction Utility Program.
Claim 20
Dependent Claim 35 words
The method of claim 16 , wherein the relational database management system executes the SQL statements to reduce data from the relational database and the application program performs the programmatic iteration to find clusters therein.
Claim 21
Dependent Claim 28 words
The method of claim 13 , wherein the SQL statements preprocesse the data in the relational database to reduce fine numerical details therein to create the reduced data.
Claim 22
Dependent Claim 18 words
The method of claim 19 , wherein the fine numerical details are reduced by assigning them to ranges.
Claim 23
Dependent Claim 18 words
The method of claim 19 , wherein the fine numerical details are reduced by assigning them to bins.
Claim 24
Dependent Claim 17 words
The method of claim 19 , wherein the fine numerical details are reduced by correlating their values.
Claim 25
Dependent Claim 17 words
The method of claim 19 , wherein the fine numerical details are reduced by determining their covariances.
Claim 26
Dependent Claim 15 words
The method of claim 19 , wherein the fine numerical details are reduced by scaling.
Claim 27
Dependent Claim 120 words
An article of manufacture comprising logic embodying a method for performing data mining applications, comprising: (a) managing a relational database stored on one or more data storage devices connected to a computer; and (b) performing an analytic algorithm for clustering in the computer, wherein the analytic algorithm for clustering includes SQL statements performed by the relational database management system for reducing data retrieved from the relational database in bulk by reducing the number of columns or rows in the data, the analytic algorithm for clustering includes programmatic iteration for operating on the reduced data to find clusters therein, and the analytic algorithm for clustering creates at least one analytic model within an analytic logical data model from the reduced data.
Claim 28
Dependent Claim 120 words
An article of manufacture comprising logic embodying a method for performing data mining applications, comprising: (a) managing a relational database stored on one or more data storage devices connected to a computer; and (b) performing an analytic algorithm for clustering in the computer, wherein the analytic algorithm for clustering includes SQL statements performed by the relational database management system for reducing data retrieved from the relational database in bulk by reducing the number of columns or rows in the data, the analytic algorithm for clustering includes programmatic iteration for operating on the reduced data to find clusters therein, and the analytic algorithm for clustering creates at least one analytic model within an analytic logical data model from the reduced data.
Claim 29
Dependent Claim 42 words
The article of manufacture of claim 25 , wherein the computer is a massively parallel processing (MPP) computer system, and the performing step further comprises executing the analytic algorithm for clustering concurrently in parallel on the massively parallel processing (MPP) computer system.
Claim 30
Dependent Claim 23 words
The article of manufacture of claim 25 , wherein the analytic algorithm for clustering uses a category utility (CU) function for its analysis.
Claim 31
Dependent Claim 39 words
The article of manufacture of claim 25 , wherein the analytic algorithm for clustering is implemented as a combination of SQL statements performed by the relational database management system and the programmatic iteration is performed by an application program.
Claim 32
Dependent Claim 18 words
The article of manufacture of claim 28 , wherein the application program comprises a Data Reduction Utility Program.
Claim 33
Dependent Claim 37 words
The article of manufacture of claim 28 , wherein the relational database management system executes the SQL statements to reduce data from the relational database and the application program performs the programmatic iteration to find clusters therein.
Claim 34
Dependent Claim 30 words
The article of manufacture of claim 25 , wherein the SQL statements preprocesse the data in the relational database to reduce fine numerical details therein to create the reduced data.
Claim 35
Dependent Claim 20 words
The article of manufacture of claim 31 , wherein the fine numerical details are reduced by assigning them to ranges.
Claim 36
Dependent Claim 20 words
The article of manufacture of claim 31 , wherein the fine numerical details are reduced by assigning them to bins.
Claim 37
Dependent Claim 19 words
The article of manufacture of claim 31 , wherein the fine numerical details are reduced by correlating their values.
Claim 38
Dependent Claim 19 words
The article of manufacture of claim 31 , wherein the fine numerical details are reduced by determining their covariances.
Claim 39
Dependent Claim 17 words
The article of manufacture of claim 31 , wherein the fine numerical details are reduced by scaling.

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2007-08-03 2008-02-02 2008-08-03 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2011-08-03 2012-02-02 2012-08-03 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2015-08-03 2016-02-02 2016-08-03 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag