Fast merge support for legacy documents

Information

  • Patent Grant
  • 8346768
  • Patent Number
    8,346,768
  • Date Filed
    Thursday, April 30, 2009
    15 years ago
  • Date Issued
    Tuesday, January 1, 2013
    11 years ago
Abstract
A method is presented for merging document metadata at a client computer. A document obtained from a server computer is opened by a user at the client computer. If the document does not include paragraph identifiers, a paragraph identifier is assigned to each paragraph in the document. When the document is opened by a second user at a second client computer, metadata for the document is received from the server computer. A determination is made whether to merge the metadata received from the server computer with current metadata for the document. When it is determined that the current metadata and the metadata received from the server computer should be merged, paragraph identifiers are adjusted in the document based on the metadata received from the server computer.
Description
BACKGROUND

Network-based document collaboration systems permit multiple users to simultaneously access and coauthor a document. Although multiple users are permitted to coauthor a document, in order to prevent conflicts, the system may restrict the areas in a document in which each user can make edits to minimize chances for conflicting changes when the copies of the documents are merged.


Legacy systems typically may not allow for the coauthoring of documents created on the legacy systems. Documents created on these systems may therefore not be configured properly to support coauthoring on document collaboration systems. This can result in undesired conflicting edits.


SUMMARY

Embodiments of the disclosure are directed to a method for merging document metadata at a client computer. A document is obtained from a server computer by a user at the client computer, and the document is opened at the client computer. In response to opening the document at the client computer, a determination is made as to whether the document includes unit identifiers. When it is determined that the document does not include unit identifiers, a unit identifier is assigned to each unit in the document.


A first message is received from the server computer providing notification that at least one other user is authoring the document. In response to receiving the first message from the server computer providing notification that at least one other user is authoring the document, a second message is sent to the server computer, the second message including first metadata for the document. In response to sending the second message to the server computer, a third message is received from the server computer, the third message including second metadata for the document. In response to receiving the third message from the server computer, a determination is made whether the first metadata and the second metadata should be merged. When it is determined that the first metadata and the second metadata should be merged, unit identifiers are adjusted in the document based on the second metadata.


The details of one or more techniques are set forth in the accompanying drawings and the description below. Other features, objects, and advantages of these techniques will be apparent from the description, drawings, and claims.





DESCRIPTION OF THE DRAWINGS


FIG. 1 shows an example system for fast merge support of legacy documents.



FIG. 2 shows example modules of an example client computer of FIG. 1 that implements a capability for fast merge support of legacy documents.



FIG. 3 an example of document identifier renumbering during a metadata merge operation.



FIG. 4 shows a flowchart of a method for merging document metadata at a client computer.



FIG. 5 shows a flowchart of a method for determining whether metadata should be merged at a client computer.



FIG. 6 shows example components of the client computer of FIG. 2.





DETAILED DESCRIPTION

The present application is directed to systems and methods for creating unit identifiers for legacy documents created on legacy network-based shared document systems that do not provide unit identifiers.


In example embodiments, a document is broken into units. Units can be any subpart of a document, for example sentences, paragraphs, headings, drawings, tables, etc. A document may contain only one unit, for example a single table, sentence, or multiple units, such as multiple tables, sentences, or paragraphs. For the example embodiments disclosed herein, a document unit is a paragraph of the document.


Legacy documents are those documents that were created by legacy systems that do not provide for coauthoring. The legacy documents therefore do not include paragraph identifiers. Paragraph identifiers are created for a legacy document when the document is saved on a document collaboration system or when two or more authors edit the document on the document collaboration system.


Because paragraph identifiers are created for a legacy document in this manner, when two or more authors using the document collaboration system access the same legacy document, paragraphs currently being edited by one of the authors are identified and paragraph locks are propagated to the other authors. The paragraph locks prevent the authors that are not currently editing a locked paragraph from editing the locked paragraph until the lock is removed. In this disclosure, an author is defined as a user who is creating or editing a document.


The systems and methods also provide for comparing and merging paragraph identifiers in documents and for providing paragraph identifier merging and paragraph lock propagation. A unique set of paragraph identifiers is created each time an author accesses a legacy document that does not include paragraph identifiers. When a second author accesses the same legacy document, the paragraph identifiers are compared and merged so that each author has a synchronized set of paragraph identifiers for the legacy document.



FIG. 1 shows an example system 100 that supports fast merging of legacy documents. The system 100 includes clients 102, 104, a server 106 and a network 108. More or fewer clients and servers can be used. In this disclosure the terms client and client computer are used interchangeably and the terms server and server computer are used interchangeably.


Among the plurality of information stored on the clients 102, 104 is a client operating system (“OS”) and client applications. The client OS is a program that manages the hardware and software resources of the client system. The client applications utilize the resources of the clients 102, 104 to directly perform tasks specified by a user, for example a user who is authoring a document. For example, the clients 102, 104 include one or more software applications, such as word processing programs, that are used to create and edit document files. One example of such an application is Microsoft Word from Microsoft Corporation of Redmond, Wash. Other examples of such applications are also applicable.


Server 106 is a file server that is accessible through a network. Server 106 stores a plurality of files. These files can include both software applications and documents, as described further herein. Server 106 controls access to the documents stored by the server 106.


In example embodiments, the server 106 can be located within an organization or can be part of a document collaboration system. An example document collaboration system is a SHAREPOINT® team services portal server services provided by Microsoft Corporation. An example shared document server is Microsoft Office SharePoint Server 2007 provided by Microsoft Corporation. Other configurations can be used.


In example embodiments, paragraph identifiers are merged and paragraph locks are propagated through a metadata channel 111 that is separate from a data channel 113 used to save the edited contents of the document. By transmitting metadata separately from document content, authors are able to receive paragraph locks fast, independent of a content save operation. Because the paragraph locks prevent two or more authors from editing the same content simultaneously, the integrity of the coauthoring process is enhanced.



FIG. 2 shows a detailed view of the logical modules of client computer 102. Client computer 102 includes example document processing module 202, example metadata processing module 204 and example metadata merge module 206. The example document processing module 202 supports the creation, editing and saving of document content, such as text, headers, tables, illustrations, etc. The example document processing module 202 also supports the processing of information about document content, known as metadata. The example document processing module 202 implements a word processing application, for example the Microsoft Word word processing application from Microsoft Corporation.


The example metadata processing module 204 processes the metadata in the document. Some examples of metadata are the document name, date of creation or last edit, document identifier, revision identifier, paragraph identifiers, paragraph range, and paragraph locks. Other kinds of document metadata are possible.


A paragraph identifier is a number that identifies each paragraph in a document. In example embodiments, paragraph identifiers may include identifiers for sub-units of a document such as headers and footers in addition to actual paragraphs.


A paragraph lock is metadata that indicates that an author is editing a paragraph of a document. In order to avoid conflicts, only one author is permitted to edit the same content at the same time. When one author edits a paragraph of a document, a paragraph lock is received for that paragraph for all other authors that have the document open. The document lock prevents these other authors from editing the paragraph until the lock is removed.


Additional details regarding such locks can be found in U.S. patent application Ser. No. 12/145,536 filed on Jun. 25, 2008, the entirety of which is hereby incorporated by reference.


When an author on client computer 102 opens a legacy document that does not include paragraph identifiers, the example metadata processing module 204 generates a document identifier for the document. The document identifier is typically a number that is randomly generated from a specific number range. For example, the document identifier may be a 32-bit number that is in the range from 1 to 0x7fffffff.


The example metadata processing module 204 assigns the document identifier to the first paragraph in the document. The remaining paragraphs are then sequentially numbered from the document identifier. For example, if there are five paragraphs in the document and the randomly generated document identifier is 1000, the five paragraphs are assigned paragraph identifiers 1000, 1001, 1002, 1003 and 1004, respectively.


The example metadata processing module 204 also identifies as metadata the next paragraph number in the paragraph identifier sequence. In this example, the next paragraph identifier is 1005. Although the paragraph identifiers are sequentially generated when a document is initially opened, paragraph identifiers for any paragraphs that may be added as a result of editing the document are randomly generated.


When the author on client 102 opens the document, the example metadata processing module 204 also obtains a revision identifier for the document. Each document stored in the example document collaboration system includes a revision identifier that identifies a version number for the document. In some example embodiments, the revision identifier may be part of a file system identifier for the document. The example metadata processing module 204 keeps track of the revision identifier as metadata.


Because at this time, the author on client 102 is the only author that has opened the document, the document does not contain any paragraph locks. The author on client 102 is free to edit the document at will, editing existing paragraphs, deleting paragraphs, adding new paragraphs, making formatting changes, etc. Until the author on client 102 saves these changes, the server 106 does not know about the changes.


When an author on client 104 opens a copy of the same document, server 106 presents the author on client 104 with a version of the document that does not include the changes the author on client 102 made to the document if the author on client 102 has not saved the document before client 104 opens the document.


When the document is opened on client 104, the example metadata processing module 204 on client 104 randomly generates a document identifier for the version of the document opened at client 104. The example metadata processing module 204 on example client 104 assigns the document identifier to the first paragraph of the document opened on client 104 and sequentially assigns paragraph numbers to the remaining paragraphs of the document opened on client 104.


Because the document identifiers are randomly generated, the document and paragraph identifiers for the copies of the document opened at clients 102 and 104 are different. In order to propagate paragraph locks to the two opened documents, the paragraph identifiers for each opened document must be merged and synchronized. This is because paragraph locks are associated with specific paragraphs. Therefore, paragraphs having common content on multiple copies of opened documents are required to have to have identical paragraph identifiers.


The example metadata merge module 206 compares and synchronizes paragraph identifiers between documents. When the author on client 104 opens the document, server 106 informs the author on client 104 that there is at least one other user already authoring the document. Server 106 also informs the author on client 102 that another author has opened the document. When the author at client 102 discovers that another author has opened the document, the example metadata merge module 206 on client 102 sends metadata to server 106. Similarly, when the author at client 104 discovers that another author has opened the document, the example metadata merge module 206 at client 104 sends metadata to server 106 using the metadata channel 111.


The example metadata sent to server 106 by clients 102 and 104 includes three metadata components—the document identifier, the next paragraph identifier and the revision identifier. In example embodiments, these three components are called a metadata seed. When server 106 receives the metadata seed from clients 102 and 104, server 106 determines which metadata seed arrived first. The metadata seed that arrived at server 106 first is considered the winner. The winning metadata seed information is then propagated to the other authors. For example, if server 106 receives the metadata seed from client 104 first, the metadata seed information on client 102 is merged with the metadata seed information from client 104.



FIG. 3 shows an example of how the example metadata merge module 206 merges metadata using metadata from two authors. When an author on client 102 initially opens a document that doesn't include paragraph identifiers (e.g., a document created on a legacy system that does not support coauthoring), metadata operations merge module 204 assigns paragraph identifiers to each paragraph of the document. An example set of paragraph identifiers is shown for example document copy 302. In this example, there are six paragraphs in the document with paragraph identifiers 1000, 1001, 1002, 1003, 1004 and 1005, respectively.


During the editing of the document, the author on client 102 deletes paragraph 1003 and adds paragraphs with paragraph identifiers 2002, 8123 and 9123. This is shown in example document copy 304. The author on client 102 is able to modify, add, and/or delete any paragraph in the document because currently there are no other users authoring the document so there are no paragraph locks on the document. The added paragraphs have paragraph identifiers that are randomly generated, as described above.


After the author on client 102 makes the changes to the document shown in example document copy 304, the author on client 104 opens a copy of the document. A copy of the document is obtained from server 106. Because the changes to the document made by the author on client 102 have not yet been saved to server 106, the document opened by the author on client 104 contains the same content as shown in example document copy 302.


When the document is opened on client 104, the metadata operations module 204 on client 104 randomly generates a document identifier for the document opened at client 104. In this example, the document identifier is 2000. The example metadata operations module 204 on client 104 assigns the document identifier 2000 to the first paragraph of the document opened on client 104. The example metadata operation module 204 on client 104 then sequentially numbers the remaining paragraphs in the document. The resulting paragraph numbering is shown in example document copy 306.


At some given interval, clients 102, 104 both synchronize the metadata associated with the document. This synchronization happens over the metadata channel 111, as described above. In example embodiments, the synchronization interval can be set to happen at a specific period, such as every 2 second, 5 second, 10 seconds, 20, seconds, 30 seconds, 1 minute, 5 minutes, 10 minutes, or 30 minutes. Other intervals can be used.


In the example, the metadata seed from client 104 is received at server 106 first. When server 106 determines that the metadata seed from client 104 was received first and is the winning seed, server 106 sends the metadata seed received from client 104 to client 102. When client 102 receives the metadata seed from server 106, the example metadata merge module 206 on client 102 merges the metadata seed received from server 106 with the paragraph metadata on client 102. The result of the merge is shown in example document copy 308.


Example document copy 308 shows that as a result of the merge, paragraphs identifiers 1000, 1001, 1002, 1004 and 1005 (from example document copy 304) are changed to 2000, 2001, 2002, 2004 and 2005, respectively. Because the document identifier of the winning seed is 2000, the example metadata merge module 206 on client 102 renumbers the paragraphs in the paragraph range determined from the metadata seed received from server 106. The renumbering makes the paragraphs in the paragraph range consistent with the document identifier 2000. The paragraph range can be determined from the metadata seed because the metadata seed includes the document identifier (which is also the first paragraph of the paragraph range) and the next paragraph identifier (which is the next sequential paragraph identifier following the last paragraph identifier in the paragraph range) and because all the paragraphs in the paragraph range are sequentially numbered. Therefore, the first paragraph in the document opened at client 102 is renumbered from 1000 to 2000. The paragraph range includes paragraphs 1000 through 1005. Therefore, paragraph 1001 is renumbered to 2001, paragraph 1002 is renumbered to 2002, paragraph 1004 is renumbered to 2004 and paragraph 1005 is renumbered to 2005. As discussed earlier, paragraph 1003 was deleted.


The metadata merge module 206 on client 102 also determines all paragraph identifiers the document opened at client 102 that are not included in the paragraph range. This includes paragraphs with paragraph identifiers 2002, 8123 and 9123 that were added to example document copy 304. Because added paragraph 2002 conflicts with renumbered paragraph 2002 (original paragraph 1002), the example metadata merge module 206 renumbers added paragraph 2002 to 1002. The example metadata merge module 206 renumbers added paragraph 2002 to 1002 because paragraph identifier 1002 is no longer used in the document and, therefore, there is no conflict if paragraph 1002 is used. The example metadata merge module 206 does not change paragraph identifiers 8123 and 9123 because there are no conflicts caused by these paragraph identifiers.


When the metadata merge is completed, paragraphs with common content for the document opened on client 102 and for the document opened on client 104 have identical paragraph identifiers. For example, if before the merge paragraphs having identifiers 1000, 1001, 1002, 1004 and 1005 for the document opened on client 102 have common content with paragraphs having identifiers 2000, 2001, 2002, 2004 and 2005, respectively for the document opened on client 104, after the merge, these paragraphs on both client 102 and client 104 have paragraph identifiers 2000, 2001, 2002, 2004 and 2005. This permits paragraph locks to be assigned to these paragraphs. For example, when an author at client 102 edits paragraph 2004, a paragraph lock is transmitted to the document at client 104, preventing client 104 from editing paragraph 2004. The paragraph lock assures that multiple authors cannot edit the same paragraph simultaneously.


When the author on client 102 performs a save operation, the content changes for the document opened on client 102 are sent to server 106 through the data channel 113. In addition to transmitting content changes, the save operation also removes any paragraph locks associated with the paragraphs previously edited on client 102. The change in locks is communicated through the metadata channel 111.


The saved content and the removal of the paragraph locks are propagated to all authors that are currently authoring the document. This permits the authors to edit paragraphs that were previously locked. However, once an author starts editing a paragraph, a new paragraph lock is created and propagated to all other authors that are currently editing the document through the metadata channel 111.


Once the paragraph identifiers are synchronized, further changes to the document by either client 102 or client 104 can be synchronized using the paragraph identified in the manner described in U.S. patent application Ser. No. 11/951,973, now U.S. Pat. No. 8,028,229, filed on Dec. 6, 2007, the entirety of which is hereby incorporated by reference.


The above discussion of metadata merging describes two authors. In other example embodiments, more than two authors may edit the same document. The same metadata merge operations apply for example embodiments having more than two authors.



FIG. 4 shows an example flowchart of a method 400 for merging document metadata at a client computer. At operation 402, an author on example client 102 obtains a document from example server 106 and opens the document on client 102. Server 106 is a server such as Microsoft SharePoint Server 2007, used with an Internet-based document collaboration system such as Microsoft SharePoint. Client 102 opens the document with a word processing program such as Microsoft Word. Example method 400 assumes that at the time the author at client 102 opens the document, no other authors have the document open.


At operation 404, client 102 determines whether the document includes paragraph identifiers. Typically, legacy documents stored on server 106 do not include paragraph identifiers because the legacy documents are created by word processing applications that do not support coauthoring or include paragraph identifiers. If the document does include paragraph identifiers, client 102 can start editing the document at operation 406.


If the document does not include paragraph identifiers, paragraph identifiers are assigned to the document at operation 408. The example metadata operations module 204 randomly generates a document identifier for the document. The document identifier, typically a 32-bit number with a range from 1-0x7fffffff, is then assigned to the first paragraph of the document. Then, the remaining paragraphs are sequentially numbered from the document identifier.


At operation 410, the author on client 102 proceeds to edit the document. Because the author on client 102 is the only author that has opened the document, the author on client 102 can edit any paragraph of the document and can also add and delete paragraphs.


At operation 412, client 102 receives a message from server 106 that provides notification to client 102 that at least one other author, for example an author on client 104, has opened the document. When client 102 receives notification that at least one other author has opened the document, at operation 414 the example metadata operations module 204 on client 102 sends first metadata to server 106. The first metadata includes a metadata seed for the document open on client 102, including the document identifier, a next paragraph identifier and a revision identifier.


At operation 416, client 102 receives a message from server 106 that includes second metadata. The second metadata originates from one of the other authors who is authoring the document, for example the author on client 104. The second metadata represents the winning metadata seed received at server 106. The winning metadata seed is the first metadata seed received at server 106 from the at least one other authors that are authoring the document. The second metadata includes the document identifier, next paragraph identifier and revision identifier from the client that sends the winning metadata seed to server 106, for example client 104.


At operation 418, client 102 determines whether the first metadata and the second metadata should be merged. The steps involved in determining whether the first metadata and the second metadata should be merged are shown in FIG. 5 and discussed later in this disclosure. If it is determined that the first metadata and the second metadata should not be merged, at operation 420 the author at client 102 continues to edit the document.


If it is determined that the first metadata and the second metadata should be merged, at operation 422 the example metadata merge module 206 on client 102 merges the first metadata and the second metadata. The metadata is merged by adjusting paragraph identifiers in the document opened by the author on client 102. The operation of adjusting paragraph identifiers includes changing the paragraph identifiers for all paragraphs in the document opened on client 102 that have common content with corresponding paragraphs in the document opened on client 104. The paragraph identifiers on the document opened on client 102 are changed to corresponding paragraph identifiers indicated by the document identifier and the next paragraph identifier included in the second metadata. For example, if paragraphs 1-3 on the document opened on client 102 have common content with paragraphs 1-3 on the document opened on client 104 and if the document identifier for the document on client 102 is 1000 and the document identifier in the second metadata is 2000, the first three paragraphs in the document on client 104 are renumbered to 2000, 2001 and 2002.


In addition, if it is determined that paragraphs added to the document opened on client 102, but not saved, have paragraph identifiers in the paragraph range indicated by the second metadata, the example metadata merge module 206 changes these paragraph identifiers so that they are unique in the document.



FIG. 5 shows an example flowchart of a method 418 for determining whether metadata should be merged at a client computer. The method is implemented when an author at a client computer, for example client computer 102, edits a document that includes a first metadata seed and the client computer receives a second metadata seed from a server computer. The second metadata seed represents metadata from a second author that has opened the document. The second metadata seed represents the first metadata seed received at the server computer from one or more authors that have opened and are authoring the document. The metadata seeds include a document identifier, a next page identifier and a revision identifier.


At operation 502, a determination is made whether the revision identifier from the first metadata seed matches the revision identifier from the second metadata seed. The revision identifier indicates the version of the document. In order to merge metadata, the documents must be at the same revision level. This is because when each author initially opens the document, the content of both documents must be the same. When it is determined that the revision identifier from the first metadata seed does not match the revision identifier from the second metadata seed, at operation 504 metadata is not merged and the author at client 102 continues editing.


When it is determined that the revision identifier from the first metadata seed matches the revision identifier from the second metadata seed, at operation 506 a determination is made whether the document identifier from the first metadata seed matches the document identifier from the second metadata seed. When the document identifiers match, it indicates that documents have already been synchronized and that a metadata merge is not necessary. In this case, at operation 508 metadata is not merged and the author at client 102 continues editing.


When it is determined that the document identifier from the first metadata seed does not match the revision identifier from the second metadata seed, at operation 510, a determination is made whether the size of the paragraph range as determined from the first metadata seed matches the size of the paragraph range as determined from the second metadata seed. When it is determined that the paragraph ranges are not the same, at operation 512 metadata is not merged and the author at client 102 continues editing.


When it is determined that the paragraph range as determined that the paragraph ranges are the same, at operation 514 the first metadata seed and the second metadata seed are merged. The merging of the first metadata seed and the second metadata seed comprises adjusting paragraph identifiers in the document opened on client 102 per operation 422, as discussed.


With reference to FIG. 6, example components of client 102 are shown. In example embodiments, the client 102 is a computing device, such as a desktop computer, laptop computer, personal data assistant, or cellular device. The client 102 can include input/output devices, a central processing unit (“CPU”), a data storage device, and a network device.


In a basic configuration, the computing device 102 typically includes at least one processing unit 602 and system memory 604. Depending on the exact configuration and type of computing device, the system memory 604 may be volatile (such as RAM), non-volatile (such as ROM, flash memory, etc.) or some combination of the two. System memory 704 typically includes an operating system 606 suitable for controlling the operation of a networked personal computer, such as the WINDOWS® operating systems from MICROSOFT CORPORATION of Redmond, Wash. or a server, such as Windows SharePoint Server 2007, also from MICROSOFT CORPORATION of Redmond, Wash. The system memory 604 may also include one or more software applications 608 and may include program data.


The computing device 102 may have additional features or functionality. For example, the computing device 102 may also include additional data storage devices (removable and/or non-removable) such as, for example, magnetic disks, optical disks, or tape. Such additional storage is illustrated in FIG. 6 by removable storage 610 and non-removable storage 612. Computer storage media may include volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information, such as computer readable instructions, data structures, program modules, or other data. System memory 604, removable storage 610 and non-removable storage 612 are all examples of computer storage media. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disks (DVD) or other optical storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed by computing device 102. Any such computer storage media may be part of device 102. Computing device 102 may also have input device(s) 614 such as keyboard, mouse, pen, voice input device, touch input device, etc. Output device(s) 616 such as a display, speakers, printer, etc. may also be included. These devices are well known in the art and need not be discussed at length here.


The computing device 102 may also contain communication connections 618 that allow the device to communicate with other computing devices 620, such as over a network in a distributed computing environment, for example, an intranet or the Internet. Communication connection 618 is one example of communication media. Communication media may typically be embodied by computer readable instructions, data structures, program modules, or other data in a modulated data signal, such as a carrier wave or other transport mechanism, and includes any information delivery media. The term “modulated data signal” means a signal that has one or more of its characteristics set or changed in such a manner as to encode information in the signal. By way of example, and not limitation, communication media includes wired media such as a wired network or direct-wired connection, and wireless media such as acoustic, RF, infrared and other wireless media. The term computer readable media as used herein includes both storage media and communication media.


The various embodiments described above are provided by way of illustration only and should not be construed to limiting. Various modifications and changes that may be made to the embodiments described above without departing from the true spirit and scope of the disclosure.

Claims
  • 1. A method implemented on a client computer, for merging document metadata at a client computer, the method comprising: obtaining, by the client computer, a document from a server computer at the client computer, the document being requested by a user at the client computer;opening the document at the client computer;in response to opening the document at the client computer, determining, by the client computer, whether the document includes unit identifiers, the unit identifiers including one or more paragraph identifiers, sentence identifiers or table identifiers;when a determination is made that the document does not include paragraph identifiers, assigning a paragraph identifier to each paragraph in the document;receiving a first message from the server computer providing notification that at least one other user is authoring the document;in response to receiving the first message from the server computer that at least one other user is authoring the document, sending a second message to the server computer, the second message including first metadata for the document, the first metadata including a first next paragraph identifier for the document, a first document identifier and a first revision identifier;determining a first paragraph identifier range from the first document identifier and from the first next paragraph identifier, a first identifier in the first paragraph identifier range being the first document identifier and a last identifier in the first paragraph identifier range being one less than the first next paragraph identifier;in response to sending the second message to the server computer, receiving a third message from the server computer, the third message including second metadata for the document, the second metadata including a second next paragraph identifier for the document, a second document identifier and a second revision identifier;determining a second paragraph identifier range from the second document identifier and from the second next paragraph identifier, a first identifier in the second paragraph identifier range being the second document identifier and a last identifier in the second paragraph identifier range being one less than the second next paragraph identifier;in response to receiving the third message from the server computer, determining whether the first metadata and the second metadata should be merged by: determining whether the first revision identifier matches the second revision identifier;when a determination is made that the first revision identifier matches the second revision identifier, determining whether the first document identifier matches the second document identifier;when a determination is made that the first revision identifier matches the second revision identifier and when a determination is made that the first document identifier does not match the second document identifier, determining whether a size of the first paragraph identifier range matches a size of the second paragraph identifier range; andwhen a determination is made that the first revision identifier matches the second revision identifier, when a determination is made that the first document identifier does not match the second document identifier and when a determination is made that the size of the first paragraph identifier range matches the size of the second paragraph identifier range, determining that the first metadata and the second metadata should be merged; andwhen a determination is made that the first metadata and the second metadata should be merged, adjusting paragraph identifiers in the document based on the second metadata.
  • 2. The method of claim 1, wherein the first paragraph identifier range is determined from the first document identifier and wherein the second paragraph identifier range is determined from the second metadata, the first paragraph identifier range including a first identifier and a last identifier and the second paragraph identifier range including a first identifier and a last identifier, the first identifier in the first paragraph identifier range having an initial value equal to the first document identifier and the last identifier in the first paragraph identifier range having a value equal to one less than the first next paragraph identifier, the first identifier in the second paragraph identifier range have an initial value equal to the second document identifier and the last identifier in the second paragraph identifier range have a value equal to one less than the second next paragraph identifier.
  • 3. The method of claim 2, wherein the first document identifier is randomly generated, wherein each paragraph in the first paragraph identifier range is sequentially numbered starting from the first document identifier, and wherein each paragraph in the second paragraph identifier range is sequentially numbered starting from the second document identifier.
  • 4. The method of claim 3, wherein adjusting paragraph identifiers in the document based on the second metadata comprises changing the first identifier in the first paragraph identifier range to the second document identifier.
  • 5. The method of claim 4, further comprising changing paragraph identifiers for paragraphs included in the first paragraph identifier range to corresponding paragraph identifiers included in the second paragraph identifier range.
  • 6. The method of claim 5, further comprising determining whether one or more paragraph identifiers from paragraphs not included in the first paragraph identifier range are included in the second paragraph identifier range.
  • 7. The method of claim 5, further comprising, when a determination is made that one or more paragraph identifiers from paragraphs not included in the first paragraph identifier range are included in the second paragraph identifier range, changing the one or more paragraph identifiers from paragraphs not included in the first paragraph identifier range to a paragraph identifier included in the first paragraph identifier range.
  • 8. A computing device, comprising: a processing unit;a system memory connected to the processing unit, the system memory comprising instructions that, when executed by the processing unit, cause the processing unit to create: a metadata processing module that generates, monitors and stores metadata for a document on the computing device, the metadata including first metadata and second metadata, the first metadata including a first document identifier, a first next paragraph identifier and a first revision identifier, the second metadata including a second document identifier, a second next paragraph identifier and a second revision identifier, the metadata processing module generating a first paragraph identifier range from the first document identifier and from the first next paragraph identifier and a second paragraph identifier range from the second document identifier and from the second next paragraph identifier, the first paragraph identifier range including a first paragraph identifier and a last paragraph identifier, the first paragraph identifier having a value equal to the first document identifier and the last paragraph identifier having a value equal to one less than the first next paragraph identifier; anda metadata merge module that merges the metadata for the document with metadata received from a server computer, wherein the metadata merge module determines that the first metadata and the second metadata should be merged and adjusts paragraph identifiers in the document based on the second metadata when a determination is made that the first revision identifier matches the second revision identifier and when a determination is made that the first document identifier does not match the second document identifier and when a determination is made that a size of the first paragraph identifier range matches a size of the second paragraph identifier range.
  • 9. The computing device of claim 8, wherein the metadata processing module stores metadata in a file on the server computer that is separate from the document.
  • 10. The computing device of claim 8, wherein the metadata processing module generates paragraph identifiers for each paragraph in the first paragraph identifier range, each paragraph identifier in the first paragraph identifier range being sequentially numbered.
  • 11. The computing device of claim 8, wherein the metadata merge module changes the second document identifier to a document identifier included in the metadata received by the server computer.
  • 12. The computing device of claim 8, wherein the metadata merge module changes a paragraph identifier of one or more paragraphs not included in the first paragraph range to a paragraph identifier included in the second paragraph range when the one or more paragraphs not included in the first paragraph range are included in a paragraph range determined from a document identifier and a next paragraph identifier included in the metadata received from the server computer.
  • 13. A computer-readable data storage memory comprising instructions that, when executed by a processing unit of an electronic computing device, cause the processing unit to: obtain a document from a server computer, the document being requested by a user at the electronic computer device;open the document;in response to opening the document, determine whether the document includes paragraph identifiers;when it is determined that the document does not include paragraph identifiers, assign a paragraph identifier to each paragraph in the document by: randomly generate an identifier for the first paragraph of the document;designate the identifier for the first paragraph of the document as a first document identifier;sequentially assign identifiers to the remaining paragraphs in the document; anddesignate a first next paragraph identifier having a value one greater than the identifier assigned to the last paragraph in the document;receive a first message from the server computer that at least one other user is authoring the document;in response to receiving the first message from the server computer that at least one other user is authoring the document, send a second message to the server computer, the second message including first metadata for the document, the first metadata including the first document identifier, the first next paragraph identifier, and a first revision identifier;determine a first paragraph identifier range from the first document identifier and from the first next paragraph identifier, the first identifier in the first paragraph identifier range being the first document identifier and the last identifier in the first paragraph identifier range being one less than the first next paragraph identifier;in response to sending the second message to the server computer, receive a third message from the server computer, the third message including second metadata for the document, the second metadata including a second document identifier, a second paragraph identifier range and a second revision identifier;determine a second paragraph identifier range from the second document identifier and from the second next paragraph identifier, the first identifier in the second paragraph identifier range being the second document identifier and the last identifier in the second paragraph identifier range being one less than the second next paragraph identifier;in response to receiving the third message from the server computer, determine whether the first metadata and the second metadata should be merged by: determine whether the first revision identifier matches the second revision identifier;when it is determined that the first revision identifier matches the second revision identifier, determine whether the first document identifier matches the second document identifier;when it is determined that the first revision identifier matches the second revision identifier and when it is determined that the first document identifier does not match the second document identifier, determine whether the size of the first paragraph identifier range matches the size of the second paragraph identifier range;when it is determined that the first revision identifier matches the second revision identifier, when it is determined that the first document identifier does not match the second document identifier and when it is determined that the size of the first paragraph identifier range matches the size of the second paragraph identifier range, determine that the first metadata and the second metadata should be merged; andwhen it is determined that the first metadata and the second metadata should be merged, adjust paragraph identifiers in the document based on the second metadata by: designate the second document identifier as the first document identifier, the second document identifier also being designated as the paragraph identifier for the first paragraph in the first paragraph identifier range;assign paragraph identifiers in the second paragraph identifier range to corresponding paragraphs in the first paragraph identifier range;determine whether a paragraph identifier in the document from a paragraph not included in the first paragraph identifier range matches a paragraph identifier in the second paragraph identifier range; andwhen it is determined that a paragraph identifier in the document from a paragraph not included in the first paragraph identifier range matches a paragraph identifier in the second paragraph identifier range, assign the paragraph identifier in the document that matches a paragraph identifier in the second paragraph identifier range to a paragraph identifier in the first paragraph identifier range.
US Referenced Citations (263)
Number Name Date Kind
4855580 Van Maanen, Jr. Aug 1989 A
5107443 Smith et al. Apr 1992 A
5142619 Webster, III Aug 1992 A
5313394 Clapp May 1994 A
5339389 Bates et al. Aug 1994 A
5446842 Schaeffer Aug 1995 A
5486686 Zdybel, Jr. et al. Jan 1996 A
5535332 Ishida Jul 1996 A
5568640 Nishiyama et al. Oct 1996 A
5623659 Shi et al. Apr 1997 A
5630138 Raman May 1997 A
5664186 Bennett et al. Sep 1997 A
5671428 Muranaga et al. Sep 1997 A
5692178 Shaughnessy Nov 1997 A
5729734 Parker et al. Mar 1998 A
5751958 Zweben et al. May 1998 A
5781732 Adams Jul 1998 A
5781908 Williams et al. Jul 1998 A
5787262 Shakib et al. Jul 1998 A
5835950 Cho et al. Nov 1998 A
5963931 Fagg, III et al. Oct 1999 A
6000945 Sanchez-Lazer et al. Dec 1999 A
6006239 Bhansali et al. Dec 1999 A
6026461 Baxter et al. Feb 2000 A
6055546 Pongracz et al. Apr 2000 A
6065026 Cornelia et al. May 2000 A
6067551 Brown et al. May 2000 A
6073161 DeBoskey et al. Jun 2000 A
6088702 Plantz et al. Jul 2000 A
6202085 Benson et al. Mar 2001 B1
6209010 Gauthier et al. Mar 2001 B1
6209128 Gerard et al. Mar 2001 B1
6240414 Beizer et al. May 2001 B1
6244575 Vaartstra et al. Jun 2001 B1
6275935 Barlow et al. Aug 2001 B1
6317777 Skarbo et al. Nov 2001 B1
6324544 Alam et al. Nov 2001 B1
6327584 Xian et al. Dec 2001 B1
6327611 Everingham Dec 2001 B1
6341291 Bentley et al. Jan 2002 B1
6342906 Kumar et al. Jan 2002 B1
6363352 Dailey et al. Mar 2002 B1
6411965 Klug Jun 2002 B2
6430576 Gates et al. Aug 2002 B1
6438548 Grim, III et al. Aug 2002 B1
6438563 Kawagoe Aug 2002 B1
6438564 Morton et al. Aug 2002 B1
6446093 Tabuchi Sep 2002 B2
6502113 Crawford et al. Dec 2002 B1
6526434 Carlson et al. Feb 2003 B1
6529905 Bray et al. Mar 2003 B1
6560614 Barboy et al. May 2003 B1
6560620 Ching May 2003 B1
6574377 Cahill et al. Jun 2003 B1
6610104 Lin Aug 2003 B1
6662209 Potts, Jr. et al. Dec 2003 B2
6681371 Devanbu Jan 2004 B1
6681382 Kakumani et al. Jan 2004 B1
6687878 Eintracht et al. Feb 2004 B1
6711718 Pfeil et al. Mar 2004 B2
6751618 Germscheid et al. Jun 2004 B1
6757678 Myllymaki Jun 2004 B2
6757696 Multer et al. Jun 2004 B2
6757767 Kelleher Jun 2004 B1
6757871 Sato et al. Jun 2004 B1
6760840 Shimbo et al. Jul 2004 B1
6772165 O'Carroll Aug 2004 B2
6842768 Shaffer et al. Jan 2005 B1
6854087 Takeo et al. Feb 2005 B1
6925476 Multer Aug 2005 B1
6976213 Letourneau et al. Dec 2005 B1
6983416 Bae et al. Jan 2006 B1
6993522 Chen et al. Jan 2006 B2
7007235 Hussein et al. Feb 2006 B1
7024429 Ngo et al. Apr 2006 B2
7024430 Ingraham et al. Apr 2006 B1
7035839 Gillespie et al. Apr 2006 B1
7039679 Mendez et al. May 2006 B2
7047407 Itoh et al. May 2006 B2
7053839 Cassel et al. May 2006 B2
7058663 Johnston et al. Jun 2006 B2
7065633 Yates, Jr. et al. Jun 2006 B1
7069505 Tamano Jun 2006 B2
7089278 Churchill et al. Aug 2006 B1
7110936 Hiew et al. Sep 2006 B2
7111237 Chan Sep 2006 B2
7124151 Choi Oct 2006 B1
7124362 Tischer Oct 2006 B2
7127501 Beir et al. Oct 2006 B1
7149776 Roy et al. Dec 2006 B1
7155465 Lee et al. Dec 2006 B2
7185277 Bernstein et al. Feb 2007 B1
7200668 Mak et al. Apr 2007 B2
7203708 Liu et al. Apr 2007 B2
7209948 Srinivasa Apr 2007 B2
7225189 McCormack et al. May 2007 B1
7240091 Hopmann et al. Jul 2007 B1
7249314 Walker et al. Jul 2007 B2
7293049 Kadyk et al. Nov 2007 B2
7310657 Nakamura Dec 2007 B2
7315978 Giles Jan 2008 B2
7328243 Yeager et al. Feb 2008 B2
7346705 Hullot et al. Mar 2008 B2
7401291 Ramaley et al. Jul 2008 B2
7496577 Williamson et al. Feb 2009 B2
7529780 Braginsky et al. May 2009 B1
7536641 Rosenstein et al. May 2009 B2
7565603 Jones et al. Jul 2009 B1
7577906 Friedrichowitz et al. Aug 2009 B2
7594163 Slack-Smith Sep 2009 B2
7603357 Gourdol et al. Oct 2009 B1
7610287 Dean et al. Oct 2009 B1
7647292 Hayashi Jan 2010 B2
7650336 Herrmann et al. Jan 2010 B1
7664750 Frees et al. Feb 2010 B2
7694217 Croft et al. Apr 2010 B2
7714222 Taub et al. May 2010 B2
7761784 Parks et al. Jul 2010 B2
7779347 Christiansen et al. Aug 2010 B2
7788326 Buchheit et al. Aug 2010 B2
7792788 Melmon et al. Sep 2010 B2
7801951 Fishkin et al. Sep 2010 B2
7839532 Brawn et al. Nov 2010 B2
7912811 Hodel-Widmer Mar 2011 B2
7941399 Bailor et al. May 2011 B2
7962853 Bedi et al. Jun 2011 B2
7966556 Bourdev Jun 2011 B1
8019780 Pinkerton et al. Sep 2011 B1
8028229 Bailor et al. Sep 2011 B2
20010018697 Kunitake et al. Aug 2001 A1
20010042075 Tabuchi Nov 2001 A1
20020007287 Straube et al. Jan 2002 A1
20020022122 Hirata et al. Feb 2002 A1
20020065848 Walker et al. May 2002 A1
20020069192 Aegerter Jun 2002 A1
20020188598 Myllymaki Dec 2002 A1
20030028600 Parker Feb 2003 A1
20030093760 Suzuki et al. May 2003 A1
20030097410 Atkins et al. May 2003 A1
20030097638 Tamano May 2003 A1
20030115481 Baird et al. Jun 2003 A1
20030140067 Sesek et al. Jul 2003 A1
20030159105 Hiebert Aug 2003 A1
20030167281 Cohen et al. Sep 2003 A1
20030172113 Cameron et al. Sep 2003 A1
20030172168 Mak et al. Sep 2003 A1
20030208534 Carmichael Nov 2003 A1
20040039829 Bucher Feb 2004 A1
20040068505 Lee et al. Apr 2004 A1
20040107224 Bera Jun 2004 A1
20040122870 Park et al. Jun 2004 A1
20040122898 Srinivasa Jun 2004 A1
20040122912 Kim et al. Jun 2004 A1
20040133858 Barnett et al. Jul 2004 A1
20040143630 Kaufmann et al. Jul 2004 A1
20040172395 Edelstein et al. Sep 2004 A1
20040177343 McVoy et al. Sep 2004 A1
20040199550 Ito et al. Oct 2004 A1
20040205539 Mak et al. Oct 2004 A1
20040205653 Hadfield et al. Oct 2004 A1
20040230903 Elza et al. Nov 2004 A1
20040239700 Baschy Dec 2004 A1
20040243644 Steere et al. Dec 2004 A1
20050004990 Durazo et al. Jan 2005 A1
20050022122 Barrus et al. Jan 2005 A1
20050033811 Bhogal et al. Feb 2005 A1
20050064858 Makela et al. Mar 2005 A1
20050071386 Wolfgang et al. Mar 2005 A1
20050097440 Lusk et al. May 2005 A1
20050177617 Banginwar et al. Aug 2005 A1
20050198132 Vellante et al. Sep 2005 A1
20050203962 Zhou et al. Sep 2005 A1
20050210392 Koide et al. Sep 2005 A1
20050216524 Gomes et al. Sep 2005 A1
20050223066 Buchheit et al. Oct 2005 A1
20050234943 Clarke Oct 2005 A1
20050240858 Croft et al. Oct 2005 A1
20050251738 Hirano et al. Nov 2005 A1
20050256907 Novik et al. Nov 2005 A1
20050262203 Buchheit et al. Nov 2005 A1
20050289512 Matsusaka Dec 2005 A1
20060015539 Wolf et al. Jan 2006 A1
20060015811 Tanaka et al. Jan 2006 A1
20060020360 Wu Jan 2006 A1
20060031264 Bosworth et al. Feb 2006 A1
20060041596 Stirbu et al. Feb 2006 A1
20060047656 Dehlinger et al. Mar 2006 A1
20060053194 Schneider et al. Mar 2006 A1
20060053195 Schneider et al. Mar 2006 A1
20060080432 Spataro et al. Apr 2006 A1
20060085402 Brown et al. Apr 2006 A1
20060101328 Albornoz et al. May 2006 A1
20060106879 Zondervan et al. May 2006 A1
20060123033 Livshits Jun 2006 A1
20060136511 Ngo et al. Jun 2006 A1
20060136809 Fernstrom Jun 2006 A1
20060200755 Melmon et al. Sep 2006 A1
20060218476 Gombert Sep 2006 A1
20060242549 Schwier et al. Oct 2006 A1
20060248038 Kaplan et al. Nov 2006 A1
20060259524 Horton Nov 2006 A1
20060265377 Raman et al. Nov 2006 A1
20070016650 Gilbert et al. Jan 2007 A1
20070066293 Peng et al. Mar 2007 A1
20070118598 Bedi et al. May 2007 A1
20070118794 Hollander et al. May 2007 A1
20070130334 Carley Jun 2007 A1
20070156672 Wolff et al. Jul 2007 A1
20070186157 Walker et al. Aug 2007 A1
20070186171 Junuzovic et al. Aug 2007 A1
20070198952 Pittenger Aug 2007 A1
20070203917 Du et al. Aug 2007 A1
20070226320 Hager et al. Sep 2007 A1
20070226604 Chalasani et al. Sep 2007 A1
20070271502 Bedi et al. Nov 2007 A1
20070283321 Hedge et al. Dec 2007 A1
20080028300 Krieger et al. Jan 2008 A1
20080059187 Roitblat et al. Mar 2008 A1
20080059539 Chin et al. Mar 2008 A1
20080072141 Hodel-Widmer Mar 2008 A1
20080086718 Bostick et al. Apr 2008 A1
20080097993 Nanba Apr 2008 A1
20080098294 Le Apr 2008 A1
20080114740 Vergottini May 2008 A1
20080126953 Davidson et al. May 2008 A1
20080147590 Bechtel et al. Jun 2008 A1
20080177782 Poston Jul 2008 A1
20080180740 Kimura et al. Jul 2008 A1
20080195800 Lee et al. Aug 2008 A1
20080235579 Champion et al. Sep 2008 A1
20080256113 Rasmussen et al. Oct 2008 A1
20080256114 Rasmussen et al. Oct 2008 A1
20080263032 Vailaya et al. Oct 2008 A1
20080270386 Ohi et al. Oct 2008 A1
20080294895 Bodner et al. Nov 2008 A1
20080320384 Nagarajan Dec 2008 A1
20090006936 Parker et al. Jan 2009 A1
20090006946 Hanson Jan 2009 A1
20090006948 Parker et al. Jan 2009 A1
20090063489 Neumann et al. Mar 2009 A1
20090094231 Marvit et al. Apr 2009 A1
20090094242 Lo et al. Apr 2009 A1
20090125518 Bailor et al. May 2009 A1
20090157811 Bailor et al. Jun 2009 A1
20090171987 Coppinger et al. Jul 2009 A1
20090193331 Croft et al. Jul 2009 A1
20090228473 Kannan et al. Sep 2009 A1
20090235158 Rosenstein et al. Sep 2009 A1
20090249224 Davis et al. Oct 2009 A1
20090271696 Bailor et al. Oct 2009 A1
20090282041 Skaria et al. Nov 2009 A1
20090282462 Skaria et al. Nov 2009 A1
20090327294 Bailor et al. Dec 2009 A1
20100023562 Kreuch et al. Jan 2010 A1
20100070464 Aymeloglu et al. Mar 2010 A1
20100088676 Yuan et al. Apr 2010 A1
20100095198 Bultrowicz et al. Apr 2010 A1
20100131836 Dukhon et al. May 2010 A1
20100278453 King Nov 2010 A1
20110055702 Jakobson Mar 2011 A1
20110184906 Bailor et al. Jul 2011 A1
20120254315 Skaria et al. Oct 2012 A1
20120278276 Bailor et al. Nov 2012
Foreign Referenced Citations (28)
Number Date Country
1276568 Dec 2000 CN
1804836 Jul 2006 CN
101042702 Sep 2007 CN
198 44 071 Apr 1999 DE
1 132 847 Sep 2001 EP
1 290 575 Jun 2005 EP
1 681 652 Jul 2006 EP
2005310158 Nov 2005 JP
10-0331685 Apr 2002 KR
10-2006-0047218 May 2006 KR
2 250 492 Apr 2005 RU
50 695 Jan 2006 RU
200424868 Nov 2004 TW
200627259 Aug 2006 TW
WO 0125986 Apr 2001 WO
WO 0125986 Apr 2001 WO
WO 0133362 May 2001 WO
WO 0188750 Nov 2001 WO
WO 0233575 Apr 2002 WO
WO 2005114467 Dec 2005 WO
WO 2007034858 Mar 2007 WO
WO 2007062949 Jun 2007 WO
WO 2009061638 May 2009 WO
WO 2009076010 Jun 2009 WO
WO 2009079116 Jun 2009 WO
WO 2009134548 Nov 2009 WO
WO 2009154842 Dec 2009 WO
WO 2009158108 Dec 2009 WO
Related Publications (1)
Number Date Country
20100281074 A1 Nov 2010 US