Claims
- 1. (Cancelled)
- 2. (Cancelled)
- 3. (Cancelled)
- 4. (Cancelled)
- 5. (Cancelled)
- 6. (Cancelled)
- 7. (Cancelled)
- 8. (Cancelled)
- 9. (Cancelled)
- 10. (Cancelled)
- 11. (Cancelled)
- 12. (Cancelled)
- 13. (Cancelled)
- 14. (Cancelled)
- 15. (Cancelled)
- 16. (Cancelled)
- 17. (Cancelled)
- 18. (Cancelled)
- 19. (Cancelled)
- 20. (Cancelled)
- 21. (Cancelled)
- 22. (Cancelled)
- 23. (Cancelled)
- 24. (Cancelled)
- 25. (Cancelled)
- 26. (Cancelled)
- 27. (Cancelled)
- 28. (Cancelled)
- 29. (Cancelled)
- 30. (Cancelled)
- 31. (Cancelled)
- 32. (Cancelled)
- 33. (Cancelled)
- 34. (Cancelled)
- 35. (Cancelled)
- 36. A method for organizing data into a database having dual structures that facilitate locating desired information included in the database, comprising the steps of:
(a) generating a tree data structure that defines a hierarchical relationship of the data; and (b) generating an ordered array of data elements included in the data.
- 37. The method of claim 36, wherein the tree structure includes a top level of said hierarchical relationship of the data that is a subject level, and a bottom level of said hierarchical relationship of the data that is a database record level.
- 38. The method of claim 37, wherein an intermediate level of said hierarchical relationship of the data includes at least one of a category level and a subcategory level.
- 39. The method of claim 36, wherein the step of generating the tree data structure comprises the step of providing at least one pointer from a node of the tree data structure to at least one of a first child, a next sibling, and a parent.
- 40. The method of claim 36, wherein the ordered array comprises components of the data that are only associated with lower hierarchical levels comprising database records, and not associated with lower hierarchical levels that comprise other types of data.
- 41. The method of claim 40, wherein the step of generating said ordered array comprises the step of organizing the components in a desired order.
- 42. The method of claim 41, wherein the step of organizing comprises the step of alphabetizing the components.
- 43. The method of claim 41, wherein the step of organizing comprises the step of storing said ordered array in a memory so as to achieve said desired order.
- 44. The method of claim 41, wherein the step of organizing comprises the step of providing an attribute to each component of said ordered array, said attribute defining a position of each component in said ordered array, to determine an order with which each component of the ordered array is displayed.
- 45. The method of claim 36, wherein the step of generating the ordered array comprises the step of organizing selected subjects, categories, and subcategories of the data into a desired order, each selected subject being associated with no lower level category, and each selected category and each selected subcategory being associated with no lower level subcategory.
- 46. The method of claim 45, further comprising the step of alphabetizing said selected subjects, categories, and subcategories to achieve the desired order.
- 47. A database comprising:
(a) a first data structure that defines a hierarchical relationship of data included in the database; and (b) a second data structure that comprises an ordered array at a defined level of the hierarchical relationship.
- 48. The database of claim 47, wherein a top level of said hierarchical relationship comprises a subject level, and a bottom level of said hierarchical relationship comprises a record level.
- 49. The database of claim 47, wherein an intermediate level of said hierarchical relationship comprises at least one of a category level, and a subcategory level.
- 50. The database of claim 47, wherein the first data structure comprises at least one pointer associated with a node in the first data structure and pointing to at least one of a first child, a next sibling, and a parent, associated with the node.
- 51. The database of claim 47, wherein the defined level of the hierarchical relationship is a second lowest level of each branch of the first data structure.
- 52. The database of claim 47, wherein the ordered array is alphabetized.
- 53. The database of claim 47, wherein said ordered array includes an attribute associated with each component of the data comprising said ordered array, said attribute defining a position of each component in said ordered array, to determine an order with which each component of the ordered array is displayed to a user.
RELATED APPLICATIONS
[0001] This application is based on a prior co-pending U.S. provisional application Ser. No. 60/238,946, filed on Oct. 9, 2000, the benefit of the filing date of which is hereby claimed under 35 U.S.C. § 119(e).
Provisional Applications (1)
|
Number |
Date |
Country |
|
60238946 |
Oct 2000 |
US |
Divisions (1)
|
Number |
Date |
Country |
Parent |
09969170 |
Oct 2001 |
US |
Child |
10839564 |
May 2004 |
US |