Method for paginating a document structure of a document for viewing on a mobile communication device

1. A process for transmitting a document from a server to a mobile device on a per page basis, comprising:

building a graph structure within said server representing a map of said document; transmitting page size limit from said mobile device to said server indicative of the size of a single page of said document to be displayed by said mobile device;

traversing and paginating said graph structure into successive pages within said server based on said page size limit;

caching said pages within said server; and

transmitting said successive pages from said server to said mobile device for display by said mobile device,

wherein traversing and paginating said graph structure further comprises:

initializing a page size value;

retrieving and calculating output size of successive nodes of the graph structure;

adding the output size of said successive nodes to said page size value; and

in the event said page size value exceeds said page size limit for a given node then marking said graph structure to identify said node as starting a new page for transmission to said mobile device, and wherein marking said graph structure further comprises:

maintaining a page index value that is incremented with each new page;

adding said page index value as an attribute to each said given node for marking each said new page; and

adding each said given node as an attribute to a root node of said graph structure with a string representation of said page index value as attribute name.

2. The process of claim 1 , further comprising calculating a document ID based on contents of said document before building said graph structure, checking a memory cache of said server using said document ID for said graph having been previously built, and in the event said graph structure exists in the memory cache then omitting the building of said graph structure.

3. The process of claim 2 , wherein calculating said document ID further comprises performing a hashing function on the contents of said document and in response generating said document ID as a unique key to said map.

4. The process of claim 3 , wherein said hashing function comprises the MD5 messaging encryption algorithm.

5. The process of any one of claims 1 and 2 to 4 , wherein said graph structure is a Document Object Model (DOM).

6. A server process comprising:

building a graph structure representing a map of a document;

traversing and paginating said graph structure into successive pages based on a page size limit; and

caching said pages within said server,

wherein traversing and paginating said graph structure further comprises:

initializing a page size value;

retrieving and calculating output size of successive nodes of the graph structure;

adding the output size of said successive nodes to said page size value; and

in the event said page size value exceeds said page size limit for a given node then marking said graph structure to identify said node as starting a new page, and wherein marking said graph structure further comprises maintaining a page index value that is incremented with each new page; adding said page index value as an attribute to each said given node for marking each said new page; and adding each said given node as an attribute to a root node of said graph structure with a string representation of said page index value as attribute name.

7. The server process of claim 6 , further comprising calculating a document ID based on contents of said document before building said graph structure, checking a memory cache of said server using said document ID for said graph having been previously built, and in the event said graph structure exists in the memory cache then omitting the building of said graph structure.

8. The server process of claim 7 , wherein calculating said document ID further comprises performing a hashing function on the contents of said document and in response generating said document ID as a unique key to said map.

9. The server process of claim 8 , wherein said hashing function comprises the MD5 messaging encryption algorithm.

10. The server process of any one of claims 6 and 7 to 9 , wherein said graph structure is a Document Object Model (DOM).