Using object name to create unique B+-tree key
Original Publication Date: 2003-Sep-08
Included in the Prior Art Database: 2003-Sep-08
Disclosed is a method to form an actual B+ Tree key value by concatentating the object name onto the end of the search "key" value. In the following example, the B+ Tree would store entries with unique keys "xyzA" and "xyzB" corresponding to the entries for objects A and B, respectively. In developing search databases using a B+ Tree as the underlying implementation, it may be required to create entries where the key values are not unique. For example, two objects A and B may both have the same key value "xyz". This method is useful when it is needed to use a B+ Tree to get fast access, but still allow a query of the key to return all objects with that non-unique "key" (e.g. a query on "xyz" would return both A and B).