JP4463282B2 - Information management apparatus and method - Google Patents

Description

  The present invention relates to an information management apparatus and method, and more particularly, to an information management apparatus and method which can quickly and reliably monitor whether or not a file has been updated.

  FIG. 19 shows a configuration example of a conventional information management apparatus. As shown in the figure, each user terminal is connected to various servers via a network such as a LAN (Local Area Network) or the Internet. The user can access the server as needed and receive provision of desired information from the server.

  Information provided by each server is updated as necessary. Each user needs to know whether or not the file held by each server has been updated. Conventionally, the following method is known as a method for the user to know the file update.

  The first method is that when each server registers a user who accesses a file managed by the server in advance and the file is updated, the updated file is sent to the registered user. Is automatically transferred via the network.

  In the second method, instead of transferring the updated file data itself to each user, a message indicating that the information has been updated is transmitted to each user from the server as an e-mail. It is.

  Furthermore, in the third method, each user accesses each server as necessary to check whether or not the file has been updated.

  However, the first method described above becomes difficult to implement when the load is applied to each server and the number of users increases.

  In addition, since the second method transmits only a message, the load on the server is reduced as compared with the first method. However, the server is still required to be managed for this purpose, resulting in a large load.

  Further, in the third method, since the user accesses as necessary, there is a gap between the timing at which the server updates the file and the timing at which the user can receive the file. There was a problem that the user could not obtain.

  The present invention has been made in view of such a situation, and makes it possible to quickly and surely know the update state of a file monitored by a user without imposing a load on the server.

An information management apparatus according to an aspect of the present invention includes a setting unit configured to set a file address of a server to be monitored via a network, and the file set at a predetermined timing based on the address set by the setting unit. An access means for accessing, a result obtained by calculation of a predetermined hash function for all data of the file acquired from the server when the file is accessed by the access means, and when the server is accessed in the past Compares the result obtained by the calculation of the predetermined hash function with respect to all data of the acquired file, and determines whether or not the file is updated, and corresponds to the determination result of the determination unit to, a notification unit that notifies the update state of the file to a user, past access to the server And storing the result obtained by the calculation of the predetermined hash function for all the data of the file acquired at the time, and storing the predetermined hash if it is determined that the file is updated Storage means for updating a result obtained by the calculation of the function .

The determination means acquires the update date of the file from the server, determines whether the file has been updated based on the update date of the file acquired from the server, and updates the file from the server. When the date cannot be obtained, the result obtained by the calculation of the predetermined hash function for the file acquired from the server and the calculation of the predetermined hash function for the file acquired when the server was accessed in the past are obtained. Based on the obtained result, it can be determined whether or not the file has been updated .

An information management method according to an aspect of the present invention is an information management method for an information management apparatus including a setting unit, an access unit, a determination unit, a storage unit, and a notification unit. A setting step in which the setting means sets the address; an access step in which the access means accesses the file at a predetermined timing based on the address set by the processing in the setting step; and a process in the access step The result obtained by the calculation of a predetermined hash function for all data of the file acquired from the server when accessing the file, and the predetermined for all data of the file acquired when accessing the server in the past The result obtained by the hash function calculation of If there are a determining step of determining said determining means whether it has been updated, the file is determined to have been updated, for all data of the file obtained when accessing the past to the server An update step in which the storage means for storing the result obtained by the operation of the predetermined hash function updates the result obtained by the operation of the predetermined hash function stored therein; In response to the result, a notification step of notifying the user of the update state of the file is provided.

In the determination step, an update date of the file is acquired from the server, and it is determined by the determination means whether or not the file is updated based on the update date of the file acquired from the server. When the update date of the file cannot be obtained, the result obtained by the calculation of the predetermined hash function for the file acquired from the server and the predetermined hash function for the file acquired when the server was accessed in the past Based on the result obtained by the calculation, it can be determined by the determining means whether or not the file has been updated .

In one aspect of the present invention, an address of a server file to be monitored via a network is set, and when the file is accessed at a predetermined timing based on the set address, the file is accessed. The result obtained by the operation of a predetermined hash function for all data of the file acquired from the server and the operation of the predetermined hash function for all the data of the file acquired when the server was accessed in the past. The result is compared to determine whether or not the file has been updated, and the update status of the file is notified to the user in accordance with the determination result. Then, it is determined that the file has been updated by a storage unit that stores a result obtained by the calculation of the predetermined hash function for all data of the file acquired when the server is accessed in the past. In this case, the stored result obtained by the calculation of the predetermined hash function is updated.

  It is possible to know whether or not the file of interest has been updated quickly and reliably without imposing a load on the file provider.

FIG. 1 shows a configuration example of a network to which the information management apparatus of the present invention is connected. As shown in the figure, many servers or users are connected to the Internet as a computer network connected on a global scale, either directly or via a LAN as a subnetwork. In this example, an internal server S _A of the user and external servers S _B and S _C are shown. A user can access a predetermined server as necessary to receive various information and services.

  FIG. 2 is a block diagram showing a configuration example of an embodiment of the information management apparatus of the present invention. In this embodiment, a network interface (I / F) 23 receives data supplied from the Internet and other networks, supplies it to the document data storage unit 18 and stores it. The document data storage unit 18 can be composed of a solid-state memory or the like in addition to a hard disk, an optical disk, a magneto-optical disk, or the like. The data structure stored in the document data storage unit 18 is a hypertext description language such as HTML (Hyper Text Markup Language), image data, an image compressed by MMR (Modified Modified READ), MH (Modified Huffman), or the like. It can be a page description language such as Postscript used in data, text data, DTP, or the like.

  The image expansion processing unit 19 expands the data stored in the document data storage unit 18 into image data such as a bitmap corresponding to the data structure in response to a command from the CPU 11 and outputs the image data to the main memory 12. It is made to do. For example, when the data structure is image data compressed by MMR or MH used in a facsimile or the like, the image expansion processing unit 19 performs expansion processing. Further, in the case of a page description language such as HTML or Postscript, raster image expansion processing for expanding fonts and allocating pages is performed.

  Data stored in the main memory 12 is supplied to and stored in the display buffer 13 via the image data transfer unit 20 or the image data compression / transfer unit 21. Basically, the image data transfer unit 20 transfers the data stored in the main memory 12 to the display buffer 13 as it is, and the image data compression transfer unit 21 compresses the image stored in the main memory 12. And supplied to the display buffer 13 for storage.

  The image data compression / transfer unit 21 performs the compression process by a process of transferring data while thinning out every several lines or a process of reducing the number of lines while performing an operation such as logical OR between the lines. Alternatively, the number of dots in the image data is counted, and the compression process is performed in accordance with the number.

  The image data compression transfer unit 21 and the image data transfer unit 20 have a relatively low resolution by converting the binary image data into multiple values when transferring the data read from the main memory 12 to the display buffer 13. Even on the display, it is possible to display without crushing fine characters. However, since the multi-value resolution conversion process takes time, for example, as disclosed in JP-A-4-337800, a coarse image is first displayed, and the data is converted into multi-value data. I will replace them later. Thereby, both the speed of reaction and the request | requirement of a beautiful display can be satisfied.

  The area copy processing unit 22 executes a process of copying (moving) a part of the image data stored in the display buffer 13 to another area of the display buffer 13.

  The video signal generator 14 reads the image data stored in the display buffer 13, converts it into a video signal, outputs it to the display 15, and displays it.

  The update information storage unit 24 stores the address of the server (file) that the user wants to monitor, the timing thereof, the last update date of the accessed file, and the like.

  The keyboard 17 has at least a cursor key 17A, and is operated by a user when inputting various commands to the CPU 11. The pointing device 16 such as a mouse is operated by the user when a predetermined position is designated using a cursor displayed on the display 15.

  Next, the operation of the embodiment of FIG. 2 will be described. First, in order to access a predetermined homepage on the Internet, the keyboard 17 is operated to start a WWW (World Wide Web) browser such as Netscape Navigator (a trademark of Netscape Communications). Then, a URL (Uniform Resource Locator) for designating a predetermined homepage is input. Then, on the display 15, for example, as shown in FIG. 3, a predetermined home page is displayed in the window 30 of the WWW browser. On this homepage, icons 31 for accessing various servers connected to the Internet are displayed.

  Here, when the user operates the pointing device 16 to select, for example, the “Fax in” icon 31, the CPU 11 controls the network interface 23 and is connected to the Internet and corresponds to the icon. To access. This server stores image data (bitmap data) received from an external fax receiver, or image data read out from newspapers, magazines, etc. by an image scanner using software such as an HTML editor. A service (Fax in service) for providing the data is performed.

  The network interface 23 supplies the data supplied from the server accessed via the Internet to the document data storage unit 18 for storage. A part of this data is supplied as it is to the image development processing unit 19, subjected to decompression processing and the like, converted into bitmap data, supplied to the main memory 12 and stored therein.

  The data stored in the main memory 12 is supplied to the display buffer 13 via the image data transfer unit 20 and written therein. The data written in the display buffer 13 is supplied to the video signal generator 14 and converted into a video signal, which is supplied to the display 15 and displayed. In this way, the home page as shown in FIG. 4 of the accessed server is first displayed on the display 15, for example.

  In the example shown in FIG. 4, icons 81-1 and 81-2 for designating a newspaper clipping file in the window 30 of the WWW browser, which are icons simulating a reduced image of each newspaper clipping. 81-1 and 81-2 are displayed in an array. Then, the user operates the pointing device 16 and the keyboard 17 while viewing this homepage, and selects an icon 81-2 for designating a desired newspaper clipping file. Here, if the data of the file is not yet stored in the document data storage unit 18, the CPU 11 requests the server to transfer data via the network interface 23. When the server transfers data in response to this request, the data is supplied to the document data storage unit 18 via the network interface 23 and stored.

  Next, the CPU 11 reads the file data (document data) stored in the document data storage unit 18, converts the data into bitmap data by the image development processing unit 19, supplies the data to the main memory 12, and stores the data. Let Then, this data is supplied to the display buffer 13 via the image data transfer unit 20 or the image data compression transfer unit 21 and stored therein. One piece (one page) of image data written in the display buffer 13 is supplied to the video signal generator 14, converted into a video signal, and output to the display 15 for display.

  Next, the principle of displaying one image will be described with reference to FIG. Now, a window 41 is displayed on the display 15, and a cut-out image of one newspaper article (A4 size) read out from the document data storage unit 18 is displayed on the window 41. To do. Assume that the image data 42 of one image stored in the main memory 12 has a width W and a height H as shown in FIG.

  On the other hand, the window 41 has a width w and a height h, and the width W and the height H of the image data 42 are larger than the width w and the height h of the window 41. In this case, the entire image data 42 cannot be displayed on the window 41 as it is. Therefore, in this embodiment, for example, processing for adjusting (adjusting) the width W of the image data 42 to the width w of the window 41 is performed. That is, the image data 42 is compressed at a compression rate of w / W as a whole in width and height.

Furthermore, in this way, the image data 52 that is compressed to w / W as a whole in the width and height directions is further compressed in the height direction as follows. That is, since the height h of the window 41 is smaller than the height H × (w / W) of the image data 52, the area A ₂ having a height a ₂ of 70% of the height h of the window 41, and its area a ₁ of the upper portion of the height a _1, and a region a ₃ of the height a ₃ thereunder, the window 41 is partitioned. In response to this classification, to the image data 50, a region R ₂ of the height r ₂ (= a _2), a region R ₁ of the height r ₁ of the upper, and the height r ₃ regions thereunder And R ₃ .

The data in the region R ₂ of the image data 52 is transferred and displayed as it is (without being compressed) in the region A _{2 of the} window 41. On the other hand, the data in the area R ₁ is compressed and transferred and displayed in the area A ₁ in the vertical direction, and the data in the area R ₃ is transferred and displayed compressed in the area A ₃ in the vertical direction. Is done. Height a ₂ regions A ₂ is 70% of the value of the height h of the window 41, the height r ₂ of region R ₂ of the image data 52, since it is the same value as a _2, Area A ₂ is a standard part where characters are displayed at the correct ratio (ratio between vertical and horizontal directions), whereas areas A ₁ and A ₃ are displayed with characters compressed in the vertical direction. The compression unit.

The position of the standard area A ₂ can be moved with a cursor. 6 and 7 illustrate this relationship. That is, as shown in FIG. 6, the range up to K and the range up to K around the position of the cursor 61 of the display buffer 13 (and hence the window 41) are the standard area A _2. The upper and lower regions are designated as A ₁ or A ₃ . Thus, for example, from the state shown in FIG. 6, move the cursor 61 downward, as shown in FIG. 7, the area A ₂ of the standard unit is moved downward from the position in FIG. As a result, the range of the region A ₁ is larger in the case of FIG. 7 than in the case of FIG. 6, and the range of the region A ₃ is narrower in the case of FIG.

  Next, the file monitoring method according to the present invention will be described with reference to the flowcharts of FIGS. 10 and 11. Before that, an image showing the update state of the file to be monitored will be described with reference to FIGS. I will explain.

  That is, in this embodiment, as shown in FIG. 8, when the image of the task being processed at that time is displayed on the window 41-1, as shown in FIG. An image representing the update status of a plurality of files is displayed in a relatively small window 41-2.

  FIG. 9 shows the window 41-2 in an enlarged manner. For example, assume that the update status of three files is monitored. At this time, as shown in a window 41-2 on the right side of FIG. 9, for example, a homepage image (represented by A, B, and C in FIG. 9) of the monitored file is reduced, and the reduced image is displayed. It is compressed and displayed in the horizontal direction.

  Then, each file is accessed at the designated timing, and it is determined whether or not the file has been updated. When the file has been updated, as shown in the window 41-2 on the left side of FIG. The image of the homepage is displayed larger than the image of the file that has not been updated. Thereby, the update of the file which each user is monitoring can be known quickly and reliably.

  Next, a method for monitoring a file will be described with reference to the flowcharts of FIGS. Before starting the processing shown in FIGS. 10 and 11, the user operates the keyboard 17 or pointing device 16 to execute processing for registering the address of the file to be monitored. When this input is performed, the CPU 11 stores the input information in the update information storage unit 24.

FIG. 12 schematically shows a monitoring file list stored in the update information storage unit 24 in this way. In this embodiment, the addresses a, b, and c of the three files A, B, and C and information on the date and time when the addresses should be accessed are registered. The files to be registered here may be a plurality of files managed by one server (for example, the server S _{A in} FIG. 1), or may be different servers (for example, the servers S _A , S _B , S _{C in} FIG. 1). ) May be managed files (files A, B, C), but this embodiment is the latter example. Also, as shown in FIG. 12, the time information to be accessed can be specified by specifying a day of the week and time, such as every Monday at 9:00, or by specifying a time at 23:00 every day, You can also specify a period, such as every hour.

  The processing shown in FIG. 10 and FIG. 11 is performed for each file address registered in advance as described above.

In step S1 of FIG. 10, the CPU 11 reads the address (for example, address a) of the file stored in the update information storage unit 24, controls the network interface 23, and starts accessing the address. Thereby, for example, access is made to the server S _A shown in FIG.

  At this time, the accessed server provides header information to the user as shown in FIG. 13, for example, and the CPU 11 receives this header information via the network interface 23.

  This header information includes the communication protocol name (HTTP), its version (1.0), the communication status (200 OK), and the file update date (Mon, 11-09-95 07:18:57). GMT) and the like.

  As described above, when the CPU 11 accesses a predetermined file (server), the process proceeds to step S2, and an image (for example, an image of a home page) prepared in advance in the document data storage unit 18 and representing the contents of the file. Is further reduced in the horizontal direction and displayed as shown in the window 41-2 on the right side of FIG. Then, the image is further blinked. In this case, for example, the image of the file A represented by adding the letter A in the right window 41-2 shown in FIG. As a result, the user can be informed that the file A is being accessed and the update status is being confirmed.

  In step S3, it is determined whether or not the accessed address information has been returned within a predetermined time. If no information related to the file is transmitted after a certain period of time has elapsed since the start of access, the process proceeds to step S4, and the x mark is superimposed on the reduced image of the file. Then, the background color is changed to a color (for example, yellow) different from the background color (for example, white) in the normal case.

  For example, when the reduced image of the home page of file A displayed in the window 41-2 is represented by black characters on a white background as shown in FIG. 14, the background is yellow as shown in FIG. , Red X mark is superimposed and displayed. 14 and 15, for the sake of convenience, the reduced homepage is shown in a state in which it is not compressed in the horizontal direction, but in actuality, as shown in FIG. Is displayed. Since the image is compressed in the horizontal direction, it is difficult to confirm the image, but the x mark is relatively large and can be confirmed. Also, since the background is usually white, it is changed to yellow, so this color also causes network problems, such as a line being disconnected or the server being accessed turned off. It can be recognized that it exists.

  After step S4, the process proceeds to step S19 to wait until the next access time is reached. When the next access time arrives, the process returns to step S1, and the subsequent processing is repeatedly executed.

  On the other hand, if it is determined in step S3 that the information has been returned from the accessed server within a certain time, the process proceeds to step S5 to determine whether the information is correct information, not error information. To do. If it is error information, the process proceeds to step S6. A mark is added on the reduced screen, and the background color of the reduced screen is changed to yellow.

  For example, as shown in FIG. 16, the background color is changed to yellow and red? The mark is superimposed and displayed. As in the case of step S4, this image is compressed in the horizontal direction and displayed in the window 41-2 on the right side of FIG.

  Even when such a display is performed, the process proceeds to step S19 and waits until the next access time arrives. When that time arrives, the process returns to step S1, and the subsequent processing is repeatedly executed.

  On the other hand, if it is determined in step S5 that correct information has been transmitted from the accessed server, the process proceeds to step S7, and the reduced image blinked in step S2 is returned to the original state. That is, the blinking is stopped. And it progresses to step S8 and it is determined whether update date data is contained in header information. That is, depending on the server, the update date may not be returned. Therefore, it is determined whether or not update date data has been returned.

  If it is determined that the update date data has been returned, the process proceeds to step S9, and it is determined whether or not the update date data just read is newer than the update date accessed last time (or earlier). In the case of the first access, since there is no past update date, the latest update date data is the latest. Therefore, in this case, the process proceeds to step S10, and the update date is stored in the update information storage unit 24.

  In the case of the second and subsequent accesses, if the update date at the current access is newer than the update date at the previous access stored in the update information storage unit 24, in step S10, The update date is changed to the latest update date.

  In step S15, the character “NEW” is superimposed and displayed on the reduced screen representing the update state. The characters are displayed in green. Further, this reduced image is displayed in a larger size than the size of the reduced image when it has not been updated.

  For example, as shown in FIG. 17, a character displayed in black with respect to a white background is changed to green, and a character “NEW” is superimposed in red. Then, this reduced image is displayed larger than the reduced images (B, C) of other files that have not been updated, as shown in the window 41-2 on the left side of FIG. When observing on the display screen, as shown in the right window 41-2 in FIG. 9, the reduced images of the three files A, B, and C are compressed in the width direction and displayed with an equal width. When the access to the file A is started, the reduced image of the file A blinks, and when it is confirmed that the file A is updated, as shown in the left window 41-2 in FIG. The window 41-2 is displayed larger (with a smaller compression ratio in the width direction), and the remaining images of the files B and C are further increased in compression ratio than in the right window 41-2. Display (with a narrower width). The characters are green, and the red character “NEW” is large and superimposed. Thus, the user can surely know that the file A has been updated.

  If the user knows that the file has been updated in this way, when accessing the file, instead of starting the access procedure from the beginning, simply specify the reduced screen. Good.

  That is, for example, as shown in FIG. 8, the cursor (mouse cursor) 61 of the pointing device 16 is moved onto the reduced screen of the file A in the window 41-2, and the mouse is clicked at that position.

  In step S16, the CPU 11 waits until the mouse button is clicked in this way, and when clicked, the CPU 11 proceeds to step S17 and returns the display of the window 41-2 to the original state. That is, the state shown in the left window 41-2 in FIG. 9 is changed to the state shown in the right window 41-2.

  In step S18, the CPU 11 accesses a file specified by clicking on a viewer (for example, Netscape Navigator, which is a WWW browser) for browsing files of various servers connected via the network. Address (in the case of a WWW browser, URL) is delivered. That is, in this embodiment, the reduced screen of the window 41-2 is linked to the addresses of the files A, B, and C.

  Then, the process proceeds to step S19, waiting until the next access time. When the access time is reached, the process returns to step S1 again, and the subsequent processing is repeatedly executed.

  On the other hand, when the address of the file A is passed in step S18, the viewer accesses the address. That is, in this case, access to the file A is started. Then, the updated file A information can be received from the server 1.

  On the other hand, if it is determined in step S9 that the update date obtained as a result of the current access is the same as the previous (or earlier) update date stored in the update information storage unit 24, step S10, The process from S15 to S18 is skipped, and the process proceeds to step S19 to wait until the next access time.

  In addition, as described above, some servers may not return file update date data even when accessed. In this case, whether or not the file has been updated is determined using a hash (HASH) function as follows.

  That is, if it is determined in step S8 that the update date data has not been returned, the process proceeds to step S11, and the CPU 11 requests the server to transfer the data of the currently accessed file. Then, the server receives the data of the file. In step S12, the CPU 11 multiplies the file data (all data) provided from the server by a predetermined hash function.

For example, now, for the sake of simplicity, data _{files, A 1, A 2, A} 3, and a text data consisting of n characters of ··· A _n. Of the text data, the first character, the intermediate character, and from the end with a second three-character, A _1, A _2, A _3, to the data consisting of n characters · · · A _n Define the following hash function:
hash (A ₁ A ₂ ... A _n )
= (A ₁ + A _{n / 2} × 26 + A _n-1 × 26 ² ) mod 1000

For example, when the received data is 'SUZUKI' text data, the following calculation is performed.
hash (SUZUKI) = {ASC ('S')-ASC ('A')
+ (ASC ('Z')-ASC ('A')) × 26
+ (ASC ('K')-ASC ('A')) × 26 ² } mod 1000
= (18 + 650 + 6760) mod 1000 = 428

  In this way, the data “SUZUKI” can be made to correspond to the numerical value 428 by calculating the hash function.

  In this way, the calculated values obtained by calculating the hash function are different with a sufficiently high probability if the original data is different. Therefore, it is possible to detect that the data of the file is updated (the data is different from the past data) from the calculated value obtained by the hash function.

  Therefore, in step S13, the operation value of the hash function obtained in step S12 is compared with the past operation value stored in the update information storage unit 24. If both do not match, the process proceeds to step S14. The calculated value of the hash function just obtained in step S12 is stored in the update information storage unit 24. That is, since the calculated value is different from the past value, the file is updated. Therefore, in this case, the process proceeds to step S15, and processing such as displaying the character “NEW” superimposed on the reduced screen is executed.

  On the other hand, if the calculated value of the hash function obtained and stored in the past is equal to the calculated value obtained this time, the file data is not updated. Therefore, in this case, the process proceeds to step S19, waits until the next access time, returns to step S1 when the access time is reached, and the subsequent processing is repeatedly executed.

  As described above, it is possible to detect an update state of a file managed by a server that does not return the update date.

As described above, for example, when the server S _A in FIG. 1 is accessed, the server S _B that manages the file B registered in the monitoring file list and the server S that manages the file C will be described next. The same process is performed for _{C at} the registered time.

  The user can set the timing for accessing each file at an arbitrary time. Therefore, the update state of the file can be known at a frequency desired by the user (any timing that can be recognized as real time for the user).

  FIG. 18 shows a more specific display example on the display 15 of the window representing the update state performed in this way. Here, in the reduction list display of the window 41-2 shown in FIG. 18, FIG. 8, and FIG. 9, the reduction screen of the home page pointed by the cursor 61 is enlarged in the horizontal direction, and the vertical and horizontal ratios are the same. If it is displayed as a reduced screen, the user can check the outline of an arbitrary file.

It is a figure explaining the network which connects the information management apparatus of this invention. It is a block diagram which shows the structural example of one Embodiment of the information management apparatus of this invention. It is a figure which shows the example of a display of a menu. It is a figure which shows the example of a display of a homepage. It is a figure explaining the principle of the display in this invention. It is a figure explaining the relationship between the cursor and display range in this invention. It is a figure explaining the range of a display when a cursor is moved in the present invention. It is a figure which shows the principle of the display of the image showing the update state of a file. It is a figure explaining compression of the window 41-2 of FIG. It is a flowchart explaining the operation | movement of embodiment of FIG. It is a flowchart following FIG. It is a figure explaining a monitoring file list. It is a figure explaining header information. It is a figure explaining the original reduced image. It is a figure which shows the example of a display in step S4 of FIG. It is a figure which shows the example of a display in step S6 of FIG. It is a figure which shows the example of a display of FIG.11 S15. 9 is a photograph showing a specific display example corresponding to the display example of FIG. 8. It is a figure explaining the method of detecting the update of the conventional file.

Explanation of symbols

  11 CPU, 12 main memory, 13 display buffer, 14 video signal generation unit, 15 display, 16 pointing device, 17 keyboard, 17A cursor key, 18 document data storage unit, 19 image development processing unit, 20 image data transfer unit, 21 Image data compression / transfer unit, 23 network interface, 24 update information storage unit

Claims (4)

A setting means for setting the file address of the server to be monitored via the network;
An access means for accessing the file at a predetermined timing based on the address set by the setting means;
The result obtained by calculation of a predetermined hash function for all data of the file acquired from the server when the file is accessed by the access means, and all the files acquired when the server is accessed in the past A determination unit that compares the result obtained by the calculation of the predetermined hash function with respect to data and determines whether or not the file has been updated;
In response to the determination result of the determination unit, a notification unit that notifies the user of the update state of the file ;
Stores the result obtained by the calculation of the predetermined hash function for all the data of the file acquired when the server was accessed in the past, and stores the result when it is determined that the file has been updated. Storage means for updating a result obtained by the calculation of the predetermined hash function . The determination means includes
Obtaining an update date of the file from the server, determining whether the file has been updated based on the update date of the file obtained from the server;
When the update date of the file cannot be obtained from the server, the result obtained by the calculation of the predetermined hash function for the file acquired from the server and the predetermined for the file acquired when accessing the server in the past The information management apparatus according to claim 1, wherein it is determined whether or not the file has been updated based on a result obtained by the calculation of the hash function. An information management method for an information management device comprising a setting means, an access means, a determination means, a storage means, and a notification means,
A setting step in which the setting means sets a file address of a server to be monitored via a network;
An access step in which the access means accesses the file at a predetermined timing based on the address set by the setting step;
The result obtained by the calculation of a predetermined hash function for all data of the file acquired from the server when the file is accessed by the processing of the access step, and the file acquired when accessing the server in the past A determination step in which the determination unit determines whether the file has been updated by comparing the result obtained by the calculation of the predetermined hash function with respect to all data;
When it is determined that the file has been updated, the storage means for storing the result obtained by the calculation of the predetermined hash function for all data of the file acquired when the server has been accessed in the past An update step for updating a result obtained by calculation of the stored predetermined hash function;
An information management method comprising: a notification step of notifying a user of an update state of the file in response to a determination result of the determination step. In the determination step,
An update date of the file is acquired from the server, and it is determined by the determination means whether the file is updated based on the update date of the file acquired from the server,
When the update date of the file cannot be obtained from the server, the result obtained by the calculation of the predetermined hash function for the file acquired from the server and the predetermined for the file acquired when accessing the server in the past The information management method according to claim 3, wherein the determination unit determines whether or not the file has been updated based on a result obtained by calculating the hash function.

Images