Facilitating memory constrained client devices by employing deck reduction techniques

Claim 1

In a computing environment capable of having a connection to a network, a computer program product for facilitating network delivery of documents encoded as decks to client devices, said computer program product residing on a storage medium readable by a computer system in said environment and comprising: computer-readable program code means for fragmenting a deck into a plurality of sub-decks if said deck has a deck size larger than a target size, wherein each of said sub-decks then has a sub-deck size smaller than said target size and wherein said fragmenting does not discard deck content, further comprising: computer-readable program code means for decoupling a plurality of cards from said deck; computer-readable program code means for building a card adjacency graph, said graph comprising a plurality of nodes and links between selected ones of said nodes, wherein each of said nodes represents a card existing in or referenced from said deck and wherein each of said links represents an adjacency relationship between a pair of cards corresponding to a pair of said selected nodes; computer-readable program code means for applying a card localization process to said card adjacency graph, further comprising computer-readable program code means for creating a set of distance tuples from said card adjacency graph; and computer-readable program code means for aggregating said decoupled cards into said sub-decks using said set of distance tuples; and computer-readable program code means for rebinding said sub-decks to one another.

Claim 10

A system for facilitating network delivery of documents encoded as decks to client devices in a computing environment capable of having a connection to a network, comprising: means for fragmenting a deck into a plurality of sub-decks if said deck has a deck size larger than a target size, wherein each of said sub-decks then has a sub-deck size smaller than said target size and wherein said fragmenting does not discard deck content, further comprising: means for decoupling a plurality of cards from said deck; means for building a card adjacency graph, said graph comprising a plurality of nodes and links between selected ones of said nodes, wherein each of said nodes represents a card existing in or referenced from said deck and wherein each of said links represents an adjacency relationship between a pair of cards corresponding to a pair of said selected nodes; means for applying a card localization process to said card adjacency graph, further comprising computer-readable program code means for creating a set of distance tuples from said card adjacency graph; and means for aggregating said decoupled cards into said sub-decks using said set of distance tuples; and means for rebinding said sub-decks to one another.

Claim 11

A system for facilitating network delivery of documents encoded as decks to client devices in a computing environment capable of having a connection to a network, comprising: means for fragmenting a deck into a plurality of sub-decks if said deck has a deck size larger than a target size, wherein each of said sub-decks then has a sub-deck size smaller than said target size and wherein said fragmenting does not discard deck content, further comprising: means for decoupling a plurality of cards from said deck; means for building a card adjacency graph, said graph comprising a plurality of nodes and links between selected ones of said nodes, wherein each of said nodes represents a card existing in or referenced from said deck and wherein each of said links represents an adjacency relationship between a pair of cards corresponding to a pair of said selected nodes; means for applying a card localization process to said card adjacency graph, further comprising computer-readable program code means for creating a set of distance tuples from said card adjacency graph; and means for aggregating said decoupled cards into said sub-decks using said set of distance tuples; and means for rebinding said sub-decks to one another.

Claim 19

A method for facilitating network delivery of documents encoded as decks to client devices in a computing environment capable of having a connection to a network, comprising the steps of: fragmenting a deck into a plurality of sub-decks if said deck has a deck size larger than a target size, wherein each of said sub-decks then has a sub-deck size smaller than said target size and wherein said fragmenting does not discard deck content, further comprising the steps of: decoupling a plurality of cards from said deck; building a card adjacency graph, said graph comprising a plurality of nodes and links between selected ones of said nodes, wherein each of said nodes represents a card existing in or referenced from said deck and wherein each of said links represents an adjacency relationship between a pair of cards corresponding to a pair of said selected nodes; applying a card localization process to said card adjacency graph, further comprising computer-readable program code means for creating a set of distance tuples from said card adjacency graph; and aggregating said decoupled cards into said sub-decks using said set of distance tuples; and rebinding said sub-decks to one another.

Claim 20

A method for facilitating network delivery of documents encoded as decks to client devices in a computing environment capable of having a connection to a network, comprising the steps of: fragmenting a deck into a plurality of sub-decks if said deck has a deck size larger than a target size, wherein each of said sub-decks then has a sub-deck size smaller than said target size and wherein said fragmenting does not discard deck content, further comprising the steps of: decoupling a plurality of cards from said deck; building a card adjacency graph, said graph comprising a plurality of nodes and links between selected ones of said nodes, wherein each of said nodes represents a card existing in or referenced from said deck and wherein each of said links represents an adjacency relationship between a pair of cards corresponding to a pair of said selected nodes; applying a card localization process to said card adjacency graph, further comprising computer-readable program code means for creating a set of distance tuples from said card adjacency graph; and aggregating said decoupled cards into said sub-decks using said set of distance tuples; and rebinding said sub-decks to one another.

Claim 28

A method of facilitating network delivery of documents encoded as decks to client devices in a computing environment capable of having a connection to a network, said decks comprising a plurality of cards, said method comprising steps of: duplicating, from an input deck which exceeds a target deck size, deck-level information into each card of said input deck, unless said card overrides said deck-level information; determining one or more sets of shared information, said shared information occurring in two or more of said cards; aggregating said cards to create new sub-decks, such that a size of each of said sub-decks is less than said target deck size, by selecting one or more of said cards in which one or more of said sets of shared information occurs and factoring out duplicated occurrences among said selected one or more cards, thereby creating one of said new sub-decks; and inserting links into said new sub-decks such that said new sub-decks can be traversed in an analogous manner as said input deck.

Claim 29

A method of facilitating network delivery of documents encoded as decks to client devices in a computing environment capable of having a connection to a network, said decks comprising a plurality of cards, said method comprising steps of: duplicating, from an input deck which exceeds a target deck size, deck-level information into each card of said input deck, unless said card overrides said deck-level information; determining one or more sets of shared information, said shared information occurring in two or more of said cards; aggregating said cards to create new sub-decks, such that a size of each of said sub-decks is less than said target deck size, by selecting one or more of said cards in which one or more of said sets of shared information occurs and factoring out duplicated occurrences among said selected one or more cards, thereby creating one of said new sub-decks; and inserting links into said new sub-decks such that said new sub-decks can be traversed in an analogous manner as said input deck.