Resolving mutations in a partially-loaded spreadsheet model

• US 9,311,622 B2
• Filed: 01/15/2013
• Issued: 04/12/2016
• Est. Priority Date: 01/15/2013
• Status: Active Grant

• Current Assignee: Google LLC (Alphabet Inc.)
• Original Assignee: Google Inc. (Alphabet Inc.)
• Inventors: Karve, Amod, Haldimann, Niklaus
• Primary Examiner(s): KATSIKIS, KOSTAS J
• Application Number:
  US13/741,691
• Publication Number:
  US 20150193734A1
• Time in Patent Office: 1,183 Days
• Field of Search: 709/216, 709/219, 709/220
• US Class Current: 1/1
• CPC Class Codes: G06F 40/18 of spreadsheets form-filling G06F40/174
• CPC Class Codes: G06Q 10/10 Office automation; Time management

Abstract

A method of resolving mutations in a partially-loaded spreadsheet model includes loading onto a client computer a first chunk of a spreadsheet stored on a server, where the first chunk represents a first range of cells in the spreadsheet, and requesting a second chunk of the spreadsheet from the server, where the second chunk represents a second range of cells in the spreadsheet. The method further includes storing a plurality of pending user mutations on the client computer generated by a user on the client computer, where the plurality of pending user mutations are applied to the first chunk, and receiving from the server a plurality of collaborator mutations and the second chunk. The method further includes transforming the plurality of pending user mutations against the plurality of collaborator mutations, and applying the transformed plurality of pending user mutations to the second chunk.

Claims

1. A method for resolving mutations in a partially-loaded spreadsheet model, the method comprising:

loading onto a client computer a first chunk of a spreadsheet stored on a server, wherein the first chunk represents a first range of cells in the spreadsheet;

requesting a second chunk of the spreadsheet from the server, wherein the second chunk represents a second range of cells in the spreadsheet;

storing a plurality of pending user mutations on the client computer generated by a user in a pending queue on the client computer, wherein the plurality of pending user mutations are applied to the first chunk, wherein each mutation in the plurality of mutations in the pending queue is labeled in a label as an unsent mutation;

periodically sending, the plurality of pending user mutations from the client computer to the server to be applied to the spreadsheet and after sending the plurality of mutations to the server, changing the label of each mutation in the plurality of mutations from the unsent mutations to a sent mutation;

receiving at the client computer, from the server, an acknowledgement after the plurality of pending user mutations are applied to the spreadsheet;

deleting the plurality of pending user mutations from the pending queue after the client computer receives the acknowledgement from the server;

receiving from the server a plurality of collaborator mutations;

receiving from the server the second chunk;

transforming the plurality of pending user mutations against the plurality of collaborator mutations; and

applying the transformed plurality of pending user mutations to the second chunk.

2. The method of claim 1, wherein the transforming includes applying an operational transformation on the plurality of pending user mutations against the plurality of collaborator mutations.

3. The method of claim 1, wherein each collaborator mutation in the plurality of collaborator mutations is associated with a revision number and the second chunk is associated with a revision number.

4. The method of claim 3, the method further comprising applying to the second chunk each collaborator mutation with a revision number higher than the revision number of the second chunk.

5. The method of claim 3, wherein the revision numbers of each collaborator mutation and the second chunk is assigned by the server.

6. The method of claim 1, the method further comprising:

transforming the plurality of collaborator mutations against the plurality of pending user mutations; and

applying the transformed plurality of collaborator mutations to the first chunk.

7. The method of claim 1, wherein a first user mutation in the plurality of pending user mutations affects a cell in the second range of cells.

8. The method of claim 1, wherein a first collaborator mutation in the plurality of collaborator mutations affects a cell in the first range of cells.

9. The method of claim 1, wherein the pending user mutations include user mutations that have not been sent to the server.

10. The method of claim 1, wherein the pending user mutations include user mutations that have been sent to the server but without an acknowledgement from the server that the user mutations have been saved.

11. A system for resolving mutations in a partially-loaded spreadsheet model, the system comprising:

a client computer, wherein the client computer is configured to;

communicate with a server using a communication connection;

load a first chunk of a spreadsheet stored on the server, wherein the first chunk represents a first range of cells in the spreadsheet;

request a second chunk of the spreadsheet from the server, wherein the second chunk represents a second range of cells in the spreadsheet;

store a plurality of pending user mutations generated by a user on the client computer in a pending queue, wherein the plurality of pending user mutations are applied to the first chunk, wherein each mutation in the plurality of mutations in the pending queue is labeled in a label as an unsent mutation;

periodically send, the plurality of pending user mutations from the client computer to the server to be applied to the spreadsheet and after sending the plurality of mutations to the server, changing the label of each mutation in the plurality of mutations from the unsent mutations to a sent mutation;

receive at the client computer, from the server, an acknowledgement after the plurality of pending user mutations are applied to the spreadsheet;

delete the plurality of pending user mutations from the pending queue after the client computer receives the acknowledgement from the server;

receive from the server a plurality of collaborator mutations;

receive from the server the second chunk;

transform the plurality of pending user mutations against the plurality of collaborator mutations; and

apply the transformed plurality of pending user mutations to the second chunk.

12. The system of claim 11, wherein the client computer transforms the plurality of pending user mutations by applying an operational transformation on the plurality of pending user mutations against the plurality of collaborator mutations.

13. The system of claim 11, wherein each collaborator mutation in the plurality of collaborator mutations is associated with a revision number and the second chunk is associated with a revision number.

14. The system of claim 13, wherein the client computer is further configured to apply to the second chunk each collaborator mutation with a revision number higher than the revision number of the second chunk.

15. The system of claim 13, wherein the revision numbers of each collaborator mutation and the second chunk is assigned by the server.

16. The system of claim 11, wherein the server is further configured to:

transform the plurality of collaborator mutations against the plurality of pending user mutations; and

apply the transformed plurality of collaborator mutations to the first chunk.

17. The system of claim 11, wherein a first user mutation in the plurality of pending user mutations affects a cell in the second range of cells.

18. The system of claim 11, wherein a first collaborator mutation in the plurality of collaborator mutations affects a cell in the second range of cells.

19. The system of claim 11, wherein the pending user mutations include user mutations that have not been sent to the server.

20. The system of claim 11, wherein the pending user mutations include user mutations that have been sent to the server but without an acknowledgement from the server that the user mutations have been saved.

21. A method for resolving mutations in a partially-loaded spreadsheet model, the method comprising:

loading onto a client computer a first chunk of a spreadsheet stored on a server, wherein the first chunk represents a first range of cells in the spreadsheet;

searching local memory of the client computer for a second chunk of the spreadsheet, wherein the second chunk represents a second range of cells in the spreadsheet;

storing a plurality of pending user mutations on the client computer generated by a user on the client computer in a pending queue, wherein the plurality of pending user mutations are applied to the first chunk, wherein each mutation in the plurality of mutations in the pending queue is labeled in a label as an unsent mutation;

periodically sending, the plurality of pending user mutations from the client computer to the server to be applied to the spreadsheet and after sending the plurality of mutations to the server, changing the label of each mutation in the plurality of mutations from the unsent mutations to a sent mutation;

receiving at the client computer, from the server, an acknowledgement after the plurality of pending user mutations are applied to the spreadsheet;

deleting the plurality of pending user mutations from the pending queue after the client computer receives the acknowledgement from the server;

receiving from the server a plurality of collaborator mutations;

retrieving the second chunk from the local memory;

transforming the plurality of pending user mutations against the plurality of collaborator mutations; and

applying the transformed plurality of pending user mutations to the second chunk.

22. The method of claim 21, wherein the local memory is a browser cache.

23. The method of claim 21, wherein the transforming includes applying an operational transformation on the plurality of pending user mutations against the plurality of collaborator mutations.

24. The method of claim 21, wherein each collaborator mutation in the plurality of collaborator mutations is associated with a revision number and the second chunk is associated with a revision number.

25. The method of claim 24, the method further comprising applying to the second chunk each collaborator mutation with a revision number higher than the revision number of the second chunk.

26. The method of claim 24, wherein the revision numbers of each collaborator mutation and the second chunk is assigned by the server.

27. The method of claim 21, the method further comprising:

transforming the plurality of collaborator mutations against the plurality of pending user mutations; and

applying the transformed plurality of collaborator mutations to the first chunk.

28. The method of claim 21, wherein a first user mutation in the plurality of pending user mutations affects a cell in the second range of cells.

29. The method of claim 21, wherein a first collaborator mutation in the plurality of collaborator mutations affects a cell in the first range of cells.

30. The method of claim 21, wherein the pending user mutations include user mutations that have not been sent to the server.

31. The method of claim 21, wherein the pending user mutations include user mutations that have been sent to the server but without an acknowledgement from the server that the user mutations have been saved.