 |
 |
|
|
|
|
Title: |
US5864841:
System and method for query optimization using quantile values of a large unordered data set
[ Derwent Title ]

|
Country: |
US United States of America

|
| |
Inventor: |
Agrawal, Rakesh; San Jose, CA
Swami, Arun Narasimha; San Jose, CA

|
Assignee: |
International Business Machines Corporation, Armonk, NY
other patents from INTERNATIONAL BUSINESS MACHINES CORPORATION (280070) (approx. 44,393)
News, Profiles, Stocks and More about this company

|
Published / Filed: |
1999-01-26
/ 1997-08-28

|
Application Number: |
US1997000920049

|
IPC Code: |
Advanced:
G06F 17/30;
Core:
more...
IPC-7:
G06F 17/30;

|
ECLA Code: |
G06F17/30S4P3T5S; G06F17/30S4P8A;

|
U.S. Class: |
Current:
707/002;
707/001;
707/003;
707/004;
Original:
707/002;
707/001;
707/003;
707/004;

|
Field of Search: |
707/002,4,1,3

|
Priority Number: |

|
Abstract: |
A database management system determines, in a single pass over an unordered database, the quantile information. The system sequentially compares each tuple in the data set to a test value, and then selectively inserts the tuple in a test set having a cardinality less than the cardinality of the data set based upon the comparison. The system next uses the quantile information to estimate the number of tuples in the database which satisfy a user-defined predicate to generate an efficient query plan.

|
Attorney, Agent or Firm: |
Gry Cary Ware & Freidenrich ;

|
Primary / Asst. Examiners: |
Amsbury, Wayne; Lewis, Cheryl

|
Maintenance Status: |
E2 Expired Check current status

|
INPADOC Legal Status: |
Show legal status actions
Family Legal Status Report

|
 |
 |
|
|
|
|
Foreign References: |
None

|
Other Abstract Info: |
DERABS G97-448261
DERG99-131657
DERABS G99-131657

|
Other References: |
"Mining Association Rules Between sets of items in large databases", R. Agrawal et al., ACM-089791-592, May 993, pp. 207-216.
"Equidepth Partitioning of a Data Set Based on Finding its Medians", A.P. Gurajada et al., IEEE TH0 355, Sep. 1991, pp. 32-101.
"The P2 Algorithm for Dynamic Calculation of Quantiles and Histograms without Storing Observations", R. Jain et al., Communications of the ACM, vol. 28, No. 10, Oct. 1985, pp. 1076-1085.
(10 pages)
Cited by 4 patents
"Equi-Depth Histograms for estimating selectivity factors for Multi-Dimensional Queries", M. Muralikrishna, ACM 0-89791-268, Mar. 1988, pp. 28-36.
"Accurate Estimation of the Number of Tuples Satisfying a Condition", G. Piatetsky-Shapiro, ACM 0-89791-198, Aug. 1984, pp. 256-276.
"Quantile Estimation from Grouped Data: The Cell Midpoint", B.W. Schmeiser et al., Comm. Statist. Simula. Computa., B6(3), 1977, pp. 221-234.
(14 pages)
Cited by 3 patents
"The Generation of Order Statistics in Digital Computer Simulation: A Survey", B.W. Schmeiser, pp. 137-140.
"Selection and Sorting With Limited Storage", J.I. Munro et al., Theoretical Computer Science 12, North-Holland Publishing Company, 1980, pp. 35-323.
David J. DeWitt, Jeffrey F. Naughton, and Donovan A. Schneider, "Parallel Sorting on a Shared-Nothing Architecture using Probabilistic Splitting", IEEE, p. 280-291, Jan. 1991.
M. Pawlak and U. Stradtmuller, "On Nonparametric Curve Estimation With Compressed Data", IEEE, p. 253, Jan. 1995.

|


|
Nominate this for the Gallery...

|
|