Abstract: Methods, a data structure and computer readable mediums address newly-defined code points in a Unicode index of characters by allowing processing of strings that use those newly-defined code points although a database holding an index of Unicode characters has not yet been updated. A method is directed to processing strings including one or more code points associated with an index of code points mapped to an expandable alphabet, such as the Unicode index. The method includes tracking each string that has code points mapped to undefined items and processing the tracked strings outside the processing of strings with defined items. An embodiment provides for creating a database for maintaining the index to the code points mapped to the previously undefined items. For each code point mapped to a previously undefined item a table entry can be created so the entries identify newly defined code points to enable processing the tracked strings.

Abstract: Methods, a data structure and computer readable mediums address newly-defined code points in a Unicode index of characters by allowing processing of strings that use those newly-defined code points although a database holding an index of Unicode characters has not yet been updated. A method is directed to processing strings including one or more code points associated with an index of code points mapped to an expandable alphabet, such as the Unicode index. The method includes tracking each string that has code points mapped to undefined items and processing the tracked strings outside the processing of strings with defined items. An embodiment provides for creating a database for maintaining the index to the code points mapped to the previously undefined items. For each code point mapped to a previously undefined item a table entry can be created so the entries identify newly defined code points to enable processing the tracked strings.

Abstract: A computer method and storage structure for storing and accessing multidimensional data is provided. A tree manager provided by the present invention stores data such as pointers, variable length data records, other B-trees, and directories, in a Multidimensional B-tree (MDB-tree). An MDB-tree has an imbedded "parent-child" structure which allows subtrees to be stored within nodes. The subtrees contain subnodes, which, in turn, may contain subtrees. The nodes are indexed by a primary key value while the subnodes in a subtree are indexed by secondary key values. Nodes of a MDB-tree contain a key value table, a subnode table, and a data area. When the tree manager attempts to store a unit of data on a page and the unit of data is too large for the page, the tree manager attempts to split a node currently stored on the page (or the unit of data being inserted) into a subnode and a subtree. The subtree is then stored on a new page.