B tree structure and method
March 14, 2016. Estimated Expiration Date is calculated based on simple USPTO term provisions. It does not account for terminal disclaimers, term adjustments, failure to pay maintenance fees, or other factors which might affect the term of a patent.Patent ReferencesPortable navigational planning device Batching data objects for recording on optical disks with maximum object count Method of managing data in a data storage hierarchy and a data storage hierarchy therefor with removal of the least recently mounted medium Write once read many optical disc storage system having directory for storing virtual address and corresponding up-to-date sector address Databases system for permitting concurrent indexing and reloading of data by early simulating the reload process to determine final locations of the data Digital data storage system with improved data migration Non-blocking serialization for removing data from a shared cache Three-state virtual volume system for managing document storage to permanent media Method and apparatus for writing files on nonerasable storage medium Data storage system with set lists which contain elements associated with parents for defining a logical hierarchy and general record pointers identifying specific data sets Patent #: 5454101 InventorAssigneeApplicationNo. 615732 filed on 03/14/1996US Classes:707/3Query processing (i.e., searching)ExaminersPrimary: Black, Thomas G.Assistant: Choules, Jack M. Attorney, Agent or FirmInternational ClassG06F 017/30AbstractA novel B tree data structure is taught and implemented for use in conjunction with a tertiary storage system. The tertiary storage system utilizes three levels of memory hierarchy: primary memory, such as RAM; read-write secondary storage, such as disk memory; and lower speed, and less expensive mass storage, for example a CD-ROM. A novel B tree is utilized to access data stored in two or more types of memory, such as a CD-ROM memory and a disk drive memory, and adapts for the provision of updated data stored on the hard disk which either replaces or supplements data stored on the CD-ROM. The B tree includes, for each data bucket, a pointer for both a CD-ROM and a disk drive location, and are, in certain embodiments, used in conjunction with a bit mask to indicate the presence of valid data in a first one of the memories, such as CD-ROM, and, if desired, a bloom filter associated with data stored in the second memory type, such as a magnetic disk, in order to speed accesses. The B tree of this invention is capable of being split, as needed, when entries are inserted into memory.Other References
| |
