High-speed data base query method and apparatus

Data processing: database and file management or data structures – Database design – Data structure types

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

707 3, 707 10, G06F 1730

Patent

active

058528210

ABSTRACT:
A server performing an indexing method of data management to create and maintain indexes more efficiently than existing indexing approaches is described. The server is disposed between an application program and a DBMS and is coupled to a data base located within the DBMS. The data base has an ordered set of data values stored in memory. Each data value has a bit pattern and an identifier associated therewith. The server creates a plurality of bit vectors such that the number of bit vectors created equals the longest length bit pattern for the values. The server accesses one of the values stored in the data base. Each bit of the bit pattern for the value is then assigned by the server to a unique position in successive bit vectors. The bits are assigned to identical unique positions in each of the successive bit vectors. The server repeats the above-described accessing and assigning steps for each remaining value of the set to form an index of bit vectors for the values. Methods are provided for improving the performance of database queries when using bit-vector or HighNonGroup (HNG) indexes. Such queries include, for instance, aggregate operations specified in an SQL statement, such as SUM, MAX, MIN, and AVG operations. Specific methods described include optimizing "range" comparisons by reducing bit operations, optimization of MAX and MIN operations, optimization of SUM and AVG operations, implementation of a "Datepart" index, and execution of SUBSTRING predicates in an HNG index.

REFERENCES:
patent: 4606002 (1986-08-01), Waisman et al.
patent: 4677550 (1987-06-01), Ferguson
patent: 4776026 (1988-10-01), Ueyama
patent: 5153591 (1992-10-01), Clark
patent: 5293616 (1994-03-01), Flint
patent: 5377348 (1994-12-01), Lau et al.
patent: 5404510 (1995-04-01), Smith et al.
patent: 5495608 (1996-02-01), Antoshenkov
patent: 5649181 (1997-07-01), French et al.
patent: 5727196 (1998-03-01), Strauss Jr., et al.
patent: 5794228 (1998-08-01), French et al.
patent: 5794229 (1998-08-01), French et al.
Perrizo et al., "Domain Vector Accelerator (DVA): A Query Accelerator for Relational Operations " IBM Corp., Rochester, MN, IEEE, Data Engineering, 1991 7.sup.th Int'l, Dec. 1990, pp. 491-498.
Brodie, M. and Manola, F., "Database Management: A Survey," Computer Corporation of America, May 1987, pp. 1-24.
Hanson-Smith, Ltd., "Advantage Series System Overview, Version 2.0," Computer Corporation of America, 1990, pp. 1-132.
Reinartz, K., "Aspects of vertical mode in multiprocessor systems, unconventional computation on conventional processors," Second International Specialist Seminar on the Design and Application of Parallel Digital Processors, IEEE, 1991, ppp. 48-54.
Chu et al., "A Transaction-Based Approach to Vertical Partitioning for Relational Database Systems," IEEE, IEEE Transactions on Software Engineering, v19, n8, Aug. 1993, pp. 804-812.
Naecker, P., "RDBMS Maturity," DEC Professional, v10, n12, Nov. 1991, p.
Snellen, D., "Ingres Table Structures, " DBMS, v5, n8, Jul. 1992, p. 60(3)
"Riding High on Expressway 103," Steve Roti, DBMS, v7, n8, p. 90-93.
"Faster Data Warehouses," Herb Edelstein, InformationWeek, n 556m p. 77, retrieved from Dialog File 647 (6 pages) at http:/www.dialogweb.com on Sep. 5, 1998.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

High-speed data base query method and apparatus does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with High-speed data base query method and apparatus, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and High-speed data base query method and apparatus will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2056191

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.