FORM 2
THE PATENTS ACT, 1970
(39 of 1970)
&
The Patents Rules, 2003
COMPLETE SPECIFICATION
(See section 10 and rule 13)
1.
Title : METHOD AND SYSTEM FOR ACCESSING DISC INFORMATION OF
ELECTRONIC FILES
2. APPLICANT (S)
a)
NAME
Samsung Electronics Company
b)
NATIONALITY
Republic of Korea
c)
ADDRESS
Samsung Electronics Company
416 Maetan-Dong, Yeongtong-GU, SUWON-SI,
Gyeonggi-do 442-742,
Republic of Korea
3. PREAMBLE TO THE DESCRIPTION
PROVISIONAL
The following specification describes the invention
��
COMPLETE
The following specification particularly describes the invention and the manner in which it is to be performed.
4. DESCRIPTION (Description shall start from next page)
5. CLAIMS (not applicable for provisional specification. Claims should start with the preamble – “I/we claim” on separate page)
6. DATE AND SIGNATURE (to be given at the end of last page of specification)
7. ABSTRACT OF THE INVENTION (to be given on separate page)
1/26
METHOD AND SYSTEM FOR ACCESSING DISC INFORMATION OF ELECTRONIC FILES
FIELD
[0001]
The present disclosure generally relates to the field of storage devices, and more particularly it relates to the field of a method and a system for accessing disc information of electronic files.
BACKGROUND
[0002]
Often in storage devices, for example in optical discs, the disc information is accessed to perform one or more operations on one or more electronic files. Examples of the one or more operations include playback of an electronic file, recording or creating the electronic file, deleting the electronic file and editing the electronic file. Performing the one or more operations require searching and parsing of the electronic files that contain the information related to the one or more electronic files on the optical disc. This parsing involves much database and consumes substantial amount of time. The time consuming operations results in slow process and becomes a processor intensive.
[0003]
For deleting a clip, a processor checks if one or more playlists gets affected by deleting the clip. If the one or more playlists are getting affected then, each file is updated. Searching for the one or more affected playlists, involves much of parsing operations to find other playlists for which the clip may belong. Since a navigator does not contain information on a clip belonging to number of playlists, the navigator parses every playlist, to find correct number of affected playlists, resulting in time consumption and processor intensive.
2/26
Updating of playlists involves parsing. Parsing process finds the location of the updating point for the clip to be deleted, resulting in time consumption and memory consumption.
[0004]
Consider an exemplary directory structure, of a Blu-ray disc (BD) or an advanced video codec high definition (AVCHD) disc as shown below:
bdmv -->Index.bdmv
bdmv -->Movieobject.bdmv
bdmv -->playlist-->00000.mpls (real playlist) (00001.clpi , 00002, 00003.clpi)
bdmv -->playlist-->00001.mpls (virtual playlist) (00001.clpi , 00003.clpi)
bdmv -->playlist-->00002.mpls (virtual playlist) (00002.clpi , 00003.clpi)
bdmv -->clpinf-->00001.clpi
bdmv -->clpinf-->00002.clpi
bdmv -->clpinf-->00003.clpi
bdmv -->streams-->00001.m2ts
bdmv -->streams-->00002.m2ts
bdmv -->streams-->00003.m2ts
[0005]
In a playback mode, the processor parses all the electronic files except stream files and loads the information for displaying. The number of operations involved in parsing will be O (n) where n is number of electronic files to be parsed. For the directory structure, 8 3/26
parsing operations are performed for the playback operation. Meta-data of the optical disc is displayed on a display panel or on an output device.
[0006]
For deleting a playlist, the playlist should be a real playlist or a virtual playlist. For example, to delete 00001.mpls from the directory structure, the index.bdmv is parsed to find and remove the entry for the title and also in the movie object file. The playlist is parsed to check clip electronic files and compared with other playlist clip electronic files. A check is performed to identify if deleting the playlist causes other clip electronic files to unplayable, since the playlist has not been used in another playlist. The number of operations involved will be O (n) where n is number of electronic files required to be parsed. In the directory structure, 5 operations are performed for deleting the playlist 00001.mpls.
[0007]
For deleting a play mark, the playlist is parsed to check for play marks contained in the playlist. The position of the required play mark to be deleted is found and the corresponding entry is deleted. If the size of the playlist is big, the operations performed for deleting the play mark becomes time consuming.
[0008]
For deleting a clip electronic file, for example to delete 00003 clip electronic file from the directory structure, each playlist is opened and a check is performed to identify if the playlist has an entry for the clip electronic file. The entries of all playlists are removed one by one that contain the clip as playitem. The clip electronic file with extensions .clpi, and .m2ts are deleted. The number of operations required depends on the number of playlists. The process of deleting a clip electronic file involves much of parsing and time consuming. 4/26
[0009]
In light of the foregoing discussion there is a need for an efficient technique for accessing disc information of electronic files.
SUMMARY
[0010]
Embodiments of the present disclosure described herein provide a method and an electronic device for accessing disc information of electronic files.
[0011]
An example of a method for accessing disc information of electronic files includes acquiring navigation for the one or more electronic files. The method also includes storing the navigation data in a mapping file. Further, the method includes performing an operation based on the navigation data and the mapping file.
[0012]
An example of an electronic device for accessing disc information of electronic files includes a memory for storing one or more electronic files and one or more mapping files. The electronic device also includes a processor responsive to the information for acquiring navigation data for the one or more electronic files and performing an operation based on the navigation data and the mapping file.
BRIEF DESCRIPTION OF FIGURES
[0013]
The accompanying figures, similar reference numerals may refer to identical or functionally similar elements. These reference numerals are used in the detailed description to illustrate various embodiments and to explain various aspects and advantages of the present disclosure.
5/26
[0014]
FIG. 1 is a block diagram of a disc and an electronic device for accessing disc information of electronic files, in accordance with which various embodiments can be implemented;
[0015]
FIG. 2 is a flow chart illustrating a method for accessing disc information of electronic files, in accordance with one embodiment; and
[0016]
FIG. 3 illustrates an exemplary location for storing the mapping information files, in accordance with one embodiment.
[0017]
Persons skilled in the art will appreciate that elements in the figures are illustrated for simplicity and clarity and may have not been drawn to scale. For example, the dimensions of some of the elements in the figures may be exaggerated relative to other elements to help to improve understanding of various embodiments of the present disclosure.
DETAILED DESCRIPTION
[0018]
It should be observed that method steps and system components have been represented by conventional symbols in the figures, showing only specific details that are relevant for an understanding of the present disclosure. Further, details that may be readily apparent to person ordinarily skilled in the art may not have been disclosed. In the present disclosure, relational terms such as first and second, and the like, may be used to distinguish one entity from another entity, without necessarily implying any actual relationship or order between such entities.
6/26
[0019]
Embodiments of the present disclosure described herein provide a method and a system for accessing disc information of electronic files.
[0020]
FIG. 1 is a block diagram of a disc 100 and an electronic device 105 for accessing information of electronic files, in accordance with one embodiment. The term disc descried herein refers to an optical disc capable of storing one or more data and information files. The data and information files are stored in a binary format. An example of the disc includes, but is not limited to a Blu-ray disc, an advanced video codec high definition (AVCHD) disc, a compact disc (CD), a digital versatile disc (DVD), a flash drive, and a hard disk.
[0021]
The electronic device 105 includes a bus 110 or other communication mechanism for communicating information. The electronic device 105 includes a processor 115 coupled with the bus 110. The processor 115 can include an integrated electronic circuit for processing and controlling functionalities of the electronic device 105. The electronic device 105 also includes a memory 120, such as a random access memory (RAM) or other dynamic storage device, coupled to the bus 110 for storing information which can be used by the processor 115. The memory 120 can be used for storing any temporary information required. The electronic device 105 further includes a read only memory (ROM) 125 or other static storage device coupled to the bus 110 for storing static information for the processor 115. A storage unit 130, such as a magnetic disk or optical disk, is provided and coupled to the bus 110 for storing information.
[0022]
The electronic device 105 can be coupled via the bus 110 to a display 140, such as a cathode ray tube (CRT), a liquid crystal display (LCD) or a light emitting diode (LED) 7/26
display, for displaying information. An input device 145, including alphanumeric and other keys, is coupled to the bus 110 for communicating an input to the processor 115. The input device 145 can be included in the electronic device 105. Another type of user input device is a cursor control 150, such as a mouse, a trackball, or cursor direction keys for communicating the input to the processor 115 and for controlling cursor movement on the display 140. The input device 145 can also be included in the display 140, for example a touch screen.
[0023]
Various embodiments are related to the use of the electronic device 105 for implementing the techniques described herein. In one embodiment, the techniques are performed by the processor 110 using information included in the memory 120. The information can be read into the memory 120 from another machine-readable medium, such as the storage unit 130.
[0024]
The term “machine-readable medium” as used herein refers to any medium that participates in providing data that causes a machine to operate in a specific fashion. In an embodiment implemented using the electronic device 105, various machine-readable medium are involved, for example, in providing information to the processor 115. The machine-readable medium can be a storage media. Storage media includes both non-volatile media and volatile media. Non-volatile media includes, for example, optical or magnetic disks, such as the storage unit 130. Volatile media includes dynamic memory, such as the memory 120. All such media must be tangible to enable the information carried by the media to be detected by a physical mechanism that reads the information into a machine.
8/26
[0025]
Common forms of machine-readable medium include, for example, a floppy disk, a flexible disk, hard disk, magnetic tape, or any other magnetic medium, a CD-ROM, any other optical medium, punchcards, papertape, any other physical medium with patterns of holes, a RAM, a PROM, and EPROM, a FLASH-EPROM, any other memory chip or cartridge.
[0026]
In another embodiment, the machine-readable medium can be a transmission media including coaxial cables, copper wire and fiber optics, including the wires that include the bus 110. Transmission media can also take the form of acoustic or light waves, such as those generated during radio-wave and infra-red data communications.
[0027]
In some embodiments, the electronic device 105 can be connected to the storage device 155 for storing or fetching information. Examples of the storage device 155 includes, but are not limited to, a flash drive, a pen drive, a hard disk or any other storage media.
[0028]
The memory in the disc 100 is used for storing one or more electronic files and the one or more mapping files. The processor 115 is responsive to the information for acquiring navigation data for the one or more electronic files. The processor 115 is also responsive to the information for performing an operation based on the navigation data and the mapping file. The navigation data for the one or more electronic files is acquired by the processor 115. The navigation data is stored in a mapping file, and the mapping file is stored in the disc 100.
[0029]
In some embodiments, the processor 115 can include or be connected to one or more processing units, to perform one or more operations.
9/26
[0030]
FIG. 2 is a flow chart illustrating a method for accessing disc information of electronic files, in accordance with one embodiment. The method starts at step 205.
[0031]
At step 210, navigation data for the one or more electronic files is acquired. In one embodiment, the navigation data are mapped based on content of the one or more electronic files.
[0032]
At step 215, the navigation data is stored in a mapping file. The mapping file described herein refers to a data structure with a predefined format. In one embodiment, the predefined data structure format includes, but is not limited to a validity data structure and an information data structure.
[0033]
The validity data structure is used to access disc information, related to the one or more electronic files. The validity data structure is also used to inform if there is any valid data present for a corresponding entry. An exemplary format of the validity data structure is as shown in the Table.1 below:
Entry 0
Entry 1
Entry 2
…
Entry N
IsValid
IsValid
IsValid
…
IsValid
FileOffset
FileOffset
FileOffset
…
FileOffset
Info Size
Info Size
Info Size
…
Info Size
Table.1 Validity data structure format
[0034]
In one embodiment, the validity data structure format in the Table.1 includes four fields, ‘Entry’ field, ‘IsValid’ field, ‘FileOffset’ field and ‘Info Size’ field or ‘Information Size’ field. A user can store ‘N’ number of entries in the entry field. The ‘IsValid’ field specifies 10/26
whether there is valid information present for a corresponding entry. If there is a valid information present for the corresponding entry then, ‘Isvalid’ field indicates ‘true’ by setting a binary ‘1’, else the ‘Isvalid’ field indicates ‘false’ by setting to a binary ‘0’. The ‘FileOffset’ field represents a starting location of the information data structure for the corresponding entry in the mapping file. The ‘FileOffset’ field is significant only if the “IsValid” field is ‘true’. ‘InfoSize’ field gives the size of the information. The ‘FileOffset’ field and the ‘InfoSize’ field are significant only if “IsValid” field is true.
[0035]
The information data structure is used to store information, corresponding to a particular entry. The information data structure is flexible and the user can store desired information in a required format. An exemplary format of the information data structure is as shown in the Table.2 below:
Table.2 Information data structure format
File Offset
File Offset
Entity 1
Entity 2
…
Information data
Structure 1
Entity M1
Entity 1
Entity 2
…
Information data
Structure 2
Entity M2
…
…
…
…
…
[0036]
In one embodiment, the Information data structure format in the Table.2 includes ‘M’ entities. Each entity includes information corresponding to the electronic file. In one embodiment the entities can have one or more nested structures. ‘M‘ represents number of information fields the user is desired to store.
11/26
[0037]
Consider an example for mapping a playlist onto the validity data structure. Let the maximum number of playlists in a BD directory is 2000. ‘isvalid”=’1’ indicates information is present in the validity data structure. Let the starting offset = 1000 and let the information size=24. The validity data structure format for the playlist mapping file is as shown in the Table.3 below:
0
1
2
3
…
1999
1
1
1
0
…
0
1000
1024
1044
x
…
X
24
20
20
x
X
Table.3 Validity data structure format for a playlist mapping file
[0038]
Playlist mapping file contains playlist related information for each playlist. Since maximum number of playlists in a BD directory structure is 2000, validity data structure, playlist mapping file, contains 2000 entries. This means the mapping file consists of 2000 validity data structures N = 2000.
A validity data structure schema is given as:
[] 2000
[0039]
The information data structure for the playlist mapping file is as shown in Table.4 below:
12/26
Playlist Id: 00000
Title Id : 0
Number of Playitems: 3
Clip Name[3]: 00001
00002
Information data
Structure 0
00003
Playlist Id: 00001
Title Id : 1
Number of Playitems: 2
Clip Name[2]: 00001
Information data
Structure 1
00003
Playlist Id: 00002
Title Id : 2
Number of Playitems: 2
Clip Name[2]: 00001
Information data
Structure 2
00003
File Offset = 1044
FileOffset=1024
File Offset = 1000
Table.4 Information data structure format for playlist mapping file
[0040]
An Information data structure schema for playlist mapping info can be as shown below:
> . Here K represents Number of clips.
[0041]
Consider an example for mapping clip info onto the validity data structure. Let the maximum number of clip info files in a BD directory is 4000. ‘Isvalid”=’1’ indicates information is present in the validity data structure. Let the starting offset = 1000 and let the information size=28. The validity data structure format for the clip info mapping file is as shown in the Table.5 below:
0
1
2
…
…
4000
0
1
1
…
…
0
x
1000
1028
…
…
X
x
28
28
…
…
X
Table.5 Validity data structure format for a clip info mapping file
13/26
[0042]
Clip Info mapping file contains clip related information for each stream file. Since maximum number of stream files in a BD directory structure is 4000, validity data structure or clip info mapping file, contains 4000 entries. This means N = 4000.
Validity data structure schema is given as
[] 4000
[0043]
The information data structure for the clip info mapping file is as shown in Table.6 below:
Clip Name: 00001
Number of Playlists: 2
Playlist Id <1>: 00000
Number of Playitems: 1
Playitem Id: 0
Playlist Id <2>: 00001
Number of Playitems: 1
Information data
Structure 1
Playitem Id: 0
Clip Name: 00002
Number of Playlists: 2
Playlist Id <1>: 00000
Number of Playitems: 1
Playitem Id: 0
Playlist Id <2>: 00002
Number of Playitems: 1
Information data
Structure 2
Playitem Id: 0
FileOffset=1028
File Offset = 1000
Table.6 information data structure format for a clip info mapping file
[0044]
Information data structure for clip Info mapping info can be as shown below
>,
>,
>>
Here ‘x’ represents number of Playlists and ‘y’ represents number of playitems of each playlist.
[0045]
Below is an exemplary illustration of mapping information using a Blu-ray disc (BD) structure, in accordance with one embodiment.
bdmv -->Index.bdmv
bdmv -->Movieobject.bdmv
bdmv -->Title 0 -->playlist-->00000.mpls (real playlist) (00001.clpi , 00002, 00003.clpi)
bdmv -->Title 1 -->playlist-->00001.mpls (virtual playlist) (00001.clpi , 00003.clpi)
bdmv -->Title 2 -->playlist-->00002.mpls (virtual playlist) (00002.clpi , 00003.clpi)
bdmv -->clpinf-->00001.clpi
bdmv -->clpinf-->00002.clpi
bdmv -->clpinf-->00003.clpi
15/26
bdmv -->streams-->00001.m2ts
bdmv -->streams-->00002.m2ts
bdmv -->streams-->00003.m2ts
For above BD directory structure, the playlist mapping file and the clip info mapping file looks as follows.
Playlist mapping file
<1, 1000, 24>, <1, 1024, 20>, <1, 1044, 20>, <0, x, x> … <0, x, x>
<00000, 0, 3, 3, <00001, 00002, 00003>>, <00001, 1, 2, 2, <00001, 00003>>, <00002, 2, 2, 2, <00002, 00003>>
‘x’ indicates don’t care and the values are insignificant.
First three playlists are present, first three structures are having ‘IsValid’ flag as binary value ‘1’ indicating ‘true’ and remaining will be set as binary value ‘0’ indicating ‘false’. After completion of validity data structures, mapping information will be stored.
Clip Info mapping file
<0, x, x>, <1, 1000, 28>, <1, 1028, 28>, <1, 1056, 28>, <0, x, x> …<0, x, x>
<00001, 2, <00000, 1, <00000>>, <00001, 1, <00000>> >, <00002, 2, <00000, 1, <00001>>, <00002, 1, <00000>> >, <00003, 2, <00000, 1, <00003>>, <00001, 1, <00002>> >
Since first stream file 00000.m2ts is absent, ‘IsValid’ in first validity data structure corresponding to 00000.m2ts is set as ‘false’. Next three structures ‘IsValid’ flag 16/26
corresponding to 00001.m2ts, 00002.m2ts and 00003.m2ts are set to binary value ‘1’. After completion of Validity data structures, mapping information will be stored.
[0046]
At step 220, one or more operations are performed based on the navigation data and the mapping file. The performing of the one or more operations includes performing at least one of adding contents to the navigation data, retrieving information from the navigation data, modifying information of the navigation data, deleting information of the navigation data and resizing of the navigation data.
[0047]
The steps to be performed for adding contents to the navigation data, is given below. If an user needs to add new information corresponding to an ith entry then,
•
Appending the ith information at the end of the file;
•
Noting the starting offset and information size. For example, let the starting offset = 1000 and Information Size is 24;
•
Updating the ith Validity data Structure, since the variable structure is of fixed size; and
•
Setting ‘IsValid’ = 1, ‘FileOffset’ = 1000 and ‘InformationSize’ = 24.
[0048]
An example of steps to be performed for retrieving information from the navigation data is given below:
•
Loading the ith validity data structure;
17/26
•
Retrieving the starting file offset and Information size corresponding to ith information;
•
Moving to the ith information starting file offset; and
•
Loading the information data structure.
[0049]
An example of steps to be performed for modifying information of the navigation data is given below:
If ith information is present in the file, to update information corresponding to an ith entry then,
•
Retrieving the ith Information data structure by:
1)
Loading the ith validity data structure;
2)
Retrieving the starting file offset and information size corresponding to ith information;
3)
Moving to the ith information starting file offset; and
4)
Loading the information data structure.
•
Updating the information data structure;
•
If the updated information data structure size is same as previous information data structure size then,
18/26
1)
Overwriting previous Information data structure with an updated Information data structure, at the same file offset. In this case there is no need to update validity data structure.
•
If the Updated Information data structure size is not same as previous Information data structure size then,
1)
Moving to the end of file and appending new ith information. Starting offset and information size are noted; and
2)
Updating the ith validity data structure with new values of file offset and information size.
[0050]
An example of steps to be performed for deleting information of the navigation data is given below:
•
If ith information is present in the file, information is updated corresponding to an ith entry;
•
Loading the ith validity data structure; and
•
Updating the ith validity data structure by setting ‘IsValid’ = 0 thereby deleting the existing information.
[0051]
An example of steps to be performed for resizing of the navigation data is given below:
•
Copying the entire validity data structure from an old file to a new target file;
19/26
•
Loading the entire validity data structure;
•
Looping through 1st to Nth validity data structures by:
1)
Checking if ‘IsValid’ for the present validity data structure is ‘1’ and;
i.
Copying the information data structure from an old file to new target file; and
ii.
Updating the validity data structure in new target file with a new value of starting file offset.
•
Deleting the previous file; and
•
Renaming the new target file with the deleted file name.
[0052]
In one embodiment, the mapping file is provided for synchronization. If the disc is edited in other device then, it is necessary to synchronize with the changes made. The synchronization is achieved by creating mapping files on every initialization, during the initialization process. If synchronization is not required then mapping files are created only if the mapping files are not present.
[0053]
The method for accessing disc information of electronic files stops at step 225.
[0054]
FIG. 3 illustrates an exemplary location for storing the one or more mapping information files, in accordance with one embodiment. Blu-ray disc movie (BDMV) 300 is a root directory includes multiples sub-directories. The multiple sub-directories can be a backup sub-directory 305, clip info subdirectory 310, playlist sub-directory 315 and stream sub-directory 320. The backup sub-directory 305 includes one or more backup files and
20/26
backup information data. The clip info sub-directory 310 includes one or more clip information files and clip information data. The playlist sub-directory 315 includes one or more playlist information files and playlist information data. The stream sub-directory 320 includes one or more streaming information files and streaming information data.
[0055]
In one embodiment of the present disclosure, the BDMV root directory further includes disc information sub-directory for storing the one or more mapping information files. The one or more mapping files are stored in the disc information sub-directory with an extension .info. For example, a mapping file XYZ.info is stored in the disc information sub-directory.
[0056]
Consider an exemplary directory structure, of a Blu-ray disc (BD) or an advanced video codec high definition (AVCHD) disc as shown below:
bdmv -->Index.bdmv
bdmv -->Movieobject.bdmv
bdmv -->playlist-->00000.mpls (real playlist) (00001.clpi , 00002, 00003.clpi)
bdmv -->playlist-->00001.mpls (virtual playlist) (00001.clpi , 00003.clpi)
bdmv -->playlist-->00002.mpls (virtual playlist) (00002.clpi , 00003.clpi)
bdmv -->clpinf-->00001.clpi
bdmv -->clpinf-->00002.clpi
bdmv -->clpinf-->00003.clpi
21/26
bdmv -->streams-->00001.m2ts
bdmv -->streams-->00002.m2ts
bdmv -->streams-->00003.m2ts
[0057]
In the playback mode, the device has to show the information of the disc to the user on a display panel or on an output device. A separate file is created for storing the mapping information of all the files containing the disc information. So the playback operation is done in a single operation ‘O (1)’. The file is a binary file with extension .info.
[0058]
For the deletion of a playlist in the directory structure, the playlist should be one of a real playlist and a virtual playlist. The disc information for the number of playlists present, clip files that each playlist contain, and type of playlist, is stored in a single file. The file should be a binary file with extension .info. To delete 00001.mpls, the new file is opened and the information for 00001.mpls related to its entry is found in Index and movie object file. Before the execution of the delete command, a confirmation on the items of the playlist with other playlists info in the file is made. Then the respective entries and the actual playlist are deleted. The number of operations required before actual deletion of playlist is 1.
[0059]
For deleting a play mark, playlist mapping info is stored in a single file. The file should be a binary file with extension .info. To delete a play mark, the new file is opened and the information for this play mark is found. Then, the respective play mark entry is deleted from the playlist and also from mapping information file. So if playlist mapping file is
22/26
already created and loaded then, any play mark deletion operation becomes easiest operation to achieve.
[0060]
For deleting a clip file for example deleting 00003 clip file from the directory structure, the disc info like number of clip files present and its linkage with every playlist if more than one in a single file is stored. The file should be a binary file with extension .info. For deleting 00003 clip file, the single file is parsed and the linkage information for 00003 clip file is extracted. Since the entire clip files are linked directly, accessing the file directly and removing the entry. The actual clip file is then deleted, thereby reducing the total number of operations.
[0061]
In the preceding specification, the present disclosure and its advantages have been described with reference to specific embodiments. However, it will be apparent to a person of ordinary skill in the art that various modifications and changes can be made, without departing from the scope of the present disclosure, as set forth in the claims below. Accordingly, the specification and figures are to be regarded as illustrative examples of the present disclosure, rather than in restrictive sense. All such possible modifications are intended to be included within the scope of present disclosure.
23/26
I/We claim:
1.
A method for accessing disc information of one or more electronic files, the method comprising:
acquiring navigation data for the one or more electronic files;
storing the navigation data in a mapping file; and
performing an operation based on the navigation data and the mapping file.
2.
The method of claim 1, wherein the navigation data are mapped based on content of the one or more electronic files.
3.
The method of claim 1, wherein the performing comprises at least one of:
adding contents to the navigation data;
retrieving information from the navigation data;
modifying information of the navigation data;
deleting information of the navigation data; and
resizing of the navigation data.
4.
The method of claim 1, wherein the performing further comprises:
providing the mapping file for synchronization.
5.
An electronic device for accessing disc information of electronic files, the electronic device comprising:
24/26
a memory for;
storing one or more electronic files and one or more mapping files.
a processor responsive to the information for;
acquiring navigation data for the one or more electronic files; and
performing an operation based on the navigation data and the mapping file.
6.
A electronic device for performing a method, the method as described herein and in accompanying figures.
7.
A method for accessing disc information of electronic files, the disc as described herein and in accompanying figures.