System of organizing catalog data for searching and retrieval
First Claim
1. A method of organizing indices and keys of a tree-like data structure for electronic catalog searching and retrieval, said method including the steps of:
- storing indices according to categories and subcategories in an array of indices, wherein indices of a category or subcategory are stored contiguously in said array, each index having one or more means for linking said index with a subordinate intermediate index or a leaf index, so as to record the interrelationship of said indices in said tree-like data structure;
storing said keys according to said categories and subcategories in an array of keys, wherein keys of a given index are stored contiguously with keys of any indices at the same corresponding category or subcategory level and keys of any subordinate subcategories within a category or subcategory are stored hierarchically in said array of keys;
linking each index of said array of indices with one or more corresponding keys of said array of keys corresponding to the category or subcategory associated with said index.
2 Assignments
0 Petitions
Accused Products
Abstract
A method, an apparatus, and a computer program product for organizing and searching catalogs based on compacting a hierarchical structure (150, 500) into related arrays (210, 310, 410, 610; and 220, 320, 420, 620) are disclosed. This involves the steps of: storing indices (1-9) according to categories and subcategories in an array of indices (310), storing the keys (S54-S48) according to the categories and subcategories in an array (320) of keys, and linking each index of the array (310) of indices with one or more corresponding keys of the array (320) of keys corresponding to the category or subcategory associated with the index. The indices of a category or subcategory are stored contiguously in the array (310). Each index has one or more pointers recording the interrelationship of the indices. The keys of a given index are also stored contiguously with keys of any indices at the same corresponding category or subcategory level.
104 Citations
48 Claims
-
1. A method of organizing indices and keys of a tree-like data structure for electronic catalog searching and retrieval, said method including the steps of:
-
storing indices according to categories and subcategories in an array of indices, wherein indices of a category or subcategory are stored contiguously in said array, each index having one or more means for linking said index with a subordinate intermediate index or a leaf index, so as to record the interrelationship of said indices in said tree-like data structure;
storing said keys according to said categories and subcategories in an array of keys, wherein keys of a given index are stored contiguously with keys of any indices at the same corresponding category or subcategory level and keys of any subordinate subcategories within a category or subcategory are stored hierarchically in said array of keys;
linking each index of said array of indices with one or more corresponding keys of said array of keys corresponding to the category or subcategory associated with said index. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. An apparatus for organizing indices and keys of a tree-like data structure for electronic catalog searching and retrieval, said apparatus including:
-
means for storing indices according to categories and subcategories in an array of indices, wherein indices of a category or subcategory are stored contiguously in said array, each index having one or more means for linking said index with a subordinate intermediate index or a leaf index, so as to record the interrelationship of said indices in said tree-like data structure;
means for storing said keys according to said categories and subcategories in an array of keys, wherein keys of a given index are stored contiguously with keys of any indices at the same corresponding category or subcategory level and keys of any subordinate subcategories within a category or subcategory are stored hierarchically in said array of keys; and
means for linking each index of said array of indices with one or more corresponding keys of said array of keys corresponding to the category or subcategory associated with said index. - View Dependent Claims (10, 11, 12, 13, 14, 15, 16)
-
-
17. A computer program product having a computer readable medium having a computer program recorded therein for organizing indices and keys of a tree-like data structure for electronic catalog searching and retrieval, said computer program product including:
-
means for storing indices according to categories and subcategories in an array of indices, wherein indices of a category or subcategory are stored contiguously in said array, each index having one or more means for linking said index with a subordinate intermediate index or a leaf index, so as to record the interrelationship of said indices in said tree-like data structure;
means for storing said keys according to said categories and subcategories in an array of keys, wherein keys of a given index are stored contiguously with keys of any indices at the same corresponding category or subcategory level and keys of any subordinate subcategories within a category or subcategory are stored hierarchically in said array of keys; and
means for linking each index of said array of indices with one or more corresponding keys of said array of keys corresponding to the category or subcategory associated with said index. - View Dependent Claims (18, 19, 20, 21, 22, 23, 24)
-
-
25. A method of organizing indices and keys of a tree-like data structure for electronic catalog searching and retrieval, said method including the steps of:
-
storing indices according to sibling categories and subcategories in an array of indices, wherein indices of a sibling category or subcategory are stored contiguously in said array, each index having one or more means for linking said index with a subordinate intermediate index or a leaf index, so as to record the interrelationship of said indices in said tree-like data structure;
storing said keys according to said sibling categories and subcategories in an array of keys, wherein keys of a given index are stored contiguously with keys of any indices at the same corresponding sibling category or subcategory level;
linking each index of said array of indices with one or more corresponding keys of said array of keys corresponding to the sibling category or subcategory associated with said index. - View Dependent Claims (26, 27, 28, 29, 30, 31, 32)
-
-
33. An apparatus for organizing indices and keys of a tree-like data structure for electronic catalog searching and retrieval, said apparatus including:
-
means for storing indices according to sibling categories and subcategories in an array of indices, wherein indices of a sibling category or subcategory are stored contiguously in said array, each index having one or more means for linking said index with a subordinate intermediate index or a leaf index, so as to record the interrelationship of said indices in said tree-like data structure;
means for storing said keys according to said sibling categories and subcategories in an array of keys, wherein keys of a given index are stored contiguously with keys of any indices at the same corresponding sibling category or subcategory level;
means for linking each index of said array of indices with one or more corresponding keys of said array of keys corresponding to the sibling category or subcategory associated with said index. - View Dependent Claims (34, 35, 36, 37, 38, 39, 40)
-
-
41. A computer program product having a computer readable medium having a computer program recorded therein for organizing indices and keys of a tree-like data structure for electronic catalog searching and retrieval, said computer program product including:
-
means for storing indices according to sibling categories and subcategories in an array of indices, wherein indices of a sibling category or subcategory are stored contiguously in said array, each index having one or more means for linking said index with a subordinate intermediate index or a leaf index, so as to record the interrelationship of said indices in said tree-like data structure;
means for storing said keys according to said sibling categories and subcategories in an array of keys, wherein keys of a given index are stored contiguously with keys of any indices at the same corresponding sibling category or subcategory level;
means for linking each index of said array of indices with one or more corresponding keys of said array of keys corresponding to the sibling category or subcategory associated with said index. - View Dependent Claims (42, 43, 44, 45, 46, 47, 48)
-
Specification