Methods and devices for mapping data files

Abstract

A method of mapping interconnections between a plurality of data files, such as files of the world wide web. The method includes, for a first file, in a display area displaying a first region. Then, according to a first distance scale, displaying one or more second regions, which respectively represent one or more second files logically related to the first file, for example by hyperlinks. The second regions are spatially related in a display to the first region. In (n−1) further steps, i=2, . . . n, the method displays according to an i-th distance scale smaller than the (i−1)-th distance scale one or more (i+1)-th regions. Each of these (i+1)-th regions respectively represent one or more (i+1)-th files which are logically related to the i-th file, and they are spatially related on a display to the i-th region representing that i-th file. The method may be implemented in software, for example in a web browser.

1 - 63 . (cancelled).  
   
   
       64 . A method of mapping logical relations between a plurality of data files comprising: 
 (i) for a first file, defining a selectable first region in a display area and one or more second regions, said second regions respectively representing one or more second files logically related to the first file and being spatially related to the first region; and    (ii) for each i-th file, where i=2, . . . , n, (n−1) defining one or more selectable (i+1)-th regions, said (i+1)-th regions respectively representing one or more (i+1)-th files which are logically related to the i-th file, and being spatially related to the i-th region representing that i-th file; and,    (iii) enabling and receiving user selection of one of the selectable regions defined in the display area and corresponding to one of the files,    (iv) wherein for a selected j-th file (where 1<j<n) represented by one of said regions, generating an additional region for each file that has a predetermined logical connection to the (j)-th file, each additional region including data indicating a significance of said respective connected file.    
   
   
       65 . The method according to  claim 64  wherein for a selected j-th file (where 1≦j≦n) represented by one of said regions, generating an additional region for each region that represents a file with a predetermined logical connection to the (j)-th file, each additional region including data indicating a significance of said respective connected file.  
   
   
       66 . The method according to  claim 64  in which the selection of one of the additional regions is equivalent to the selection of the region corresponding to the said additional region.  
   
   
       67 . The method according to  claim 64  wherein the predetermined logical connection is that the data files for which additional regions are generated are the j-th data files logically related to the same (j−1)-th data file as the selected j-th data file.  
   
   
       68 . The method according to  claim 64  wherein the predetermined logical connection is that the data files for which additional regions are generated are the (j+1)-th data files logically related to the selected j-th data file.  
   
   
       69 . The method according to  claim 64  in which, in response to the selection of a selectable region generating a display of logical relations between the data files are performed again, using the file corresponding to the selected file as the first file.  
   
   
       70 . The method according to  claim 69  comprising changing the scale associated with the selected region when generating the display using the selected file as the first file.  
   
   
       71 . The method according to  claim 70  wherein changing the scale comprises increasing the scale for the selected region.  
   
   
       72 . The method according to  claim 69  in which the selected region is redefined as the largest region.  
   
   
       73 . The method according to  claim 64  in which the value of n is at least  3 .  
   
   
       74 . The method according to  claim 64  wherein n depends upon any one or more of: (i) the resolution of a user's screen, (ii) the computer resources available for creating the display, (iii) the number of files a certain number of clicks away from the first file, or (iv) an earlier selection by a user.  
   
   
       75 . The method according to  claim 64  in which n is predefined.  
   
   
       76 . The method according to  claim 64  in which said logical relations are interconnections.  
   
   
       77 . The method according to  claim 76  in which the data files define a tree-like structure and the logical relationships between the data files are the branches of the tree.  
   
   
       78 . The method according to  claim 76  in which the data files define a directory structure and the logical relationships between the data files are the links of the directory structure.  
   
   
       79 . The method according to  claim 76  in which said logical relations are defined by hyperlinks between said data files.  
   
   
       80 . The method according to  claim 79  in which said hyperlinks are hypertext links.  
   
   
       81 . The method according to  claim 76  in which the logical relationships are such that each said (i+1)-th file for a given i-th file can be reached from the i-th file by one click.  
   
   
       82 . The method according to  claim 64  in which said data files are files of the world wide web.  
   
   
       83 . The method according to  claim 64  in which the plurality of files are provided by a plurality of spatially separated servers.  
   
   
       84 . The method according to  claim 64  in which the logical relations are not predefined.  
   
   
       85 . The method according to  claim 84  further including defining a rule which determines whether any one of said data files is logically related to any other one of said data files.  
   
   
       86 . The method according to  claim 85  in which the rule is defined by a user.  
   
   
       87 . The method according to  claim 64  wherein said (i+1)-th regions respectively represent one or more (i+1)-th files that are heirarchically dominant or subordinate to the i-th file, such that regions corresponding to dominant and subordinate files are concurrently selectable.  
   
   
       88 . The method according to  claim 64  in which substantially all the data files for which regions are defined in the display are selectable.  
   
   
       89 . The method according to  claim 64  in which for i=1, . . . , n, the shapes of at least one of the (i+1)-th regions for the (i+1)-th files logically related to a given i-th file is determined by a rule, said rule being independent of i and/or the number of said (i+1)-th regions.  
   
   
       90 . The method according to  claim 64  wherein the graphical characteristics of at least one said region is in accordance with characteristics of the respective file represented by that region.  
   
   
       91 . The method according to  claim 90  in which the characteristic of the file represented by the region is that the file is a leaf node.  
   
   
       92 . The method according to  claim 90  in which the graphical characteristics comprise one or more of shape, colour, shading, an icon and hatching.  
   
   
       93 . The method according to  claim 89  in which for i=1, . . . , n said (i+1)-th regions representing the (i+1)-th files for a given i-th file are substantially circular.  
   
   
       94 . The method according to  claim 89  in which for i=1, . . . , n said (i+1)-th regions representing the (i+1)-th files for a given i-th file are substantially rectangular.  
   
   
       95 . The method according to  claim 89  in which for i=1, . . . , n said (i+1)-th regions representing the (i+1)-th files for a given i-th file are substantially square.  
   
   
       96 . The method according to  claim 90  wherein the user can label at least one said file, the map modifying the graphical characteristics of the region which represents each of said respective labelled data files to indicate that the file has been labelled.  
   
   
       97 . The method according to  claim 64  in which said displaying additional information includes opening or executing the file.  
   
   
       98 . The method according to  claim 64  in which the said (i+1)-th regions for the (i+1)-th files logically related to a given i-th file are sequentially arranged in predetermined positions.  
   
   
       99 . The method according to  claim 64  in which said selection is achieved by indicating the region.  
   
   
       100 . The method according to  claim 99  in which said indication is achieved by pointing to the region and optionally also issuing an additional control signal.  
   
   
       101 . The method according to  claim 100  in which said pointing and optional additional control signal is achieved using a mouse or similar cursor-based system.  
   
   
       102 . The method according to  claim 64  in which the second regions are defined according to a first scale and for i=2, . . . , n, the (i+1)-th regions are defined according to an i-th scale smaller than the (i−1)-th scale.  
   
   
       103 . The method according to  claim 102  in which the sizes of the (i+1)-th regions respectively representing the (i+1)-th files logically related to a given i-th file are according to the i-th scale.  
   
   
       104 . The method according to  claim 102  in which the i-th scale is the distance between the centres of the (i+1)-th regions and the i-th region.  
   
   
       105 . The method according to  claim 102  in which the respective scales of the (i+1)-th regions representing the (i+1)-th files logically related to a given i-th file are the i-th scale multiplied by value which is a function of a variable characterizing the respective (i+1)-th file.  
   
   
       106 . The method according to  claim 102  in which the scales are chosen to decrease with i according to a predetermined relation such that irrespective of the value of n the total area of the display never exceeds a predetermined value.  
   
   
       107 . The method according to  claim 102  in which the scales are chosen such that the total area of the one or more (i+1)-th regions representing the (i+1)-th files logically related to an i-th file is less than the area of the i-th region representing the associated i-th file.  
   
   
       108 . The method according to  claim 64  in which the (i+1)-th regions for the (i+1)-th files logically related to an i-th file are spatially arranged relative to each other with an angular relationship determined by a rule, the rule being independent of i.  
   
   
       109 . The method according to  claim 108  in which said rule is in relation to a predefined direction in the display area, whereby the angular relationships of the (i+1)-th regions for the (i+1)-th files logically related to an i-th file are determined in relation to the predetermined direction.  
   
   
       110 . The method according to  claim 64  wherein if a given one of said files is a frame set or similar partition, the region which represents the file indicates this.  
   
   
       111 . The method according to  claim 110  in which the region representing an i-th file which is a frame set partitioned into 1 sections (k=1, . . . , l), the respective i-th region which represents the i-th file is partitioned into 1 sections (k=1, . . . , l), the (i+1)-th regions which represent those files which are linked to the i-th file by anchors within the k-th section of the i-th file being within the k-th section of the i-th region.  
   
   
       112 . The method according to  claim 64  in which the first file is a data file which corresponds to a present browser location of a user.  
   
   
       113 . The method according to  claim 112  which is performed upon the present browser location of the user changing.  
   
   
       114 . The method according to  claim 64  including displaying at least one of the regions in the display area.  
   
   
       115 . The method according to  claim 64  wherein at least one criterion is used to identify a subset of (i+1)-th files logically related to a given i-th file, the method not defining regions for said subset of identified (i+1)-th files.  
   
   
       116 . The method according to  claim 115  in which said at least one said criterion is that an identified file is already represented on the map, and/or that the data file to which it is logically related is already represented on the map.  
   
   
       117 . The method according to  claim 115  in which said at least one criterion is such that if there are more than a predetermined number M of (i+1)-th data files logically related to a given i-th file, the method defines M (i+1)-th regions, respectively representing only M of those (i+1)-th files.  
   
   
       118 . The method according to  claim 117  in which the user can control which M (i+1) th files area represented.  
   
   
       119 . The method according to  claim 115  in which said at least one said criterion is that the regions defined would be too small to the selected.  
   
   
       120 . The method according to  claim 64  in which additional information is displayed to indicate the significance of at least one of said data files.  
   
   
       121 . The method according to  claim 120  in which said additional information is displayed upon a command by the user.  
   
   
       122 . The method according to  claim 64  wherein the user has the option of redefining the size of the regions and/or their arrangement and/or their graphical characteristics within the display.  
   
   
       123 . The method according to  claim 64  further comprising generating a second map.  
   
   
       124 . The method according to  claim 123  in which the second map is spatially separated in the display area from the map representing the plurality of data files.  
   
   
       125 . The method according to  claim 123  wherein the generating a second map includes defining (i+1)-th regions for the (i+1)-th files logically related to an i-th file.  
   
   
       126 . The method according to  claim 123  in which the selection of a file causes the display of the second map.  
   
   
       127 . The method according to  claim 126  in which the selection of a file causes the display of a second map including the said file.  
   
   
       128 . The method according to  claim 127  in which the selection of a file causes the display of a second map using the selected file as the first file.  
   
   
       129 . The method according to  claim 123  in which the second map shows files not selected by the user.  
   
   
       130 . The method according  claim 123  in which the second map shows different logical relations to the first file from those shown in the first map.  
   
   
       131 . The method according to  claim 130  in which the second map has inverse logical relations to the first file from those shown in the first map.  
   
   
       132 . The method according to  claim 64  in which the said (i+1)-th regions for the (i+1)-th files logically related to a given i-th file are arranged along a continuous path.  
   
   
       133 . The method according to  claim 132  in which the or each continuous path is a closed path.  
   
   
       134 . The method according to  claim 64  in which the centres of the said (i+1)-th regions for the (i+1)-th files logically related to a given i-th file do not lie on a straight line.  
   
   
       135 . The method according to  claim 64  wherein the (i+1)-th regions for the (i+1)-th files logically related to a given i-th file are arranged within the corresponding i-th region.  
   
   
       136 . The method according to  claim 135  in which the (i+1)-th regions for the (i+1)-th files logically related to each i-th file are arranged within the corresponding i-th region.  
   
   
       137 . The method according to  claim 64  in which the (i+1)-th regions for the (i+1)-th files logically related to a given i-th file are arranged around the centre of the i-th region.  
   
   
       138 . The method according to  claim 64  in which the (i+1)-th regions for the (i+1)-th files logically related to a given i-th file are arranged at or near the periphery of the i-th region.  
   
   
       139 . The method according to  claim 138  in which the (i+1)-th regions for the (i+1)-th files logically related to a given i-th file touch the periphery of the i-th region.  
   
   
       140 . The method according to  claim 64  in which the (i+1)-th regions for the (i+1)-th files logically related to an i-th file are non-overlapping within the i-th region for the said i-th file.  
   
   
       141 . The method according to  claim 64  wherein the (i+1)-th regions are as large as possible within the constraint of a predetermined size and arrangement rule.  
   
   
       142 . The method according to  claim 64  in which the (i+1)-th regions for the (i+1)-th files logically related to an i-th file are arranged to overlap if the regions would otherwise be less than a predetermined size.  
   
   
       143 . The method according to  claim 64  in which the (i+1)-th regions for the (i+1)-th files logically related to an i-th file are arranged to overlap if the number of said (i+1) th files exceeds a predetermined number.  
   
   
       144 . The method according to  claim 64  in which the said (i+1)-th regions for the (i+1)-th files logically related to a given i-th file are arranged in positions dependent upon the number of said (i+1)-th regions.  
   
   
       145 . A method of mapping logical relations between a plurality of data files comprising: 
 (i) for a first file, defining a selectable first node in a display area and one or more second nodes, said second nodes respectively representing one or more second files logically related to the first file and being connected by a line to the first node; and    (ii) for each i-th file, where i=2, . . . , n, (n−1) defining one or more selectable (i+1)-th nodes, said (i+1)-th nodes respectively representing one or more (i+1)-th files which are logically related to the i-th file, and being connected by a line to the i-th node representing that i-th file; and,    (iii) enabling and receiving user selection of one of the selectable nodes defined in the display area and corresponding to one of the files,    (iv) wherein for a selected j-th file (where 1≦j≦n) represented by one of said nodes, generating a region for each file that has a predetermined logical connection to the (j)-th file, each additional region including data indicating a significance of said respective connected file.    
   
   
       146 . A device including display means, and a processor with access to information concerning a plurality of data files, the processor being arranged to control the display means to generate a display to a user of logical relations between the data files by performing: 
 for a first one of said data files, in a display area defining a first region and one or more second regions, which respectively represent one or more second files logically related to the first file, and which are spatially related to the first region;    (n−1) further steps, i=2, . . . , n, of, for the or each i-th file, defining one or more (i+1)-th regions, which respectively represent one or more (i+1)-th files which are logically related to the i-th file, and which are spatially related to the i-th region representing that i-th file;    enabling and receiving user selection of one of the selectable regions defined in the display area and corresponding to one of the files,    wherein for a selected j-th file (where 1≦j≦n) represented by one of said regions, generating an additional region for each file that has a predetermined logical connection to the (j)-th file, each additional region including data indicating a significance of said respective connected file.    
   
   
       147 . The device according to  claim 146  having a limited display area.  
   
   
       148 . The device according to  claim 146  which is a portable device.  
   
   
       149 . The device according to  claim 148  which is a mobile telephone.  
   
   
       150 . The device according to  claim 146  which is a fixed installation.  
   
   
       151 . The device according to  claim 146  which includes a mechanical data input device, the arrangement of the regions corresponding to the layout of the mechanical data input device.  
   
   
       152 . The method according to  claim 64  comprising program instructions which can be read by a data processing device, and which causes the data processing device to perform the method when the data processing device implements the programming instructions.  
   
   
       153 . A method of mapping logical relations between a plurality of segments of a data file comprising: 
 (i) for a first segment, defining a selectable first region in a display area and one or more second regions, said second regions respectively representing one or more second segments logically related to the first segment and being spatially related to the first region; and    (ii) for each i-th segment, where i=2, . . . , n, (n−1) defining one or more selectable (i+1)-th regions, said (i+1)-th regions respectively representing one or more (i+1)-th segments which are logically related to the i-th segment, and being spatially related to the i-th region representing that i-th segment; and,    (iii) enabling and receiving user selection of one of the selectable regions defined in the display area and corresponding to one of the segments,    (iv) wherein for a selected j-th segment (where 1≦j≦n) represented by one of said regions, generating an additional region for each segment that has a predetermined logical connection to the (j)-th segment, each additional region including data indicating a significance of said respective connected segment.    
   
   
       154 . A method of mapping logical relations between a plurality of segments of a data file comprising: 
 (i) for a first segment, defining a selectable first node in a display area and one or more second nodes, said second nodes respectively representing one or more second segments logically related to the first segment and being connected by a line to the first node; and    (ii) for each i-th segment, where i=2, . . . , n, (n−1) defining one or more selectable (i+1)-th nodes, said (i+1)-th nodes respectively representing one or more (i+1)-th segments which are logically related to the i-th segment, and being connected by a line to the i-th node representing that i-th segment; and,    (iii) enabling and receiving user selection of one of the selectable nodes defined in the display area and corresponding to one of the segments,    (iv) wherein for a selected j-th segment (where 1≦j≦n) represented by one of said nodes, generating a region for each segment that has a predetermined logical connection to the (j)-th segment, each additional region including data indicating a significance of said respective connected segment.