Method and apparatus for formatting information within a directory tree structure into an encyclopedia-like entry. The method includes performing a search by utilizing a selective one or more search methodologies including keyword search, hierarchical search, dichotomous key search, and parametric search to correlate a search criteria to a searchable database for generating one or more matching items, wherein the searchable database is formatted in the directory tree structure. The directory tree structure includes nodes comprising a collection of related data and branches comprising links between the nodes. Each matching item represents a node from within the directory tree structure. The method further includes selecting one of the matching items, formatting the collection of related data corresponding to the node of the selected matching item into an encyclopedia-like entry, and displaying the encyclopedia-like entry corresponding to the node of the selected matching item. The encyclopedia-like entry can include text, graphics, links to related topics within the directory tree structure, links to related web sites external to the directory tree structure, or any combination thereof. Utilizing the search methodologies can be performed by a server, preferably accessible over the internet through the public switched telephone network.

Method and apparatus for formatting information within a directory tree structure into an encyclopedia-like entry

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 log2M 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 C0-tree.

Storage and retrieval of ordered sets of keys in a compact 0-complete tree

Method and apparatus for organizing data by overlaying a searchable database with a directory tree structure. The method includes generating the directory tree structure that includes nodes comprising a designated category for each node and branches comprising links between the nodes, and generating one or more pointers. Each pointer corresponds to a specific node and the pointer links the specific node to an item of data within the searchable database. All pointers associated with the specific node link related items of data corresponding to the designated category. Each node within the directory tree structure can include a corresponding html address. Items of data can be web-based multimedia including audio, video, images, and appropriately formatted text, displayed in an encyclopedia-like format. Nodes, branches, and pointers within the directory tree structure can continually be added, edited, or deleted.

Method and apparatus for organizing data by overlaying a searchable database with a directory tree structure

A computer graphics system having a processor for generating objects for display, a multi-layered Z-buffer for storing data according to their relative depths, the processor also compositing the data stored in the Z-buffer, a frame buffer for storing composited data, a display for displaying an image as a number of pixels responsive to the composited data in the frame buffer, and two registers for facilitating the Z-buffering process is disclosed. One of the registers stores a number indicating how many of the layers in the Z-buffer contain visible data dependent on opacity of existing objects. In the other register, a number of addresses corresponding to each of the layers of the Z-buffer are stored. Each address specifies a location where data of one of the layers is stored. A determination is made as to which layer data associated with an incoming object is to be inserted. This determination depends on the contents of the first register as well as the value of the incoming object relative to those of objects already stored in the Z-buffer. The addresses of the second register are arranged to correspond to the appropriate layers in response to insertion of the incoming data.

Computer graphics system having high performance multiple layer Z-buffer

A method of and apparatus for performing a research task within a searchable database by interchangeably utilizing a multitude of search methodologies including keyword search, hierarchical search, and dichotomous key search. A search criteria is correlated to a searchable database for generating one or more matching items, wherein each matching item corresponds to a segment of the searchable database, and repeatedly utilizing one of the search methodologies to correlate a subsequent search criteria to one of the matching items for generating one or more subsequent matching items until the research task is completed. Utilizing the search methodologies can be performed by a server, preferably accessible over the internet through the public switched telephone network. According to another aspect, the method utilizes keyword search, hierarchical search, and parametric search methodologies. According to yet another aspect, the method utilizes keyword search, dichotomous key search, and parametric search methodologies. According to still yet another aspect, the method utilizes dichotomous key search, hierarchical search, and parametric search methodologies.

Method and apparatus for performing a research task by interchangeably utilizing a multitude of search methodologies

A method for sorting data in a computer data storage system that has particular advantages in implementing a key index tree structure. The sorting method uses buffer-size substrings to sort strings of key records into a linked list structure that can be directly transformed into an index tree. The sorting method also may be used for sorting large sets of data records in place on a computer storage system.

David E. Ferguson

Papers

Data sorting method