Method of searching an index structure for TV-anytime forum metadata having location information expressed as a code for defining a key
First Claim
Patent Images
1. A method of searching for metadata divided into fragments and stored in a computer-readable storage medium, the method comprising:
- searching for and locating a key, by a processor, in an index having a list of keys corresponding to fields of the metadata and location information for defining the keys, wherein the key meets a search condition for a field of the metadata, wherein at least a part of the location information defining the key is expressed as a predetermined code value, wherein the predetermined code value is assigned to said at least a part of the location information according to a convention for associating codes with portions of the metadata and corresponds to a frequently used metadata fragment type, wherein the predetermined code value for ProgramInformation fragment is “
1” and
the predetermined code value for GroupInformation fragment is “
2”
; and
extracting, by the processor, a fragment of the metadata from the computer-readable storage medium by using the located key.
0 Assignments
0 Petitions
Accused Products
Abstract
An index structure of metadata provided for searching for information on contents, 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. The index structure of the metadata includes a list of keys corresponding to fields of the metadata, and location information for defining a key, wherein at least a part of the location information is expressed as a predetermined code.
16 Citations
26 Claims
-
1. A method of searching for metadata divided into fragments and stored in a computer-readable storage medium, the method comprising:
-
searching for and locating a key, by a processor, in an index having a list of keys corresponding to fields of the metadata and location information for defining the keys, wherein the key meets a search condition for a field of the metadata, wherein at least a part of the location information defining the key is expressed as a predetermined code value, wherein the predetermined code value is assigned to said at least a part of the location information according to a convention for associating codes with portions of the metadata and corresponds to a frequently used metadata fragment type, wherein the predetermined code value for ProgramInformation fragment is “
1” and
the predetermined code value for GroupInformation fragment is “
2”
; andextracting, by the processor, a fragment of the metadata from the computer-readable storage medium by using the located key. - View Dependent Claims (2, 3, 4, 5, 6, 7, 10, 26)
-
-
8. A method of searching for metadata divided into fragments and stored in a computer-readable storage medium, the method comprising:
-
accessing, by a processor, a list comprising a plurality of combinations of location information of a fragment and location information defining at least one key within the fragment, wherein one of the location information of the fragment and the location information defining the at least one key is expressed as a predetermined code, wherein the predetermined code is assigned to said one of the location information of the fragment and the location information defining the at least one key according to a convention for associating codes with portions of the metadata and corresponds to a frequently used metadata fragment type, wherein the predetermined code value for ProgramInformation fragment is “
1” and
the predetermined code value for GroupInformation fragment is “
2”
;searching, by the processor, the list and locating among the plurality of combinations a combination in which at least one key of the metadata meets a search condition; and extracting one or more fragments of the metadata corresponding to the located combination. - View Dependent Claims (9, 11)
-
-
12. An apparatus for searching for metadata divided into fragments, comprising:
-
a central processing unit (CPU); an input unit receiving a search condition having a field of the metadata as a search parameter; and a control unit using the CPU to search an index of the metadata, the index having a list of keys corresponding to fields of the metadata and location information for defining the keys, for a key corresponding to the search condition, wherein at least a part of the location information defining the key is expressed as a predetermined code value, and extracting a fragment of the metadata using the searched key, wherein the predetermined code value is assigned to said at least a part of the location information according to a convention for associating codes with portions of the metadata and corresponds to a frequently used metadata fragment type, wherein the predetermined code value for ProgramInformation fragment is “
1” and
the predetermined code value for GroupInformation fragment is “
2”
. - View Dependent Claims (13, 14, 15, 16, 17, 18, 19, 20, 21, 22)
-
-
23. An apparatus for searching for metadata divided into fragments, comprising:
-
a central processing unit (CPU); an input unit receiving a search condition for at least one key 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 one key within the fragment, a combination corresponding to the search condition, wherein one of the location information of the fragment and the location information defining the at least one key is expressed as a predetermined code, wherein the predetermined code is assigned to said one of the location information of the fragment and the location information defining the at least one key according to a convention for associating codes with portions of the metadata and corresponds to a frequently used metadata fragment type, wherein the predetermined code value for ProgramInformation fragment is “
1” and
the predetermined code value for GroupInformation fragment is “
2”
. - View Dependent Claims (24, 25)
-
Specification