Data processing: database and file management or data structures – Database design – Data structure types
Patent
1995-12-01
1998-05-26
Black, Thomas G.
Data processing: database and file management or data structures
Database design
Data structure types
707200, G06F 1730
Patent
active
057583536
ABSTRACT:
A computer storage system and processing method for indexing and accessing data stored in the computer storage system, comprising a compact multi-way search tree structure. The method employs a B-tree like search algorithm that is independent of key type or key length because all keys in index blocks are encoded by a log.sub.2 M bit surrogate, where M is the maximal key length. A buffer consisting of a sorted list of key values can be directly transformed into a representation of a C.sub.0 -tree.
REFERENCES:
patent: 4429385 (1984-01-01), Cichelli et al.
patent: 4468728 (1984-08-01), Wang
patent: 4586027 (1986-04-01), Tsukiyama et al.
patent: 4611272 (1986-09-01), Lomet
patent: 4677550 (1987-06-01), Ferguson
patent: 4945475 (1990-07-01), Bruffey et al.
patent: 5036457 (1991-07-01), Glaser et al.
patent: 5093779 (1992-03-01), Sakurai
patent: 5121493 (1992-06-01), Ferguson
patent: 5202986 (1993-04-01), Nickel
patent: 5204958 (1993-04-01), Cheng et al.
patent: 5210870 (1993-05-01), Baum et al.
patent: 5274805 (1993-12-01), Ferguson et al.
patent: 5283894 (1994-02-01), Deran
patent: 5293616 (1994-03-01), Flint
patent: 5301314 (1994-04-01), Gifford et al.
patent: 5303367 (1994-04-01), Leenstra, Sr. et al.
patent: 5307486 (1994-04-01), Nakamigawa
patent: 5404513 (1995-04-01), Powers et al.
patent: 5408652 (1995-04-01), Hayashi et al.
patent: 5497485 (1996-03-01), Ferguson et al.
patent: 5551027 (1996-08-01), Choy et al.
patent: 5555409 (1996-09-01), Leenstra, Sr. et al.
patent: 5557786 (1996-09-01), Johnson, Jr.
Ratko Orlandic, "Design, Analysis and Applications of Compact 0-Complete Trees," May 1989, 185p.
Biliris, "The Performance of Three Database Storage Structures for Managing Large Objects," AT&T Bell Laboratories, Murray Hill, New Jersey, 1992, pp. 276-285.
Orlandic, "Design, Analysis and Applications of Compact 0-Complete Trees," Dissertation, School of Engineering and Applied Science, University of Virginia, May 1989, 185p.
Orlandic, "A High-Precision Spatial Access Method Based on a New Linear Representation of Quadress," Proceedings of the ISMM International Conference, Information and Knowledge Management CIKM-92, Baltimore, Maryland, Nov. 8-11, 1992, pp. 499-508.
Orlandic, "Problems of Content-Based Retrieval in Image Databases," Proceedings Third Symposium on New Generation Knowledge Engineering, IAKE 1992, Washington, D.C., Nov. 1992, pp. 374-384.
Orlandic et al., "Q.sub.0 -Tree: A Dynamic Structure for Accessing Spatial Objects with Arbitrary Shapes," Institute for Parallel Computation, School of Engineering and Applied Science, University of Virginia, Charlottesville, Virginia, Dec. 6, 1991, 41p.
Pfaltz, "The ADAMS Language: A Tutorial and Reference Manual," Department of Computer Science, University of Virginia, Charlottesville, Virginia, Apr. 1993, 67p.
Pfaltz et al., "Implementing Subscripted Identifiers in Scientific Databases," Lecture Notes in Computer Science 420, Springer-Verlag, Berlin, Apr. 3-5, 1990, pp. 80-91.
Donald E. Knuth, "The Art of Computer Programming," Sorting and Searching, vol. 3, 1973, pp. 471-479.
Orlandic et al., "Compact O-Complete Trees," Proceedings of the 14th VLDB Conference, Los Angeles, California, 1988, pp. 372-381.
Orlandic et al., "Analysis of Compact O-Complete Trees: A New Access Method to Large Databases," Lecture Notes in Computer Science, Fundamentals of Computational Theory, International Conference FCT '89., Aug. 21-25, 1989, pp. 362-371.
Normann et al., Abstract of "Recent experience with C-tree--a data management system," Europhysics Conference on Control Systems for Experimental Physics. Proceedings (CERN 90-08), 1990, pp. 167-169.
Kida et al., Abstract of "A topological condition imposed on the natural frequencies of two element kind network," Transactions of the Institute of Electronics and Communication Engineers of Japan, Section E, vol. E60, No. 8, 1977, pp. 417-418.
Werelius, Abstracts of "C file libs reviewed: Ten packages for file management form C are put through real-world paces to test speed and flexibility," Buyer and Vendor Guide, DBMV v. 4 n.8, 1991, pp. 70-75.
Bender, Abstract of "B-Tree/ISAM file handlers," Micro/Systems Journal: For The Advanced Computer User, Jan./Feb. 1987, pp. 58-60.
Aoe, Abstract of "Computer algorithms: key search strategies," IEEE Computer Society Technology Series., 1991, pp. 1-139.
Smith, Abstract of "New Approaches to Balanced Tree Data Structures (Simple Balanced Search Tree)," Univ. of Louisville, vol. 55/02-B of Dissertation Abstracts International, 1993, pp. 497-617.
Johnson, Abstract of "Treemaps: Visualizing Hierarchical and Categorical Data," University of Maryland, vol. 55/04-B of Dissertation Abstracts International, 1993, pp. 1516-1849.
Fachini, Abstract of "C-Tree Systolic Automata," Theoretical Computer Science, V56, N2, 1988, pp. 155-186.
Liu, Abstract of "The distances between unrooted and cyclically ordered trees and their computing methods," IEICE Transactions on Information and Systems, vol. E77-D, No. 10, 1994, pp. 1094-1105.
Hulten, "An index organization for applications with highly skewed access patterns," 5th International Conference on Software Engineering, Mar. 9-12, 1981, pp. 71-78.
"E-Mail Message to J. Marquis", Pfalte, Aug. 24, 1995.
Black Thomas G.
Ho Ruay Lian
Sand Technology Systems International, Inc.
LandOfFree
Storage and retrieval of ordered sets of keys in a compact 0-com does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Storage and retrieval of ordered sets of keys in a compact 0-com, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Storage and retrieval of ordered sets of keys in a compact 0-com will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-1978822