Nova Patents
EP0451384A1

Hypertext data processing system.

Abstract

A hypertext data processing system wherein data sets participating in the hypertext document may be edited, the data processing system inserting tags into the data sets at locations corresponding to the hypertext links to create a file which is editable by an editor and the data processing system removing the tags, generating a revised data set and updating the link information after the editing process.

EP0451384A1, drawing sheet 1
Sheet 1 of 2

Term

Term ended

Projected expiry passed 10 April 2010, 16.5 years ago.

  1. Priority and filed
  2. Published
  3. Projected expiry
  4. Today

7 claims: 4 independent, 3 dependent

  1. 1
    A hypertext data processing system comprising    storage means for the storage of a plurality of data sets and a web file defining at least one hypertext link between specified locations in said data sets;logic for inspecting the web file to extract information identifying locations in a selected data set corresponding to hypertext links;logic for generating an editable file incorporating the contents of the selected data set and tags at the identified locations of the selected data set, which tags are indicative of the correspondence of the identified location with a hypertext link;means for editing the editable file;logic for removing the tags from the editable file and generating an output data set in accordance with changes made to the contents of the selected data set during the editing process.
  2. 5
    A hypertext data processing system as claimed in any preceding claim wherein the editing means includes means for autosaving a copy of the editable file.
  3. 6
    A hypertext data processing system as claimed in any preceding claim wherein each tag contains a reference to an entry in a table, which entry in the table contains supplementary information regarding the hypertext link to which the location of the tag corresponds.
  4. 7
    A hypertext data processing system as claimed in any preceding claim wherein the particular data set is a text file and the tags are a sequence of characters, the first of which is a character of a particular type whose purpose is to identify the sequence of characters as being a tag.