Source: http://www.google.com/patents/US5781900?dq=5,742,768
Timestamp: 2014-03-11 13:55:20
Document Index: 32612788

Matched Legal Cases: ['art 850', 'art 850', 'art 850', 'art 870', 'art 870', 'art 870', 'art 870', 'art 870', 'art 870', 'art 870', 'art 870', 'art 870', 'art 900', 'arts 870', 'art 900', 'art 900', 'art 900', 'art 900', 'art 900', 'art 870']

Patent US5781900 - Flexible hyperlink association system - Google PatentsSearch Images Maps Play YouTube News Gmail Drive More »Sign inAdvanced Patent SearchPatentsThe operation of a computer system can be determined by the content of highlighted data on a display device. In this computer system, the highlighted data could be located anywhere on the display device. The highlighted data is not related to any embedded links. In one embodiment, a temporary storage...http://www.google.com/patents/US5781900?utm_source=gb-gplus-sharePatent US5781900 - Flexible hyperlink association systemAdvanced Patent SearchPublication numberUS5781900 APublication typeGrantApplication numberUS 08/582,004Publication dateJul 14, 1998Filing dateJan 2, 1996Priority dateJan 2, 1996Fee statusPaidPublication number08582004, 582004, US 5781900 A, US 5781900A, US-A-5781900, US5781900 A, US5781900AInventorsGabriele Gramlich, Ichiro Nakajima, Wataru Shoji, Daisuke TabuchiOriginal AssigneeSofmap Future Design, Inc.Export CitationBiBTeX, EndNote, RefManPatent Citations (7), Non-Patent Citations (4), Referenced by (13), Classifications (9), Legal Events (4) External Links: USPTO, USPTO Assignment, EspacenetFlexible hyperlink association systemUS 5781900 AAbstract The operation of a computer system can be determined by the content of highlighted data on a display device. In this computer system, the highlighted data could be located anywhere on the display device. The highlighted data is not related to any embedded links. In one embodiment, a temporary storage buffer is used to store data highlighted by a user. The computer system also contains a table (or database) associating a list of data with a list of computer operations. When a pre-assigned key is pressed, the content of the temporary storage buffer is compared with the list of data in the database. When there is a match, the associated operation is performed. As a result, the operation performed is related to the content of the highlighted data.
What is claimed is: 1. A method for a computer to perform an operation associated with data on a display device and chosen by a user, comprising the steps of:providing a file having data intended to be displayed on said display device, at least a portion of said data containing no embedded link to other files; displaying said data of said file on said display device, said portion of said data being displayed in a manner indicating lack of said embedded link; providing a database containing a list of data and a list of program modules, members of said list of data being associated with members of said list of program modules; highlighting, by said user, desired data associated with said portion on said display device; comparing said highlighted data with said members in said list of data; and if a match is found, executing said program module associated with said matched member. 2. The method of claim 1 further comprising the step of editing said database to associate a program module with said highlighted data if said highlighted data does not match any member in said list of data.
6. A method for a computer to perform an operation associated with data on a display device and chosen by a user, comprising the steps of:providing a file having data intended to be displayed on said display device, at least a portion of said data containing no embedded link to other files; displaying said data of said file on said display device, said portion of said data being displayed in a manner indicating lack of said embedded link; providing a first database and a second database each containing a list of data and a list of program modules, members of said list of data being associated with members of said list of program modules; selecting one of said first and said second databases to be an active database; highlighting, by said user, desired data associated with said portion on said display device; comparing said highlighted data with said members in said list of data of said active database; and if a match is found, executing said program module associated with said matched member. 7. The method of claim 6 further comprising the step of capturing said highlighted data into a buffer, wherein said comparing step compares data in said buffer with said members in said list of data of said active database.
8. A computer system for performing an operation associated with data in a file intended to be displayed on a display device and chosen by a user, said data of said file having at least a portion containing no embedded link to other files; said system comprising:means for displaying said data of said file on said display device, said portion being displayed in a manner indicating lack of said embedded link; a database containing a list of data and a list of program modules, members of said list of data being associated with members of said list of program modules; means for allowing said user to highlight desired data associated with said portion on said display device; means for matching said highlighted data with one of said members in said list of data; and means for executing said program module associated with said matched member. 9. The computer system of claim 8 further comprising a buffer for storing said highlighted data and means for capturing said highlighted data to said buffer, wherein said means for matching matches said data in said buffer with one of said members in said list of data.
10. A computer system for performing an operation associated with data in a file intended to be displayed on a display device and chosen by a user, said data of said file having at least a portion containing no embedded link to other files; said system comprising:means for displaying said data of said file on said display device, said portion being displayed in a manner indicating lack of said embedded link, a database containing a list of data and a list of program modules, members of said list of data being associated with members of said list of program modules; means for allowing said user to highlight desired data associated with said portion on said display device; a first computer program and a second computer program; said first computer program comprising:means for capturing said highlighted data; and means for sending said captured data to said second computer program; and said second computer program comprising:means for receiving said captured data from said first computer program; means for matching said captured data with said members in said list of data; and means for executing said program module associated with said matched member. 11. The computer system of claim 10 wherein said first and said second computer programs are cells, and wherein said means for sending comprises a DSF statement having said captured data as a parameter.
FIELD OF THE INVENTION The present invention relates to computer programs, and more particularly to computer programs which can associate an operation performed by a computer with captured data appearing on a display device of the computer.
BACKGROUND OF THE INVENTION Many computer programs display information on a display device, such as a video monitor. The information is generally in the form of text and graphic data. It is sometimes desirable to allow a user to highlight a portion of the displayed information and the computer program immediately performs a desired operation related to the highlighted information. Two examples are described below to show the usefulness of such ability. One example is a children's learning program in which a child can type in a word anywhere on the display device, press a pre-assigned key, and the computer can pronounce the word. In another example, the information is a regular text document generated by a commonly used word processing program (e.g., Microsoft Word or WordPerfect). A user can highlight a word in the document, press a pre-assigned key, and a multimedia (audio, graphic, etc.) presentation related to the highlighted word is played.
There are prior art programs which associate a text string or an icon with specific operations of a computer. For example, many educational programs display text and graphics on a computer monitor. A child can highlight a word (or click on an icon) and the computer programs can pronounce the word (or perform a predetermined operation associated with the icon). However, the position and content of the highlighted area is fixed because it is generated by the computer program. Thus, the computer program can easily determine the word being highlighted based on its position (instead of its content), and perform the necessary operations. These programs do not allow a child to type in any word at any position on the display device, and then performed an operation related to the content of the word. Further, the association between the highlighted word and the operation (e.g., pronounce the word) is fixed, and the user cannot alter the relationship.
There are "hyperlinked" documents which allow a user to highlight an object, and the associated programs will link the object to other documents. One example is documents coded in a standard Hypertext Markup Language (HTML) format. These documents are typically used in a world-wide computer network called the Internet. A user can use a browser to retrieve an HTML document from a remote server and display it on his computer. Typically, the display contains text and graphics, although it is possible to show sound and movie. These documents embed links to other HTML documents. The user can click on predetermined locations of the document, and a predetermined HTML document will be retrieved from the same or another server. However, all the links are built in the HTML document. The user cannot create a new link or alter the position and content of the embed link.
SUMMARY OF THE INVENTION The computer system of the present invention uses a temporary storage buffer to store data highlighted by a user. The highlighted data could be located anywhere on a display device of the computer system. The system also contains a table (or database) associating a list of data (e.g., character strings) with a list of computer operations. When a pre-assigned key is pressed, the content of the temporary storage buffer is compared with the list of data in the database. When there is a match, the associated operation is performed. As a result, the operation performed is related to the content of the highlighted data.
The relationship between the data and the computer operation can be changed by comparing the content of the temporary storage buffer with different tables (or databases). Thus, the same data gives rise to different computer operations, when different tables are selected for comparison with the data.
In one embodiment of the present invention, the temporary storage buffer is the clipboard buffer in MS Windows environment. The user use a mouse to highlight a word and press a pre-assigned key (e.g., control-C). The computer system captures the word and compare it with words in a database.
If there is a match, the computer performs an operation indicated in the database and associated with the word (e.g., pronounce the word). If there is no match, an "action editor" is displayed, which allows the user to enter into the database an action associated with the unmatched word.
The clipboard could be used to capture graphics. In this case, the database compares the captured graphics with graphic data stored therein.
BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 is a schematic drawing of a computer system operating in accordance with the present invention.
FIG. 8 is a block diagram of a computer system which can be used to run the flexible hyperlink association program of the present invention.
DETAILED DESCRIPTION OF THE INVENTION The present invention is directed to a novel flexible hyperlink association system. The following description is presented to enable any person skilled in the art to make and use the invention. Descriptions of specific applications are provided only as examples. Various modifications to the preferred embodiments will be readily apparent to those skilled in the art, and the general principles defined herein may be applied to other embodiments and applications without departing from the spirit and scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown, but is to be accorded the widest scope consistent with the principles and features disclosed herein.
FIG. 1 is a schematic drawing of a computer system 700 which is able to implement a flexible hyperlink association system in accordance with the present invention. Computer system 700 contains a display device 704. An exemplary ASCII character string 706, "this is the sound of a piano", is displayed on display device 704. The word "piano" is highlighted. A user presses a pre-assigned key, e.g., control-C. Computer system 700 captures the highlighted word, "piano" in a buffer 712. It should be appreciated that the word can be captured to buffer 712 while it is being highlighted or after the pre-assigned key is pressed.
After the pre-assigned key is pressed, computer system 700 accesses a database 714 already loaded in the system memory of computer system 700. Database 714 contains a plurality of lines. Each line can be considered a record, which contains the name of a musical instrument, an equal sign, and the name of a program module (e.g., a file having an "EXE" extension). The equal sign is an association symbol. The operation performed by the program module corresponds to the operation performed by computer system 700. It should be appreciated that any symbol (e.g., the "*" symbol) could be used as an association symbol. The programs associated with the operations could have any format executable by computer system 700 (e.g., files having "WAV", "BMP" and other extensions).
In this embodiment, computer system 700 compares the word in buffer 712 with the words in database 714 to the left of the equal sign. A match is found, and the program corresponds to the word "piano" is "piano.exe". Computer system 700 then invokes the program "piano.exe". This program causes computer system 700 to play a piece of piano music. As a result, a piece of piano music is played by loudspeaker 718.
In a computer system, the operating system determines the steps need to be taken to invoke a program module. It should be easy for persons skilled in the art to write a routine which can follow these steps to invoke a desired program module listed in database 714.
It can be seen from FIG. 1 that the word "piano" can occur anywhere on display device 704. Further, the program being executed depends on the content of the highlighted word. Thus, a different program will be executed if a different word is highlighted.
The way data is highlighted depends on the structure of computer system 700. In a IBM-compatible computer running under Microsoft Windows environment, data can be highlighted by positioning a cursor (not shown) at a first location on display device 704, depressing a button on a mouse (not shown), and moving the cursor to a second location. Other programs highlight data using other procedures (e.g., Wordperfect running under Microsoft DOS requires the use of a pre-assigned key, "F12", to designate the beginning of highlighted data).
In this embodiment, database 714 has been loaded into system memory from nonvolatile memory (e.g., hard disk, floppy diskette, or CD-ROM) prior to the pressing of the pre-assigned key. It is possible for the user to load a different database into the system memory. It is also possible for the user to load a plurality of databases into the system memory, and select one of these databases (or switch to a different database) to be an active database for comparing with the highlighted word. For example, the user can select a database associating words with graphic images. In this case, a picture of a piano would be displayed when the word "piano" is highlighted.
The flexible hyperlink association system of the present invention can be implemented using a novel "bossless" computer program architecture comprising a plurality of program modules called "cells." Under this architecture, each cell is hierarchically equal, i.e., there is no controlling (or boss) cell. An application can start from any cell, and can terminate at any cell. Typically, many cells are executing either sequentially or concurrently. Various applications can be designed by controlling the operation of these cells. A detailed description of this computer program architecture can be found in a copending patent application (Ser. No. 08/539,806) filed Oct. 5, 1995 and entitled "Bossless Architecture and Digital Cell Technology for Computer Programs." This copending patent application is hereby incorporated by reference. A detailed description of using this architecture to implement the flexible hyperlink association system of the present invention is provided below in a separate section.
In this embodiment of the flexible hyperlink association system, two cell are created to implement the system. One cell is called a clipboard scanning cell and the other cell is called a hyperlink cell. The clipboard scanning cell places highlighted text string in a clipboard buffer commonly used in a windows based operating environment (e.g., Microsoft's Windows software). The clipboard scanning cell is also responsible for detecting the pressing of a pre-assigned key by a user. The second cell is a hyperlink cell which compares the text string in the clipboard with text strings in a database. It also causes the computer system to execute appropriate operations when the text string in the clipboard matches a text string in the database. If there is no match, the hyperlink cell allows a user to edit the database and enter an operation associated with the unmatched text string.
The cells execute DSF statements in their associated DNA files. These statements are executed sequentially. The cells retain full control of the execution, i.e., there is no need to turn over execution to other cells during or after the execution of statements. There is no need to report to other cells on the status or results of execution.
In a preferred computer system of the present invention, many cells (in addition to the clipboard scanning and hyperlink cells) are executing in the computer system. Various applications can be designed by controlling the operation of these cells.
FIG. 2 is a flow chart 850 of a clipboard scanning cell of the present invention. Flow chart 850 starts at step 852. At predetermined time periods, the clipboard scanning cell scans the clipboard buffer, which is maintained by MS Windows (step 854). In step 856, the scanning cell determines whether the buffer contains a Control-C symbol. If this symbol is not detected, flow chart 850 branches back to step 854. If this symbol is detected, scanning cell reads the content of the clipboard (step 860). It then sends a DSF statement to a hyperlink cell (step 862). For example, if the content of the clipboard buffer is a word "piano", the syntax of the DSF statement is "SEARCH piano", the word "piano" is a parameter of the SEARCH statement corresponding the content of the clipboard.
FIG. 3A is a flow chart 870 of a hyperlink cell of the present invention. In this embodiment, the database (corresponding to database 714 of FIG. 1) accessible by the hyperlink cell is stored in its DNA file. Flow chart 870 starts at step 872. At step 874, it launches the clipboard scanning cell. Flow chart 870 then waits for a DSF statement from the scanning cell (step 876). If a DSF statement is received, flow chart 870 determines whether the DSF statement contains a "SEARCH" keyword (step 878). If the "SEARCH" keyword is not found, flow chart 870 branches back to step 876. If a "SEARCH" statement is received from the scanning cell, the hyperlink cell searches its DNA file (i.e., database) for a record having a field which is the same as the parameter in the "SEARCH" statement (step 880). Flow chart 870 then determines whether there is a match (step 881). If such a record exists, the operation associated with this parameter is performed (step 882). Flow chart 870 then branches back to step 876 and wait for another DSF statement. If such a record does not exist, flow chart 870 goes into an edit mode. A dialogue box is displayed asking a user to enter the operation to be associated with this parameter (step 884). This information is stored in the DNA file of the hyperlink cell (step 886). Flow chart 870 then branches back to step 876 to wait for another DSF statement.
FIG. 3B is a flow chart 900 of another hyperlink cell of the present invention. Common reference numerals in flow charts 870 and 900 refer to the same steps. In flow chart 900, two new steps (step 902 and 904) can be inserted between step 878 (i.e., received a "SEARCH" statement) and 880 (i.e., search the database). After a "SEARCH" statement is received, flow chart 900 determines whether the parameter can be executed directly without searching the database (step 902). If the answer is yes (i.e., parameter directly executable), flow chart 900 executes the parameter directly (step 904). For example, if the parameter (i.e., highlighted word) is a executable filename (as determined by the underlying operating system), it is directly executable. An alternative design is to execute parameters having predefined extensions (e.g., "WAV", "BMP", "EXE", etc.). In this case, computer system 700 searches for a file in the hard disk having the same filename as the ASC1I characters in the parameter. When such a file is found, the computer program stored in the file is then launched. Flow chart 900 then branches to step 876 (i.e., wait for another DSF statement). If the answer is negative (i.e., parameter not directly executable), flow chart 900 branches to step 880 (i.e., search the database).
It should also be appreciated that steps 902 and 904 could be inserted into other places of flow chart 870. For example, these two steps could be inserted between steps 881 and 884. Further, a single cell combining the functionalities of the hyperlink and clipboard scanning cells can be used in the present invention (i.e., the single cell can implement the capturing of data, comparing with a database, and invoking a computer operation).
It should also be appreciated that the flexible hyperlink association system can be implemented using convention computer program architecture instead of the digital cell technology. In this case, the hyperlink and clipboard scanning cells can be implemented as two conventional procedures. The communication between the two procedures can be implemented using ordinary procedure calls or using a storage area accessible by both procedures (i.e., one procedure can write to and the other procedure can read from the common storage area). Further, it is possible to use one procedure to implement the capturing of data, comparing with a database, and invoking a computer operation.
The digital cell technology can be considered a "bossless" architecture because every program module is on equal footing with other program modules. There is no module that controls the overall operation of the program (i.e., no boss). A comparison of the convention boss architecture (FIGS. 4A and 4B) and the bossless architecture (FIG. 4C) is shown below.
FIG. 4A is a schematic diagram of a program 100 having such an architecture. In FIG. 4A, a main program 102 contains a plurality of statements, such as 104 and 106. Some of the statements could be CALL statements, such as statements 108 and 110. These two CALL statements, when executed, will invoke program modules 120 and 130. Main program 102 may contain a LOOP statement which causes main program 102 to execute continuously in a loop. Main program 102 also contains a STOP statement for terminating the program. It should be appreciated that program 100 could be written in different programming languages, and the precise syntax of the statements and program structure could vary with the programming languages.
FIG. 4B is a schematic view of an application 150 based on the conventional boss architecture. The architecture is in the form of a hierarchic structure, and a boss module 152 controls a plurality of modules, such as modules 154-157. Solid lines running from the boss to the individual modules are used to graphically depict the chains of command and linkage. When a program module in the lowest level (i.e., module 157 at the end of a branch) is executing, solid lines (i.e., links) 151, 153 and 158 from the boss to that program module must be maintained.
FIG. 4C is a schematic view of an application 160 based on the bossless architecture of the present invention. Application 160 comprises a plurality of program modules, such as modules 162-165. Each program module (called a "cell" in the present invention) is the same as the other cells in an hierarchical sense. Cells are linked together in a novel way in which no history or linkage information needs to be retained. Each link is independent. For example, there is no need for links to be active simultaneously. Each link is direct, i.e., two cells can be linked directly without the need of using one or more intermediate links. For example, cells 162 and 164 can be linked directly using line 166 instead of using lines 167 and 168 and passing through an intermediate cell. An application can be formed by defining the cells involved and using the novel link of the present invention. This is different from the situation in FIG. 4A where the link from the boss to the module at the lowest level must be active at all time while the module is executing. In FIG. 4C, dashed lines are used to graphically depict the novel interaction of the present invention.
FIG. 5 is a drawing showing the structure of an application 200 using the bossless architecture of the present invention. Application 200 contains a plurality of cells, labeled as C1-C4, loaded and executing in RAM. Each cell has an associated file (labeled as D1-D4), called DNA file, which contains information of the cell. The term "DNA" is used here in analogy with the biological relationship between a living cell and its DNA. At a desired time, cell C1 can send statements (called "DSF statements") to cell C2 using a protocol called digital shifting function ("DSF") protocol. Cell C2 will execute these statements. The detail structures of cells, DNA files and the DSF protocol will be described below.
As pointed out above, one of the problems of the conventional architecture is that excessive amount of linkage information is retained, thereby slowing down the execution of programs, In the architecture of the present invention, there is no need to save and restore register values on a stack when cell C2 executes statements written by cell C1. There is no need to register cells in a central database prior to sending commands. There is no need to send messages back and forth to report status of execution. As a result, the application can be executed quickly.
It can be seen from FIG. 5 that the bossless architecture has a flat structure instead of a hierarchical architecture of FIGS. 4A and 4B. Each of the cells C1-C4 is an independent executable routine which is at the same hierarchical level as other executable routines. No cell functions as a boss for other cells. Consequently, this architecture is called a bossless architecture.
If cell CA is a hyperlink cell, file 250 contains a section 262 containing the associated database information. The length of this section could be very long, if the size of the database is large. In one embodiment of the present invention, the content of section 262 is similar to the form shown in database 714 of FIG. 1. Thus, the equal sign is used as the association symbol, the left hand side contains the words to be compared, and the right hand side contains the executable filenames associated with the words at the left hand side.
Regular section 257 contains a "condition" section 258 and a statements section 260. Statements section 260 comprises DSF statements sent to cell CA by other cells. Statements in statements section 260 are executed sequentially. Examples of statements are "Draw Circle,""Draw Line," and "Scrolling." Each statement also contains parameters necessary for the execution of the statement (e.g., location and diameter of circles). Condition section 258 comprises three components: (a) a first pointer to the last DSF statement currently existing in statements section 260, (ii) a second pointer to the current DSF statement being processed by cell CA, and (iii) the current status of the cell. Examples of status are: ready, busy, lock, and never.
Top priority function section 264 contains a condition section 266 and a command lines section 268. The structure of condition section 266 is similar to the structure of condition section 258 (e.g., both sections contain two pointers). Command lines section 268 contains executable command lines which are sent by other cells using DSF (or similar) protocol. The command lines have a higher execution priority than the statements in statements section 260 (the details of execution priority will be discussed below in connection with FIG. 7). The command lines in command lines section 268 are executed sequentially. Examples of commands in section 268 are close, min (for minimizing a window), max (for maximizing a window), restore, etc.
Command lines are sent by one cell to another using a protocol substantially the same as the DSF protocol. Because regular statements section 257 and top priority function section 264 have different headers, the sending cell can distinguish between these two sections and write to the appropriate section. Other means for identifying these two section can also be used (e.g., maintaining separate linked lists of statements and command lines).
FIG. 7 shows the structure of cell CA. It is grouped logically into a plurality of sections, each implemented using instructions executable by a computer. Cell CA contains an initialization section 312 and a DNA interface section 314. DNA interface section 314 allows cell CA to read from to its corresponding DNA file 250. Initialization section 312 takes care of housekeeping tasks when invoked, including reading parameters from "own parameters" section 252 of DNA file 250. Cell CA also contains a section 316 for processing DSF protocol. This section contains code (or program instructions) for sending and receiving statements/command lines using the DSF protocol.
One of the embodiments of the present invention is an application development system which runs under Microsoft's MS Windows. In this environment, cells are programs stored as ".EXE" files and typically show a window on a computer monitor when invoked. By linking these cells, a user can construct an application software just like assembling blocks. Each cell, with its specific function, is given another function or value through DSF protocol with other cells to produce a variety of applications.
FIG. 8 shows a block diagram of a computer system 600 which can be used to run the database system of the present invention. Computer system 600 comprises a computer 602 having a central processing unit (CPU) 604 and system memory 606, which could be random access memory (RAM) or read-only memory (ROM), coupled to a system bus 608. Computer 602 also contains a peripheral bus controller 612 for controlling a peripheral bus 614. Depending on the architecture of computer 602, peripheral bus 614 could be a PC1 bus, VESI local bus, ISA bus, or other similar buses. Peripheral bus 612 allows peripheral boards to be connected to computer 602. Examples of peripheral boards are a video board 616, a serial board 620 and a data transfer board 622. CPU 604 and RAM 606 can communicate with the peripheral boards through peripheral bus controller 612.
Video board 616 contains circuits to control a monitor 630 and images timages thereon. Video board 616 also contains memory (not shown) associated with such display. The memory is preferably a special kind of memory integrated circuit device, called video RAM (VRAM), designed for video applications. The circuits draws images on monitor 630 based on information stored in the memory. The images are on monitor 630 are updated at predetermined time intervals.
Disk controller board 622 is connected to a hard disk 638 and a floppy disk driver 638. The MS Windows and the operating system are generally stored in hard disk 638. The cells can be stored in floppy diskettes and downloaded into hard disk 638. In one embodiment of the present invention, individual cells (e.g., the hyperlink cell and the clipboard scanning cell) and the databases can be stored in diskette. These diskettes can be distributed to end users. The diskettes can be loaded into hard disk 638.
An application cell (such as a word processor cell) is loaded into system memory 606 and executing in computer system 600. A user can enter text (such as text string 706 in FIG. 1) into a window on monitor 630. The hyperlink and clipboard scanning cells are also loaded into system memory 606.
Patent CitationsCited PatentFiling datePublication dateApplicantTitleUS5297249 *Oct 31, 1990Mar 22, 1994International Business Machines CorporationHypermedia link marker abstract and search servicesUS5537590 *Aug 5, 1993Jul 16, 1996Amado; ArmandoApparatus for applying analysis rules to data sets in a relational database to generate a database of diagnostic records linked to the data setsUS5539903 *Mar 2, 1995Jul 23, 1996International Business Machines CorporationMethod and apparatus for producing a report from a query to a database based on a report formatUS5579466 *Sep 1, 1994Nov 26, 1996Microsoft CorporationMethod and system for editing and formatting data in a dialog windowUS5630122 *Mar 2, 1995May 13, 1997International Business Machines CorporationComputerized report-based interactive database query interfaceUS5632009 *Mar 5, 1996May 20, 1997Xerox CorporationMethod and system for producing a table image showing indirect data representationsWO1995004974A1 *Aug 8, 1994Feb 16, 1995Helen Lee AshmanA method of specifying links in hypermedia* Cited by examinerNon-Patent CitationsReference1 *Q. Qian, et al.,; Abstration and Inheritance of Hyperlinks in an Object Oriented Hypertext Database Sysetm;. IEICE Transaction on Information and System; Nov. 1995, No. 11, Toykyo, Japan; pp. 1343 1352.2Q. Qian, et al.,; Abstration and Inheritance of Hyperlinks in an Object Oriented Hypertext Database Sysetm;. IEICE Transaction on Information and System; Nov. 1995, No. 11, Toykyo, Japan; pp. 1343-1352.3 *W. Hall; Ending the Tyranny of the Button; IEEE Multimedia, vol. 1, No. 1, Spring 1994 pp. 60 68.4W. Hall; Ending the Tyranny of the Button; IEEE Multimedia, vol. 1, No. 1, Spring 1994 pp. 60-68.* Cited by examinerReferenced byCiting PatentFiling datePublication dateApplicantTitleUS5903890 *May 15, 1998May 11, 1999Sofmap Future Design, Inc.Database systems having single-association structuresUS6240549 *Aug 18, 1999May 29, 2001International Business Machines CorporationMethod and system for analyzing and displaying program informationUS6516321Aug 13, 1999Feb 4, 2003Carlos De La HuergaMethod for database address specificationUS6564254Oct 4, 1999May 13, 2003Dream Technologies CorporationSystem and a process for specifying a location on a networkUS6772208Nov 4, 1999Aug 3, 2004International Business Machines CorporationMethod and apparatus to restrict free hyperlinking by internet content distributors to web sites of original content producersUS6820093Dec 2, 2002Nov 16, 2004Hyperphrase Technologies, LlcMethod for verifying record code prior to an action based on the codeUS6928452Jan 10, 2003Aug 9, 2005Hyperphrase Technologies, LlcTiered and content based database searchingUS7003719Jan 25, 1999Feb 21, 2006West Publishing Company, Dba West GroupSystem, method, and software for inserting hyperlinks into documentsUS7013298May 3, 1999Mar 14, 2006Hyperphrase Technologies, LlcMethod and system for automated data storage and retrievalUS7333966Jun 13, 2002Feb 19, 2008Thomson Global ResourcesSystems, methods, and software for hyperlinking namesUS7571174Jan 3, 2005Aug 4, 2009Thomson Reuters Global ResurcesSystems, methods, interfaces and software for automated collection and integration of entity data into online databases and professional directoriesUS8001129Jul 28, 2009Aug 16, 2011Thomson Reuters Global ResourcesSystems, methods, interfaces and software for automated collection and integration of entity data into online databases and professional directoriesUS8001457Feb 6, 2006Aug 16, 2011West Services, Inc.System, method, and software for inserting hyperlinks into documents* Cited by examinerClassifications U.S. Classification707/758, 707/E17.62, 707/999.6, 707/999.1International ClassificationG06F17/30Cooperative ClassificationG06F17/30637, Y10S707/99931, Y10S707/99936European ClassificationG06F17/30T2FLegal EventsDateCodeEventDescriptionDec 16, 2009FPAYFee paymentYear of fee payment: 12Jan 6, 2006FPAYFee paymentYear of fee payment: 8Dec 4, 2001FPAYFee paymentYear of fee payment: 4Apr 1, 1996ASAssignmentOwner name: SOFMAP F DESIGN CO., LTD., JAPANFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:SHOJI, WATARU;TABUCHI, DAISUKE;NAKAJIMA, ICHIRO;AND OTHERS;REEL/FRAME:007931/0737;SIGNING DATES FROM 19960303 TO 19960314RotateOriginal ImageGoogle Home - Sitemap - USPTO Bulk Downloads - Privacy Policy - Terms of Service - About Google Patents - Send FeedbackData provided by IFI CLAIMS Patent Services©2012 Google