Method and apparatus for searching an index structure for TV-Anytime Forum metadata having location information for defining a multi-key
First Claim
1. A method of searching for metadata divided into fragments and stored in a computer-readable storage medium, using an index having a key index list section having a list of multi-keys and location information for defining the multi-keys, a key index section, and a sub-key index section, the method comprising:
- searching for and locating a multi-key in the index, wherein the multi-key meets search conditions of a combination of fields of the metadata; and
extracting a fragment of the metadata from the computer-readable storage medium by using the located multi-key, wherein the multi-key is a plurality of keys used simultaneously to locate and extract the fragment of metadata;
wherein with respect to comparison of values of a multi-key in size, the multi-key comprises fields (k1, k2, k3. . . kn) of the metadata which are prioritized (k1>
k2>
k3>
. . . Kn), and the combined fields are compared in sequence, starting from a first field having a highest order of priority, wherein the values are compared on an arithmetic basis where the values of the multi-key are alphabetical,wherein for two multi-key values, (a1, a2, . . . , an) and (b1, b2. . . , bn);
(a1, a2, . . . , an) is larger than (b1, b2, . . . , bn) if and only if there exists an integer i (0<
i<
n−
1) such that for every j (0<
i<
n−
1), aj=bj and ai<
bi;
(a1, a2, . . . , an) is smaller than (b1, b2, . . . , bn) if and only if there exists an integer i (0<
i<
n−
1) such that for every j (0<
i<
n−
1), aj=bj and ai <
bi; and
(a1, a2, . . . , an) is equal to (b1, 2, . . . , bn) if and only if for every i (0<
i<
n−
1), ai=bi.
0 Assignments
0 Petitions
Accused Products
Abstract
An index structure of metadata provided for searching for information on contents and a method for providing indices of the metadata, and a method and an apparatus for searching for the metadata using the index structure of the metadata are provided, in which the index structure of the metadata includes values of multi-keys and identification information of the metadata corresponding to the values of the multi-keys, wherein the multi-keys are structured by a combination of predetermined fields of the metadata.
10 Citations
26 Claims
-
1. A method of searching for metadata divided into fragments and stored in a computer-readable storage medium, using an index having a key index list section having a list of multi-keys and location information for defining the multi-keys, a key index section, and a sub-key index section, the method comprising:
-
searching for and locating a multi-key in the index, wherein the multi-key meets search conditions of a combination of fields of the metadata; and extracting a fragment of the metadata from the computer-readable storage medium by using the located multi-key, wherein the multi-key is a plurality of keys used simultaneously to locate and extract the fragment of metadata; wherein with respect to comparison of values of a multi-key in size, the multi-key comprises fields (k1, k2, k3. . . kn) of the metadata which are prioritized (k1>
k2>
k3>
. . . Kn), and the combined fields are compared in sequence, starting from a first field having a highest order of priority, wherein the values are compared on an arithmetic basis where the values of the multi-key are alphabetical,wherein for two multi-key values, (a1, a2, . . . , an) and (b1, b2. . . , bn); (a1, a2, . . . , an) is larger than (b1, b2, . . . , bn) if and only if there exists an integer i (0<
i<
n−
1) such that for every j (0<
i<
n−
1), aj=bj and ai<
bi;(a1, a2, . . . , an) is smaller than (b1, b2, . . . , bn) if and only if there exists an integer i (0<
i<
n−
1) such that for every j (0<
i<
n−
1), aj=bj and ai <
bi; and
(a1, a2, . . . , an) is equal to (b1, 2, . . . , bn) if and only if for every i (0<
i<
n−
1), ai=bi. - View Dependent Claims (2, 3, 4, 5, 6, 9)
-
-
7. A method of searching for metadata divided into fragments and stored in a computer-readable storage medium, using an index having a key index list section having a list of multi-keys and location information for defining the multi-keys, a key index section, and a sub-key index section, the method comprising:
-
searching for and locating a value of a multi-key in the index, wherein the key meets search conditions for a combination of fields of the metadata; and extracting a fragment of the metadata from the computer-readable storage medium corresponding to the located multi-key value, wherein the multi-key is a plurality of keys used simultaneously to locate and extract the fragment of metadata; wherein with respect to comparison of values of a multi-key in size, the multi-key comprises fields (k1, k2, k3, . . . kn) of the metadata which are prioritized (k1<
k2<
k3<
. . . Kn), and the combined fields are compared in sequence, starting from a first field having a highest order of priority, wherein the values are compared on an arithmetic basis where the values of the multi-key are alphabetical,wherein for two multi-key values, (a1, a2, . . . , an) and (b1, b2, . . . , bn);
(a1, a2, . . . , an) is larger than (b1, b2, . . . , bn) if and only if there exists an integer i (0<
i<
n−
1) such that for every j (0<
j<
n−
1), aj=bj and ai<
bi;(a1, a2, . . . , an) is smaller than (b1, b2, . . . , bn) if and only if there exists an integer i (0<
i<
n−
1) such that for every j (0<
j<
n−
1), aj=bj and ai<
bi; and(a1, a2, . . . , an) is equal to (b1, b2, . . . , bn) if and only if for every i (0<
i<
n−
1), ai=bi. - View Dependent Claims (8, 10)
-
-
11. An apparatus for searching for metadata divided into fragments, using an index having a key index list section having a list of multi-keys and location information defining the multi-keys, a key index section, and a sub-key index section, the apparatus comprising:
-
a central processing unit (CPU); an input unit receiving search conditions; and a control unit using the CPU to search the index of the metadata for a multi-key corresponding to the search conditions of a combination of fields of the metadata, and extracting a fragment of the metadata using the searched multi-key, wherein the multi-key is a plurality of keys used simultaneously to locate and extract the fragment of metadata; wherein with respect to comparison of values of a multi-key in size, the multi-key comprises fields (k1, k2, k3. . . kn) of the metadata which are prioritized (k1<
k2<
k3<
. . . Kn), and the combined fields are compared in sequence, starting from a first field having a highest order of priority, wherein the values are compared on an arithmetic basis where the values of the multi-key are alphabetical,wherein for two multi-key values, (a1, a2, . . . , an) and (b1, b2, . . . , bn); (a1, a2, . . . , an) is larger than (b1, b2, . . . , bn) if and only if there exists an integer i (0<
i<
n−
1) such that for every j (0<
j<
n−
1), aj=bj and ai<
bi;(a1, a2, . . . , an) is smaller than (b1, b2, . . . bn) if and only if there exists an integer i (0<
i<
n−
1) such that for every j (0<
j<
n−
1), aj=bj and ai<
bi; and(a1, a2, . . . , an) is equal to (b1, b2, . . . , bn) if and only if for every i (0<
i<
n−
1), ai=bi. - View Dependent Claims (12, 13, 14, 15, 16, 17)
-
-
18. An apparatus for searching for metadata divided into fragments, using an index having a key index list section having a list of multi-keys and location information defining the multi-keys, a key index section, and a sub-key index section, the apparatus comprising:
-
a central processing unit (CPU); an input unit receiving search conditions; and a control unit using the CPU to search the index of the metadata for a value of a multi-key corresponding to the search conditions of a combination of fields of the metadata, and extracting a fragment of the metadata using the searched value, wherein the multi-key is a plurality of keys used simultaneously to locate and extract the fragment of metadata; wherein with respect to comparison of values of a multi-key in size, the multi-key comprises fields (k1, k2, k3. . . kn) of the metadata which are prioritized (k1<
k2<
k3<
, . . . Kn), and the combined fields are compared in sequence, starting from a first field having a highest order of priority, wherein the values are compared on an arithmetic basis where the values of the multi-key are alphabetical,wherein for two multi-key values, (a1, a2, . . . , an) and (b1, b2, . . . , bn); (a1, a2, . . . , an) is larger than (b1, b2, . . . , bn) if and only if there exists an integer i (0<
i<
n−
1) such that for every j (0<
j<
n−
1), aj=bj and ai<
bi;(a1, a2, . . . , an) is smaller than (b1, b2, . . . , bn) if and only if there exists an integer i (0<
i<
n−
1) such that for every j (0<
j<
n−
1), aj=bj and ai<
bi; and(a1, a2, . . . , an) is equal to (b1, b2, . . . , bn) if and only if for every i (0<
i<
n−
1), ai=bi. - View Dependent Claims (19, 20, 21, 22, 23)
-
-
24. An apparatus for searching for metadata divided into fragments, using an index having a key index list section having a list of multi-keys and location information defining the multi-keys, a key index section, and a sub-key index section, the apparatus comprising:
-
a central processing unit (CPU); an input unit receiving search conditions of at least two keys of the metadata; and a control unit using the CPU to select from a list comprising a plurality of combinations of location information of a fragment and location information defining at least two keys within the fragment, a combination corresponding to the search conditions, wherein the multi-key is a plurality of keys used simultaneously to locate and extract the fragment of metadata; wherein with respect to comparison of values of a multi-key in size, the multi-key comprises fields (k1, k2, k3. . . kn) of the metadata which are prioritized (k1<
k2<
k3<
, . . . Kn), and the combined fields are compared in sequence, starting from a first field having a highest order of priority, wherein the values are compared on an arithmetic basis where the values of the multi-key are alphabetical,wherein for two multi-key values, (a1, a2, . . . , an) and (b1, b2, . . . , bn); (a1, a2, . . . , an) is larger than (b1, b2, . . . , bn) if and only if there exists an integer i (0<
i<
n−
1) such that for every j (0<
j<
n−
1), aj=bj and ai<
bi;(a1, a2, . . . , an) is smaller than (b1, b2, . . . , bn) if and only if there exists an integer i (0<
i<
n−
1) such that for every j (0<
j<
n−
1), aj=bj and ai<
bi; and(a1, a2, . . . , an) is equal to (b1, b2, . . . , bn) if and only if for every i (0<
i<
n−
1), ai=bi. - View Dependent Claims (25, 26)
-
Specification