WO1999063460A2 - Systeme et procede permettant de gerer des documents auxquels plusieurs utilisateurs ont acces - Google Patents

Systeme et procede permettant de gerer des documents auxquels plusieurs utilisateurs ont acces Download PDF

Info

Publication number
WO1999063460A2
WO1999063460A2 PCT/US1999/009319 US9909319W WO9963460A2 WO 1999063460 A2 WO1999063460 A2 WO 1999063460A2 US 9909319 W US9909319 W US 9909319W WO 9963460 A2 WO9963460 A2 WO 9963460A2
Authority
WO
WIPO (PCT)
Prior art keywords
document
user
copy
modified
computer
Prior art date
Application number
PCT/US1999/009319
Other languages
English (en)
Other versions
WO1999063460A3 (fr
Inventor
Faisal Hoque
Tharak Krishnamurthy
Tarun Sharma
Original Assignee
Ec Cubed, Inc.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Ec Cubed, Inc. filed Critical Ec Cubed, Inc.
Publication of WO1999063460A2 publication Critical patent/WO1999063460A2/fr
Publication of WO1999063460A3 publication Critical patent/WO1999063460A3/fr

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60—Protecting data
    • G06F21/62—Protecting access to data via a platform, e.g. using keys or access control rules
    • G06F21/6218—Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/10—Office automation; Time management
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2221/00—Indexing scheme relating to security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F2221/21—Indexing scheme relating to G06F21/00 and subgroups addressing additional information or applications relating to security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F2221/2141—Access rights, e.g. capability lists, access control lists, access tables, access matrices
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2221/00—Indexing scheme relating to security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F2221/21—Indexing scheme relating to G06F21/00 and subgroups addressing additional information or applications relating to security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F2221/2147—Locking files

Definitions

  • the present invention relates generally to providing a plurality of end users with access to a document on a computer network, and more particularly, to a system and method enabling a plurality of end users to access, modify, and store a document on a computer server of a computer network.
  • the foregoing process while being much more efficient than the previous all- paper method, is still relatively slow and inefficient.
  • the present process still involves the use of large quantities of paper that is ultimately discarded.
  • the discard of such large amounts of paper is, of course, a waste of natural resources.
  • it takes a substantial amount of time to handle the printed documents, for example, to obtain printed versions of the documents and, thereafter, to operate the facsimile machine to transmit them.
  • the lag time between the previous all-paper method has been greatly improved, there are still substantial lag times built into the foregoing electronic transfer process. For example, documents are often delayed in reaching the intended recipient because they sit in or near the facsimile machine after being "delivered", they are in transit between the facsimile machine and the recipient's desk, or they sit in the recipient's in-box.
  • One aspect of the present invention is directed to a method for managing access to a document by a plurality of users.
  • the document is stored in a memory of a server.
  • the method includes the steps of transmitting a first copy of the document to a computer of a first user and transmitting a second copy of the document to a computer of a second user.
  • the method further includes receiving a modified first copy of the document from the computer of the first user and storing the modified first copy of the document in the memory under a first document name and receiving a modified second copy of the document from the computer of the second user and storing the modified second copy of the document in the memory under a second document name.
  • the method includes the step of storing data identifying the modified first copy of the document and data identifying the modified second copy of the document in the memory.
  • the data stored in the memory includes a first document identifier identifying the modified first copy of the document and a first user identifier identifying the first user.
  • the data also includes a second document identifier identifying the modified second copy of the document and a second user identifier identifying the second user.
  • the method includes the steps of authenticating the first user prior to transmitting the first copy of the document to the computer of the first user and authenticating the second user prior to transmitting the second copy of the document to the computer of the second user.
  • the steps of authenticating the first and second users include comparing an identifier provided by each user with data stored in memory that identifies the plurality of users.
  • the method includes the steps of determining whether the first user already has access to the first copy of the document prior to transmitting the first copy of the document to the computer of the first user, and determining whether the second user already has access to the second copy of the document prior to transmitting the second copy of the document to the computer of the second user.
  • the step of determining whether the first user already has access to the first copy of the document includes comparing a first document identifier and a first user identifier with data stored in a document status table which is stored in the memory.
  • the step of determining whether the second user already has access to the second copy of the document includes comparing a second document identifier and a second user identifier with data stored in the document status table.
  • the method also includes the steps of determining whether the first user already has access to the first copy of the document prior to receiving the modified first copy of the document and determining whether the second user already has access to the second copy of the document prior to receiving the modified second copy of the document.
  • the method includes the step of comparing a first document identifier and a first user identifier with data stored in a document status table which is stored in the memory.
  • the method includes comparing a second document identifier and a second user identifier with data stored in the document status table.
  • the server includes a memory, wherein the document is stored, and a processor in communication with the memory.
  • the processor is operative to transmit a first copy of the document to a computer of a first user and transmit a second copy of the document to a computer of a second user.
  • the processor is operative to receive a modified first copy of the document from the computer of the first user and store the modified first copy of the document in the memory under a first document name.
  • the processor is operative to receive a modified second copy of the document from the computer of the second user and store the modified second copy of the document in the memory under a second document name.
  • the processor is also operative to store data identifying the modified first copy of the document and data identifying the modified second copy of the document in the memory.
  • FIG. 1 is a schematic representation of a system configured in accordance with the present invention
  • FIG. 2 is a diagram illustrating the creation of a plurality of revised documents made from a single document by a plurality of users
  • FIG. 3 is a sample user table identifying users authorized to have access to documents on the computer server;
  • FIG. 4 is a sample document table identifying documents made available to particular users having access to the computer server;
  • FIG. 5 is a sample document status table identifying which users presently have a document checked out from a computer server
  • FIG. 6 is a sample document revision table identifying the revision of each document that was checked out from the computer server
  • FIG. 7 is a flowchart illustrating a process for checking a document out of a computer server, modifying the document, and checking the document back into the computer server;
  • FIG. 8 is a flowchart more specifically depicting the process illustrated in FIG. 3 associated with checking the document out of a computer server;
  • FIG. 9 is a flowchart more specifically depicting the process illustrated in FIG. 3 associated with checking the document back into the computer server;
  • FIG. 10 is a sample seller table similar to the table illustrated in FIG. 3 identifying sellers authorized to have access to documents on the computer server;
  • FIG. 11 is a sample document table similar to the table illustrated in FIG. 4 identifying documents made available to particular sellers having access to the computer server;
  • FIG. 12 is a sample document status table similar to the table illustrated in FIG. 5 identifying which suppliers presently have a document checked out of the computer server;
  • FIG. 13 is a sample document revision table similar to the table illustrated in FIG. 6 identifying the revision of each document that had been checked out to a seller. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
  • check-out is used broadly to identify the action of a user retrieving the document from the computer system. Also “check-in” is used broadly to identify the action of a user to applying changes to the
  • data manager is used broadly to identify software for providing access to particular folders, directories, and documents.
  • the data manager may be either a part of an application program or a routine accessible to an application program.
  • a system administrator may control the operation of the data manager.
  • tables include a collection of data, usually about a particular topic. Tables store data in "fields" (or columns), and “records” (or rows). In describing embodiments, each record in a table contains the same set of fields, and each field contains the same type of information for each record.
  • SQL Structured Query Language
  • SQL is a well-known standard language used to manipulate and retrieve data from a relational database.
  • a programmer can, for example, modify a database's structure, query a database for information, and update the contents of a database.
  • the SQL functions described herein are performed by implementing SQL statements.
  • the SQL statements include, for example, the SELECT statement for retrieving data from a database, the INSERT statement for entering data into a database, and the
  • DELETE statement for deleting data from a database.
  • These statements are referred to below in describing the present invention.
  • the statements can be readily implemented in a number of ways, such as by directly entering the statements, or by embedding them in a computer program and having a computer execute them as a part of one of its routines.
  • the SQL statements are embedded into an application program. The statements are then available at predetermined instances during execution of the application program.
  • Those skilled in the art will readily understand the various ways in which database manipulation may be accomplished using SQL.
  • other types of database management systems can be used.
  • the present invention generally provides a novel and unique system and method for managing documents that may be accessed by a plurality of users.
  • This system and method is capable of allowing, for example, a plurality of users to have access to a copy of an original document from a computer server.
  • the users are able to retrieve and revise the accessed copy of the document, and save the revised copy to the server.
  • the system and method significantly optimizes the utility of documents in a number of settings.
  • a board of education for a school district may use the inventive system and method for requesting vendors to provide quotes for goods and/or services.
  • the board may seek bussing services for transporting students between the schools in its district and the students' homes.
  • the board would advertise for bids, and then make bid specifications available to potential vendors.
  • an electronic version of the bid specification would be stored on a computer server that is accessible to the potential vendors through the Internet.
  • the potential vendors would have a time period, i.e., the bidding period, within which to download the specification, fill it in, and transmit the completed bid specification to the board.
  • the potential vendors would be able to make a plurality of revisions to the bid specification and store the bid specification on the computer server as the vendors gathered the information (e.g., about student head counts, addresses, and days of service).
  • a new document is created that includes a unique name identifying the new version.
  • the bids are reviewed and selected at a bid opening.
  • the version of the bid specification used at the bid opening by the board would be the last version received, i.e., the last version stored on the computer server by a potential vendor.
  • all bid specifications would be "opened" at a predetermined time, on a predetermined day, and made available for public review. As is usual in a public bid, the lowest qualified bidder would receive the contract.
  • the bidding procedure is substantially streamlined by the use of the present invention in that the latest bid specification from each vendor is available immediately at the time and date needed, i.e., the closing of the bidding period.
  • RFQ request for a quote
  • FIG. 1 a schematic representation of a system 10 in which the present invention may be used.
  • System 10 includes a computer server 12 in communication with client computers 14, 16, and 18 through a computer network 20.
  • Computer network 20 may include any of a number of network systems/subsystems well known to those skilled in the art including, for example, a local area network (LAN), wide area network (WAN), intranet, and the Internet.
  • Clients 14, 16, and 18 are operated by users 1, 2, and 3, respectively. Users 1,
  • Computer server 12 includes a memory 21 which is accessible to each of the users 19.
  • Memory 21 includes a computer program 25, one or more documents 22, and a database 24.
  • the database 24 may include, for example, information regarding the users 19 and documents 22.
  • a data manager 26 controls, either directly or indirectly, the users 19 access to documents 22 stored in the memory 21 utilizing various controls as will be described below.
  • users 19 are provided access to particular documents stored in the computer server 12.
  • a user accesses a document, a copy is created and the user may modify the newly created copy on the user's computer or on the computer server 12. After modifications are made to the document, the user may store the modified version of the document to the memory 21 of the computer server 12.
  • the modified version of the document includes a unique name identifying it as a modified version of the original document.
  • each particular document 1 -m is controlled by the data manager 26.
  • the data manager 26 controls access to particular documents by particular users. To whom a particular document is made available depends on such factors as, for example, the purpose of the document and the criterion set by the system administrator.
  • restrictions may be applied to document 1 if it is an RFQ for a transportation contract for a public school or if document 1 is an RFQ for the manufacture of subassembly parts.
  • a bid for a transportation contract for a public school access to the bid specification may be restricted to school bus companies within a predetermined geographic area.
  • access to the RFQ may be restricted to certain subassembly manufacturers that were previously qualified by the requester to manufacture the subassembly parts.
  • data manager 26 configured to provide user 1 access to document 1.
  • User 1 is able to download a copy of document 1 into the memory (not shown) of computer 14 (FIG. 1).
  • a check-out procedure is executed in a manner that will be described in detail below.
  • the modified document is re-named to facilitate the handling of the document.
  • documents can be re-named so that their names include identifying indicia as follows: document 1 (docl), revision 1 (revl), user identity (userl), and the name of the document (name).
  • An equivalent truncated version of the new name can be, for example, docl .revl .userl .name.
  • user 1 After user 1 has checked out and modified document 1 , user 1 can store the revised document in the memory 21 of computer server 12. To store document 1 in memory 21, a check-in procedure is executed in a manner that will be described in detail below. If user 1 attempts to download document 1 a second time, the check-out procedure automatically makes docl .revl .userl .name available to user 1 for modification. Again, in the preferred embodiments, the document is renamed, for example, as docl. rev2.userl. name. After user 1 has modified docl .rev2. userl .name, user 1 stores it in the memory 21 of computer server 12. Again the check-in procedure is executed.
  • data manager 26 is also configured to provide user 2 with access to document 1.
  • User 2 is able to download a copy of document 1 into the memory (not shown) of computer 16 (FIG. 1).
  • the check-out procedure is executed.
  • the document is re-named as docl .revl .user2.name.
  • user 2 modifies document 1
  • user 2 stores it in the memory of computer server 12.
  • the check-in procedure is executed.
  • User 2 can make additional modifications to document 1 as illustrated by document revision names docl.rev2.user2.name and doc 1.rev3.user2.name. Any number of users 19 can be given access to any one of documents 22.
  • users 19 are allowed to make any number of revisions to those documents to which they have been given access. This is illustrated in FIG. 2, wherein data manager 26 is shown to be configured to provide user n access to document 1 , wherein "n" represents a maximum number of users. User n may modify doc 1 in a manner similar to that described above with reference to users 1 and 2. Here, user n has made "q" revisions to document 1.
  • An embodiment of the invention enables the data manager 26 to be configured to control access to the system 10. For example, the number of users that may access a particular document can be limited. In addition, the number of revisions that a user is able to make can be limited. Furthermore, a user may be permitted to download and alter earlier revisions of documents rather than only the latest version. And still further, a user may designate a particular revision as that which should be considered "final" and ready for review. Some or all of these controls can be provided by the system administrator through the data manager 26. Those skilled in the art will recognize that other controls may be included to facilitate the system administrator's control of the users 19 access to the documents 22 and revised documents 30.
  • the users 19 and/or the documents 22 are preferably each identified by a unique identifier code. Identifying each user 19 and document 22 with unique identifiers allows users and documents having the same name to coexist on the system. To efficiently effectuate the process of identifying the users 19 and the documents 22, identifier codes are automatically assigned by the computer program 25 resident in the memory 21 of the computer server 12.
  • the unique identifier codes can be unique alpha-numeric combinations or other appropriate forms of identification. Such identification techniques are well known to those skilled in the art.
  • FIGS. 3-6 to facilitate management of the documents 22, four tables are generated and stored in the memory 21 of computer server 12.
  • the four tables are as follows: a user table (FIG. 3), a document table (FIG. 4), a document status table (FIG. 5), and a document revision table (FIG. 6). These tables are created and stored, for example, in the database 24 of the computer server 12 by the data manager 26 (FIG. 1). Of course, those skilled in the art will recognize that other types of tables can be included to facilitate management of the documents 22.
  • the "user table” is illustrated to include two fields of information entitled “user identity” and “user name”, identified as 3C1 and 3C2, respectively.
  • the "user name” field (3C2) includes the name of each user 19. Every user associated with the system has an entry in this table and is identified by a unique identifier. A user's name can be added to the table, for example, by the system administrator, or by the user when the user accesses the computer program 25 on computer server 12.
  • the "user identity” field (3C1) includes a unique identifier of each user 19 that is listed in the user name field (3C2).
  • the three records of the user table identify the following users: user 1, having user identity 1 (3R1); user 2, having user identity 2 (3R2); and user 3, having user identity 3 (3R3) Referring to FIG.
  • a "document table” is illustrated to include four fields of information entitled “document identity”, “document name”, “document description”, and “document creation date”, identified as 4C1, 4C2, 4C3, and 4C4, respectively.
  • the "document name” field (4C2) includes the name of each document 22 created and stored in the memory of computer server 12.
  • the "document identity” field (4C1) includes a unique identifier of each document 22 that is listed in the document name field (4C2).
  • the document name field (4C2) includes document 1, document 2, document 3, and document 4.
  • Each document is identified in the document identity field (4C1) by numeric identifier 1, 2, 3, and 4, respectively.
  • documents having the same name can exist as they would have a different document identity.
  • the other two fields in the document table of FIG. 4, i.e., the "document description” field (4C3) and the “document creation date” field (4C4), provide information regarding the documents.
  • the "document description” field (4C3) includes a brief description of the respective document stored in the memory 21 of computer server 12.
  • the "document creation date” field (4C4) includes the creation date of the respective document.
  • a "document status table” indicates the documents 22 that are presently checked out for modification and to whom they are checked out. After a user has made modifications to a document and checks the document back into the system, the record relating to the particular checked-out document is preferably deleted from the document status table.
  • the document status table (FIG. 5) includes three fields of information which are entitled “index”, "document identity”, and “user identity”, identified as 5C1, 5C2, and 5C3, respectively.
  • the three records are identified as 5R1, 5R2, and 5R3.
  • the "document identity” field (5C2) stores the unique identifier of each document 22 that is listed in the document table (FIG. 4).
  • the "user identity” field (5C3) stores the unique identifier of each user 19 that is listed in the user table (FIG. 3).
  • the "index” field (5C1) includes a unique identifier corresponding to a particular combination of a document identity and a user identity.
  • a "document revision table" includes a record for every document that has been checked out and checked in by any of the users. As described above with respect to FIG. 2, the revision of a document is changed after a user has checked out a document, made changes to the document, and checked in the document.
  • the document revision table includes five fields of information which are entitled “revision identity”, “revision number”, “document identity”, “user identity”, and “latest revision”, identified as 6C1, 6C2, 6C3, 6C4, and 6C5, respectively.
  • the "user identity” field (6C4) includes the unique identifier of each user that has checked a document out and checked the modified document into the system 10.
  • the "document identity” field (6C3) includes the unique identifier of the document that each user has checked out and checked in.
  • the "revision number” field (6C2) includes the revision number given to each document that has been checked out and checked in.
  • the "revision identity” field (6C1) includes a unique identifier corresponding to each record in the document revision table of FIG. 6.
  • the "latest revision” field (6C5) is used to determine the documents representing the latest revisions for each user.
  • the six exemplary records illustrated in FIG. 6 indicate that several users have checked out several documents a number of times. More specifically, as shown by records 6R1, 6R3, and 6R5, user 1 (user identity number 1) is shown to have checked out and checked in document 1 (document identity number 1) three times.
  • the revision identity field (6C1) identifies the three revisions as revision identities 1, 3, and 5 for revision numbers 1, 2, and 3, respectively.
  • record 6R4 shows that user 2 (user identity number 2) has checked out and checked in document 2 (document identity number 2) once.
  • the revision identity field (6C1) identifies the revision as revision identity 4 for revision number 1.
  • records 6R2 and 6R6 shows that user 3 (user identity number 3) checked out and checked in document 2 (document identity number 2) twice.
  • the revision identity field (6C1) identifies the two revisions as revision identities 2 and 6 for revision numbers 1 and 2, respectively.
  • the latest revision of each document for each user is identified by an asterisk in the latest revision field (6C5).
  • each user is shown to have access to a particular document. More specifically, user 1 (user identity 1) is shown to have access to document 1 (document identity 1), user 2 (user identity 2) is shown to have access to document 2 (document identity 2), and user 3 (user identity 3) is shown to have access to document 2 (document identity 2).
  • an embodiment of the present invention enables the system administrator to control the system through the data manager 26 in a variety of ways. For example, the system administrator may permit each user to have access to all of the documents, all revisions of a particular document, only the latest revision of a particular document, etc.
  • the system administrator may permit user 1 to have access to documents 1-4 found in the document table (FIG. 4).
  • the system administrator may permit user 2 to have access to only documents 1 and 2 found in the document table.
  • the system administrator may permit both user 1 and user 2 to have access to all revisions of document 1 but only the latest revision of each of the remaining documents to which they have access. It is readily apparent that the system administrator has a great degree of flexibility in deciding how to configure access to the documents 22 and revisions 30 thereto. How the system is configured will depend largely on the purpose of the document to which access is being provided.
  • documents are checked out of computer server 12, modified, and checked back into the computer server 12 as follows.
  • a user starts the procedure by logging onto the computer server 12.
  • the user gains access to the computer program 25 and attempts to download a document into his computer. In attempting to do so, the computer program 25 first identifies the user and verifies that the user has the right to access the document. If the computer program 25 determines that the user does not have the right to access the document, the user will be denied access thereto. If the computer program 25 determines that the user has the right to access the document, the computer program 25 carries out a check-out procedure. This procedure is described in more detail below and illustrated in FIG. 8.
  • step 62 after the computer program 25 determines the user has the right to access the document and allows the user to check out the document, the user downloads the document to his computer.
  • the user is able to work with the document, e.g., make modifications to it and store it, on his own computer in a manner well known to those skilled in the art.
  • the user can maintain or terminate communication with computer server 12.
  • the user attempts to store the document on computer server 12. If communication with computer server 12 was terminated after checking out the document, the user must reestablish communication with computer server 12.
  • the computer program 25 again identifies the user and verifies that the user has the right to store the document. If the computer program 25 determines that the user does not have the right to store the document, the user will not be permitted to store the document. If the computer program 25 determines that the user has the right to store the document, the computer program 25 performs a check-in procedure. This procedure is described in more detail below and is illustrated in FIG. 9.
  • FIG. 2 An example of the transformation of the document described above from an original document to a revised document is illustrated in FIG. 2.
  • user 1 is illustrated to have accessed document 1 and generated a revised document that was named as docl. revl. userl .name.
  • user 1 is shown to have accessed document docl .revl .userl .name and generated a revised document that was named doc l.rev2.userl. name.
  • the procedure for checking a document out from the computer server 12, described broadly above with respect to step 61 of FIG. 7, is described in more detail below.
  • the procedure is started for checking out a document from the memory 21 of the computer server 12.
  • the computer program 25 initiates the document check-out procedure.
  • the user's identity is temporarily stored in the memory 21 of the computer server 12.
  • the computer program 25 uses the user identity in an attempt to authenticate the user as a valid user.
  • the authentication process may be accomplished by executing a SELECT statement to select users identities from the user identity field 3C1 of the user table (FIG. 3). If the identity of the user entered by the user, does not correspond to any of the user identities listed in the user table (FIG. 3), an error message will result and, at step 72, the user will be denied access to any documents 22 stored in the memory 21 of the computer server 12. If, however, the identity of the user does correspond to a user identity listed in the user table (FIG. 3), the user will be requested, at step 73, to enter a document name to which the user desires access.
  • the user enters the name of the document to which the user desires access.
  • the computer program 25 executes a SELECT statement to select all of the records (5R1-5R3) in the document status table (FIG. 5).
  • the computer program 25 then makes a comparison between the records in the document status table (FIG. 5) and the combination of the user identity (FIG. 3) and the document identity (FIG. 4) of the document that the user desires to access. If, at step 74, it is determined that there is a match between a record in the document status table (FIG. 5) and the combination of the user identity (FIG. 3) and the document identity (FIG. 4), an error message will result indicating that the document is already checked out by the user and, at step 75, the user will be denied access to the desired document.
  • the computer program 25 will determine if there is a match between a record in the document status table (FIG. 5) and the combination of the user identity, i.e., user identity 1 (FIG. 3), and the document identity, i.e., document identity 1 (FIG. 4).
  • the record identified as index 1 (5R2) in the document status table (FIG. 5) matches the combination.
  • an error message will result indicating that document 1 is already checked out by user 1 and that he cannot access document 1 until after it is checked back into the computer server 12.
  • the computer program 25 retrieves either the original copy of the document, i.e., a copy of the document as originally stored by the system administrator, or the last version of the document as revised by the user.
  • the computer program 25 executes a SELECT statement to select the records representing the latest document revisions from the document revision table (FIG. 6), i.e., records 6R4, 6R5, and 6R6. Thereafter, computer program 25 makes a comparison between the records representing the latest document revisions (FIG. 6) and the combination of the users identity (FIG. 3) and the document identity of the document that the user desires to access (FIG. 4).
  • the computer program 25 retrieves, at step 77, an original copy of the document from the memory 21 of the computer server 12. If, however, it is determined that there is a match between the records representing the latest document revisions (FIG. 6) and the combination of the users identity (FIG. 3) and the document identity (FIG. 4), the computer program 25 instead retrieves, at step 78, the latest revision of the document for the user.
  • the computer program 25 will determine if there is a match between the records in the document revision table (FIG. 6) and the combination of the user identity, i.e., user identity 1 (FIG. 3), and the document identity, i.e., document identity 4 (FIG. 4). In this example, it is determined that there is no match, therefore, the computer program 25 retrieves an original copy of document 4 from the memory 21 of the computer server 12.
  • the computer program 25 will determine if there is a match between the records in the document revision table (FIG. 6) and the combination of the user identity, i.e., user identity 1 (FIG. 3), and the document identity, i.e., document identity 1 (FIG. 4). In this case, the record identified as revision identity 5 (6R5) in the document revision table (FIG. 6) matches the combination. Consequentially, the computer program 25 retrieves the latest revision (revision identity 5 having revision number 3) of document 1 for user 1.
  • the document status table (FIG. 5) and the document revision table (FIG. 6) are updated.
  • the document status table (FIG. 5) is updated by the computer program 25 executing an INSERT statement to insert a record into the table (FIG. 5) including the identity of the document being accessed and the user identity. An index identifier is also inserted to identify the record.
  • the document revision table (FIG. 6) is updated by the computer program 25 executing an INSERT statement to insert a record into the table (FIG. 6) including the document identity and the user identity.
  • the next revision number is assigned to the record.
  • the asterisk will be shifted to the latest document revision.
  • a revision identity is also inserted to identify the record.
  • step 81 if no error message was received by the user at steps 71 and 72, or steps 74 and 75, the user has successfully checked the desired document out and is able to modify and store the document on the user's computer as described above for step 62 (FIG.
  • FIG. 9 an embodiment of the procedure for checking a document into the computer server 12, described broadly above with respect to step 63 of FIG. 7, is described in more detail below.
  • the user starts the check-in procedure.
  • the user initiates the document check-in procedure by gaining access to the computer program 25 on the computer server 12 and identifying himself/herself to the computer program 25, for example, by entering a user identity.
  • the user's identity is temporarily stored in the memory 21 of the computer server 12.
  • the computer program 25 attempts to authenticate the user as a valid user.
  • the authentication process may be accomplished by executing a SELECT statement to select users identities from the user identity field (3C1) in the user table (FIG. 3). If the identity of the user, for example, the user identity that was entered by the user, does not correspond to any of the user identities listed in the user table (FIG. 3), an error message will result and, at step 102, the check-in procedure will be terminated. If, however, the identity of the user does correspond to a user identity from the user identity field (3C1) in the user table (FIG. 3), the user will, at step 104, be requested to enter the name of the document for which the user desires to check in, i.e., store in the memory 21 of computer server 12.
  • the user enters the name of the document the user desires to check in.
  • the computer program 25 executes a SELECT statement to select all of the records (5R1-5R3) in the document status table (FIG. 5).
  • the computer program 25 then makes a comparison between the records in the document status table (FIG. 5), and the combination of the users identity and the document identity of the document that the user desires to check in.
  • step 104 If, at step 104, it is determined that there is not a match between a record in the document status table (FIG. 5), and the combination of the users identity and the document identity, an error message will result indicating that the document was not earlier checked out from the computer server 12 and, at step 105, the user will be not be permitted to check the document into the memory 21 of computer server 12.
  • the computer program 25 stores the modified document into the memory 21 of computer server 12. Thereafter, the computer software 25 differentiates between a document that is a first revision of an original document, i.e., modified for the first time, or a document that is a revision subsequent to a first revision of an original document.
  • a first revision of an original document will be stored as a new document in the memory 21 of computer server 12.
  • a revision subsequent to a first revision of an original document can be written over a previous revision of the document or stored as a new document. Of course, a previous revision that is overwritten will be unretrievable.
  • the system administrator through the data manager 26, can establish whether revisions subsequent to a first revision of an original document should be overwritten or not.
  • the document status table (FIG. 5) is updated.
  • the document revision table (FIG. 6) is updated.
  • the document status table (FIG. 5) is updated by the computer program 25 executing a DELETE statement to remove the record of the document that is being checked in, the record that includes the index number, document identity, and the user identity of the document being checked in.
  • the computer program 25 executes a SELECT statement to select from the document revision table (FIG. 6) the record representing the latest revision of the document to be checked in. If a record is found for the document, a new record is created including the next revision identity and revision number for the document. Also, the asterisk is also shifted to the latest document revision.
  • a new record is created including the next revision identity and a first revision number.
  • the computer program 25 executes an INSERT statement to insert the new record into the table.
  • step 109 if no error message was received by the user at steps 101 and 102, or steps 104 and 105, the user has successfully checked the revised document into the memory 21 of the computer server 12.
  • the names may include information that describes a document as follows: a) document identity (FIG. 4); b) revision identity (FIG. 6); c) user identity (FIG. 3); and c) document name (FIG. 4).
  • Using a unique name having the format described above can provide certain advantages during the checking-out (FIG. 8) and checking-in (FIG. 9) procedures described above.
  • the computer program 25 instead of the computer program 25 executing a SELECT statement to select the relevant document identity and user identity in the document revision table (FIG. 6), the computer program 25 can instead directly evaluate the unique name of the document to be checked in.
  • a manufacturer desires to purchase various materials to support the manufacturing of light bulbs.
  • the manufacturer creates an electronic bid board on computer server 12.
  • the bid board in this case might be, for example, a browser-based application that is resident on the manufacturer's computer server 12.
  • the bid board acts as a common location wherein, for example, various vendors of materials can log on to respond to RFQs that are stored on the bid board.
  • the manufacturer may initiate the quoting process by storing an RFQ in the form of an electronic document on the bid board.
  • the bulb manufacturer requires to purchase filaments from a vendor to support the production of light bulbs.
  • the light bulb manufacturer is referred to as the buyer while the filament vendors are referred to as the sellers.
  • the buyer To obtain the needed filaments, the buyer generates an electronic RFQ.
  • RFQ a seller is prompted to provide, for example, a list of prior customers, manufacturing standards which are met by the seller, price breaks for various quantities of filaments, and guaranteed delivery dates.
  • the buyer informs selected sellers when the RFQ will be stored on the bid board. For example, the buyer may contact sellers by e-mail.
  • seller-A and seller-B there are two sellers, referred to herein as seller-A and seller-B, that are contacted by the buyer to bid for the contract to supply filaments to the buyer.
  • RFQ RFQ for filaments 2204
  • the seller checks out the RFQ document named "RFQ for filaments 2204" (which will be stored on the bid board) from the buyer's computer server 12, modify the document by filling in the required fields, and check the modified document back into the computer server 12. If either seller later desires to modify a previously modified document, the seller can check the document out again and make further modifications. Thereafter, the seller will check the document back into the computer server 12. After a time period as specified by the buyer, the buyer will review the last-modified documents received from the sellers to determine which seller is to receive the contract to supply the filaments.
  • a seller table (analogous to the user table of FIG. 3 above) is illustrated and may include the names of the sellers ("seller-A" and "seller-B") and a unique identifier for each seller ("1" and "2", respectively). With their names and identity in the seller table, both seller-A and seller-B would be approved as authorized sellers to bid on the contract.
  • the buyer executes an INSERT statement to make an entry into a document table residing in the memory of computer server 12.
  • the document table illustrated in FIG. 11, includes the document identity ("1"), document name ("RFQ for filaments 2204"), document description ("Request for quote for the procurement of filaments for project number 2204”), and document creation date (“04-24- 98") of the RFQ.
  • seller-A and seller-B must initially identify themselves to the computer program 25, for example, by entering user identities previously assigned to them by the buyer.
  • the computer user identities may be, for example, the seller identity assigned by the buyer in the seller table (FIG. 10).
  • the computer program 25 attempts to verify that the sellers are valid by comparing their user identities with the list of approved vendors in seller table (FIG. 10).
  • the computer program 25 may then prompt the seller to enter the name of the document that it desires to access. After the document name, in this example, "RFQ for filaments 2204", is entered, the computer program 25 executes a SELECT statement to select document identities from the document table (FIG. 11). In addition, the computer program 25 executes a SELECT statement to select all of the records in a document status table, for example, such as that discussed above and illustrated in FIG. 5.
  • the computer program 25 then makes a comparison between the records in the document status table and the combination of the seller identity (FIG. 10) and the document identity of the document that the seller desires to access (FIG. 11).
  • the computer program 25 would retrieve an original copy of the document entitled "RFQ for filaments 2204".
  • the document status table (FIG. 12) is updated.
  • the document status table (FIG. 12) is updated by the computer program 25 executing an INSERT statement to insert a record into the table including the document identity (" 1 ") and seller-A's identity (" 1 "). The record is also identified by an index number (" 1 ").
  • the document status document status table (FIG. 12) is updated to include a record including the document identity ("1 ") and seller-B's identity ("2"). The record is also identified by an index number ("2").
  • the resulting document status table is illustrated in FIG. 12.
  • the computer program 25 retrieves the document and makes its contents available to the requesting seller.
  • the sellers can then retrieve the document for modification, i.e., completion of the bid specification.
  • the document can be renamed by the computer server 12 to more particularly describe the document.
  • the name may include, for example, a combination of identifying information as follows: a) document identity (FIG. 11); b) revision identity (FIG. 13); c) seller identity (FIG. 10); and d) document name (FIG. 11).
  • the document accessed by seller-A in the above example may have the name "1.1.1.RFQ for filaments 2204" and the document accessed by seller-B in the above example may have the name "1.1.2.RFQ for filaments 2204".
  • each seller will seek to check the document into computer server 12.
  • the sellers can initiate the check-in procedure (FIG. 9) by gaining access to the computer program 25 on the computer server 12 and identifying himself/herself to the computer program 25, for example, by entering a user identity as was done during the check-out procedure described above.
  • the computer program 25 attempts to authenticate the seller.
  • the authentication process is accomplished by executing a SELECT statement to select sellers identities from the seller table (FIG. 10). As noted above, for the present example, both seller-A and seller-B are approved as authorized sellers.
  • the modified name format e.g., "1.1.1.RFQ for filaments 2204" for seller-A and "1.1.2.RFQ for filaments 2204" for seller-B
  • the computer program 25 can receive the name alone.
  • the computer can evaluate the name since it conveniently includes all of the information necessary for authenticating the supplier's identity, document identity, and document revision level.
  • document revision table (FIG. 13) is updated by the computer program 25 executing an INSERT statement to insert a record into the table to include the document identity (" 1 ") and the seller's identity (" 1 ").
  • the next revision number for seller-A is assigned to the record. Since seller-A modified a copy of the original document, the document will be identified as a first revision ("1"). Also, the record is also identified by the next available revision identity ("1").
  • document revision table (FIG. 13) is updated by the computer program 25 executing an INSERT statement to insert a record into the table to include the document identity (" 1 ") and the seller identity ("2").
  • the next revision number for seller-B is assigned to the record. Since seller-B also modified a copy of the original document, the document will be identified as a first revision ("1"). Also, the record is identified by the next available revision identity ("2").
  • the computer program 25 removes from document status table (FIG. 12) the records indicating that seller-A and seller-B have document identity 1 ("RFQ for filaments 2204") checked out.
  • computer program 25 executes a DELETE statement to delete the record from the document status table (FIG. 12) identified as index "1". Similarly, computer program 25 executes a DELETE statement to delete the record from the document status table (FIG. 12) identified as index "2".
  • the manufacturer has acquired the quotes for the desired filaments in an efficient and expeditious manner. More specifically, the costs, amount of time spent, and trouble normally associated with the process has been substantially reduced.
  • computer server 12 can be configured to enable approved individuals to directly utilize its keyboard, monitor, mouse, etc. to check out a document, make modifications thereto, and thereafter check in the modified document.
  • the present system and method for managing documents that are made available to a plurality of users provides an advancement in the art of document management.
  • the system and method allows sellers to respond electronically to a buyers requests for quotes.
  • the system and method allows sellers to store their responses in a computer server, thereby the responses are readily accessible to both the buyer and seller.
  • the system and method provides a computer server that is capable of storing a plurality of versions/revisions of a document.
  • the system and method also provides access to each seller's specific revisions to the document only by the specific seller that prepared the revisions and to the buyer.

Abstract

Cette invention concerne un système et un procédé qui permettent de gérer l'accès de plusieurs utilisateurs en fin de ligne à un document. Ce système et ce procédé consistent à enregistrer le document dans la mémoire d'un serveur. Un procédé, qui comprend plusieurs étapes, consiste tout d'abord à transmettre un premier exemplaire de ce document à l'ordinateur d'un premier utilisateur, puis à transmettre un second exemplaire de ce document à l'ordinateur d'un second utilisateur. On reçoit ensuite un premier exemplaire modifié du document provenant de l'ordinateur du premier utilisateur, et l'on enregistre ce premier exemplaire modifié du document dans la mémoire sous un premier nom de document. On reçoit également un second exemplaire modifié du document provenant de l'ordinateur du second utilisateur, et l'on enregistre ce second exemplaire modifié du document dans la mémoire sous un second nom de document. Au cours d'une dernière étape, on enregistre dans la mémoire les données permettant d'identifier le premier exemplaire modifié du document, ainsi que les données permettant d'identifier le second exemplaire modifié du document.
PCT/US1999/009319 1998-04-30 1999-04-29 Systeme et procede permettant de gerer des documents auxquels plusieurs utilisateurs ont acces WO1999063460A2 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US8359398P 1998-04-30 1998-04-30
US60/083,593 1998-04-30

Publications (2)

Publication Number Publication Date
WO1999063460A2 true WO1999063460A2 (fr) 1999-12-09
WO1999063460A3 WO1999063460A3 (fr) 2000-02-10

Family

ID=22179356

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US1999/009319 WO1999063460A2 (fr) 1998-04-30 1999-04-29 Systeme et procede permettant de gerer des documents auxquels plusieurs utilisateurs ont acces

Country Status (1)

Country Link
WO (1) WO1999063460A2 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2002019215A1 (fr) * 2000-08-31 2002-03-07 Docent, Inc. Procede et systeme de portique d'echange de connaissances

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4558413A (en) * 1983-11-21 1985-12-10 Xerox Corporation Software version management system
US4809170A (en) * 1987-04-22 1989-02-28 Apollo Computer, Inc. Computer device for aiding in the development of software system
US5008853A (en) * 1987-12-02 1991-04-16 Xerox Corporation Representation of collaborative multi-user activities relative to shared structured data objects in a networked workstation environment
US5040142A (en) * 1988-01-29 1991-08-13 Hitachi, Ltd. Method of editing and circulating an electronic draft document amongst reviewing persons at remote terminals attached to a local area network
US5065347A (en) * 1988-08-11 1991-11-12 Xerox Corporation Hierarchical folders display
US5893128A (en) * 1993-03-01 1999-04-06 Nauckhoff; Sven Distributed work flow management
US5897643A (en) * 1995-04-20 1999-04-27 Fuji Xerox Co., Ltd. System for maintaining a record of documents including document copies

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4558413A (en) * 1983-11-21 1985-12-10 Xerox Corporation Software version management system
US4809170A (en) * 1987-04-22 1989-02-28 Apollo Computer, Inc. Computer device for aiding in the development of software system
US5008853A (en) * 1987-12-02 1991-04-16 Xerox Corporation Representation of collaborative multi-user activities relative to shared structured data objects in a networked workstation environment
US5040142A (en) * 1988-01-29 1991-08-13 Hitachi, Ltd. Method of editing and circulating an electronic draft document amongst reviewing persons at remote terminals attached to a local area network
US5065347A (en) * 1988-08-11 1991-11-12 Xerox Corporation Hierarchical folders display
US5893128A (en) * 1993-03-01 1999-04-06 Nauckhoff; Sven Distributed work flow management
US5897643A (en) * 1995-04-20 1999-04-27 Fuji Xerox Co., Ltd. System for maintaining a record of documents including document copies

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2002019215A1 (fr) * 2000-08-31 2002-03-07 Docent, Inc. Procede et systeme de portique d'echange de connaissances

Also Published As

Publication number Publication date
WO1999063460A3 (fr) 2000-02-10

Similar Documents

Publication Publication Date Title
US7200806B2 (en) System and method for generating pre-populated forms
US7509319B2 (en) Providing authorized access and request-initiated translation of data files
US8612295B2 (en) Method and apparatus for processing order related messages
US8046379B1 (en) System and method for access control and for supply chain management via a shared bill of material
US7634455B1 (en) Method and apparatus for providing controlled access to software objects and associated documents
US6260040B1 (en) Shared file system for digital content
US6564218B1 (en) Method of checking the validity of a set of digital information, and a method and an apparatus for retrieving digital information from an information source
US7383320B1 (en) Method and apparatus for automatically updating website content
JP3443057B2 (ja) サーバからクライアントにアプリケーションを配布するための方法及びシステム
US7233940B2 (en) System for processing at least partially structured data
US8024465B2 (en) Managing uneven authorizations in a computer data exchange
US7236947B2 (en) Providing highly automated procurement services
US7197480B1 (en) System and method for front end business logic and validation
US7269665B2 (en) Isolated mapping point
JPH02278458A (ja) 電子文書承認システム
JPH09508995A (ja) データベースへのアクセスを制御するための方法及び装置
WO1999006914A2 (fr) Procede et systeme de mise a jour de donnees a distance au moyen de cles permanentes
US7069269B2 (en) Method, system and program product for mapping data fields between a data source and a data target
US7523144B2 (en) Method, system and program product for determining a file format for use in a translation operation
US7136859B2 (en) Accessing heterogeneous data in a standardized manner
JP2007272518A (ja) 顧客データベース管理装置及び顧客データベース管理プログラム
JP2003131919A (ja) 文書管理装置
US7756718B2 (en) System and method for electronic software delivery and management through channel partners
US6957347B2 (en) Physical device placement assistant
WO1999063460A2 (fr) Systeme et procede permettant de gerer des documents auxquels plusieurs utilisateurs ont acces

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A2

Designated state(s): CN IN JP RU US

AL Designated countries for regional patents

Kind code of ref document: A2

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE

121 Ep: the epo has been informed by wipo that ep was designated in this application
AK Designated states

Kind code of ref document: A3

Designated state(s): CN IN JP RU US

AL Designated countries for regional patents

Kind code of ref document: A3

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE

DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
122 Ep: pct application non-entry in european phase