Abstract: A data structure, which includes a plurality of sub-data structures, is created. The sub-data structures are ordered based on ranges of key masks associated with the sub-data structures. In particular, in one example, the sub-data structures are linked in a list in ascending order of key mask ranges, thus, creating an ordered list of sub-data structures. The ordered data structure can be modified by adding new nodes to existing sub-data structures or by adding new sub-data structures. Further, nodes or sub-data structures can be removed from the ordered data structure. The data structure can also be searched in order to collect target records associated with requested keys of the data structure.

Abstract: The preferred embodiment of the present invention provides a method and apparatus for storing and accessing data. The preferred embodiment hybrid tree-array database provides the ability to perform fast searching using tree database search techniques and the ability to search all user data fields using array search techniques. In particular, fast key searching as a typical tree database and sequential array searching of all data fields as a typical array database are provided in a single database, without requiring the user data be duplicated and stored in two separate databases. Thus, the preferred embodiment provides searching flexibility without the excessive storage requirements and complexity inherent in managing separate array and tree databases. The preferred embodiment also provides the advantage of allowing individual users of the database to search the data using either tree or array search techniques without requiring any detailed knowledge of the dual nature of the hybrid tree-array database.