Organising data in a database

Details Organising data in a database Organising data in a database

2002-02-19

2009-08-18

Breene, John E (Department: 2162)

Data processing: database and file management or data structures

Database design

Data structure types

C707S793000, C707S793000

Reexamination Certificate

active

07577673

ABSTRACT:
A database is provided in which conclusion sets (20, 22, 24, 26, 28and30) are divided into a hierarchical series of levels (level 1, level 2, level 3). Data is added to a conclusion set at the first level (level 1) until such time as that conclusion set is full. Data is then migrated from the conclusion set (20) to its subordinate conclusion sets (24, 26) therefore reducing the amount of disc access required to add data to the database since multiple entries are migrated in relatively few disc access operations.

REFERENCES:
patent: 5018060 (1991-05-01), Gelb et al.
patent: 5130936 (1992-07-01), Sheppard et al.
patent: 5644766 (1997-07-01), Coy et al.
patent: 5734791 (1998-03-01), Acero et al.
patent: 5852822 (1998-12-01), Srinivasan et al.
patent: 5893102 (1999-04-01), Maimone et al.
patent: 6269353 (2001-07-01), Sethi et al.
patent: 6564197 (2003-05-01), Sahami et al.
patent: 2002/0073104 (2002-06-01), Nunez
patent: 2006/0218121 (2006-09-01), Keith, Jr.
patent: 0 522 363 (1993-01-01), None
Mondal et al, “R-tree-based Data Migration and Self-Tuning Strategies in Shared-Nothing Spatial Databases”, GIS'01, Nov. 9-10, 2001 [online], Sep. 2001 [Retrieved on Mar. 16, 2009]. Retrieved from the Internet: <URL: http://portal.acm.org/ ft—gateway.cfm?id=512169&type=pdf&coll= ACM&dl=ACM&CFID=26909136&CFTOKEN=71423843>.
Slagle et al., “Experiments with M & N Tree-searching Program”, Communications of the ACM vol. 13, No. 3 [online], Mar. 1970 [Retrieved on Mar. 16, 2009]. Retrieved from the Internet: <URL: http://portal.acm.org/ft—gateway.cfm?id=362054&type=pdf&coll= ACM&dl=ACM&CFID=26909136&CFTOKEN=71423843>.
Dailey, W.H., “On Generating Binary Decision Trees with Minimum Nodes” [online], Dec. 1975 [Retrieved on Mar. 16, 2009]. Retrieved from the Internet < URL: http://portal.acm.org/ ft—gateway.cfm?id=987688&type=pdf&coll=ACM&dl= ACM&CFID=26909136&CFTOKEN=71423843>.
Schkolnick, Mario, “A Clustering Algorithm for Hierarchical Structures”, ACM Transactions on Database Systems vol. 2, No. 1, [online] Mar. 1997, P-27-44 [ Retrieved on Mar. 16, 2009]. Retrieved from the Internet: <URL: http://portal.acm.org/ ft—gateway.cfm?id=320531&type=pdf&coll=ACM&dl= ACM&CFID=26909136&CFTOKEN=71423843>.
Srivastava J. et al., “EfficientAlgorithms for Maintenance of Large Database Indexes”, Data Engineering, 1988. Proceedings. Fourth International Conference on, Los Angeles, CA, pp. 402-408.
H.V. Jagadish et al., “Incremental Organization for Data Recording and Warehousing”, Proceedings of the 23rdVLDB Conference, Athens, Greece, 1997, pp. 16-25.
Jochen Van Den Bercken et al., “A Generic Approach to Bulk Loading Multidimensional Index Structures”, Proceedings of the 23rdVLDB Conference, Athens, Greece, 1997, 10 pages.
Examination Report dated May 18, 2005 from copending European Application No. 02 712 086.4-2201.
Summons to Oral Proceedings dated Jan. 3, 2008 from counterpart European Application No. 02712086.4.
Response dated Sep. 6, 2005 with amended pages from counterpart European Application No. 02712086.4.

Affiliated with

Also associated with

Rating

Organising data in a database does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Organising data in a database, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Organising data in a database will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4121671