Method and mechanism for reducing client-side memory footprint of transmitted data

• US 9,244,938 B2
• Filed: 08/29/2014
• Issued: 01/26/2016
• Est. Priority Date: 05/29/1998
• Status: Expired due to Fees

• Current Assignee: Oracle International Corporation (Oracle Corporation)
• Original Assignee: Oracle International Corporation (Oracle Corporation)
• Inventors: Gollapudi, Sreenivas, Chatterjee, Debashish
• Primary Examiner(s): Joo, Joshua
• Application Number:
  US14/473,650
• Publication Number:
  US 20140372387A1
• Time in Patent Office: 515 Days
• Field of Search: None
• US Class Current: 1/1
• CPC Class Codes: G06F 16/1748 De-duplication implemented within the file system, e.g. based on file segments de-duplication techniques in storage systems for the management of data blocks G06F3/0641
• CPC Class Codes: G06F 16/284 Relational databases
• CPC Class Codes: G06F 16/9574 of access to content, e.g. by caching
• CPC Class Codes: H04L 67/01 Protocols
• CPC Class Codes: H04L 67/5651 Reducing the amount or size of exchanged application data
• CPC Class Codes: H04L 69/04 Protocols for data compression, e.g. ROHC

Abstract

The present invention is directed to a method and mechanism for reducing the expense of data transmissions between a client and a server. According to an aspect of data prefetching is utilized to predictably retrieve information between the client and server. Another aspect pertains to data redundancy management for reducing the expense of transmitting and storing redundant data between the client and server. Another aspect relates to moved data structures for tracking and managing data at a client in conjunction with data redundancy management.

Claims

1. A computer-implemented process for increasing data storage efficiency, comprising:

identifying a first set of data;

determining, using a processor, existence of data redundancies in the first set of data stored at a first location of a non-transitory computer readable medium, wherein

the existence of data redundancies is determined by calculating row differences between successive rows of the first set of data in a database table of a database system to generate a bitmap that is further stored at a second location in the non-transitory computer readable medium, and

a second set of data is obtained by consulting the bitmap corresponding to changes between a first row and a second row of the first set of data;

obtaining, with the processor, the second set of data that is a reduced version of the first set of data, wherein

the second set of data does not include the data redundancies determined in the first set of data; and

transmitting the second set of data to a client through a computer network.

2. The process of claim 1, wherein calculating the row differences between the successive rows in the first set of data is performed by identifying identical column values for the successive rows.

3. The process of claim 1, wherein the bitmap comprises a bit having a value of “

1,”

the bit representing the difference between two data in the first set of data.

4. The process of claim 1, wherein the bitmap comprises a bit having a value of “

0,”

the bit representing a redundancy of data in the first set of data.

5. The process of claim 1, wherein consulting the bitmap is performed by evaluating each bit in the bitmap to determine changes between the first row and the second row.

6. The process of claim 1, wherein the second set of data is associated with a first bit map that corresponds with a first row difference between a first row and a second row of data in the first set of data.

7. The process of claim 6, wherein the second set of data is associated with a second bit map that corresponds with a second row difference between the second row and a third row of data in the first set of data.

8. The process of claim 1, wherein the bitmap is a multidimensional bit map.

9. The process of claim 1, where the first and second rows are not consecutive rows.

10. The process of claim 1, wherein the second set of data comprises a smaller memory footprint than the first set of data.

11. A computer program product that includes a volatile non-transitory computer-usable storage medium usable by a processor, the non-transitory computer-usable storage medium having stored thereon a sequence of instructions which, when executed by said processor, causes the processor to execute a set of acts for increasing the efficiency of data storage, the set of acts comprising:

identifying a first set of data;

determining, using the processor, existence of data redundancies in the first set of data stored at a first location of a non-transitory computer readable medium, wherein

the existence of data redundancies is determined by calculating row differences between successive rows of the first set of data in a database table of a database system to generate a bitmap that is further stored at a second location in the non-transitory computer readable medium, and

a second set of data is obtained by consulting the bitmap corresponding to changes between a first row and a second row of the first set of data;

obtaining, with the processor, the second set of data that is a reduced version of the first set of data, wherein

the second set of data does not include the data redundancies determined in the first set of data; and

transmitting the second set of data to a client through a computer network.

12. The computer program product of claim 11, wherein calculating the row differences between the successive rows in the first set of data is performed by identifying identical column values for the successive rows.

13. The computer program product of claim 11, wherein consulting the bitmap is performed by evaluating each bit in the bitmap to determine changes between the first row and the second row.

14. The computer program product of claim 11, wherein the bitmap is a multidimensional bit map.

15. The computer program product of claim 11, where the first and second rows are not consecutive rows.

16. The computer program product of claim 11, wherein the second set of data comprises a smaller memory footprint than the first set of data.

17. A computer system comprising a server, the computer system configured to increase the efficiency of data storage at the server at least by executing a sequence of instructions to:

identify a first set of data;

determine existence of data redundancies in the first set of data stored at a first location of a non-transitory computer readable medium, wherein

the existence of data redundancies is determined by calculating row differences between successive rows of the first set of data in a database table of a database system to generate a bitmap that is further stored at a second location in the non-transitory computer readable medium, and

a second set of data is obtained by consulting the bitmap corresponding to changes between a first row and a second row of the first set of data;

obtain, with a processor, the second set of data that is a reduced version of the first set of data, wherein

the second set of data does not include the data redundancies determined in the first set of data; and

transmit the second set of data to a client through a computer network.

18. The computer system of claim 17, wherein the computer system that executes the sequence of instructions to calculate the row differences between the successive rows in the first set of data further executes the sequence of instructions to identify identical column values for the successive rows.

19. The computer system of claim 17, wherein the computer system that executes the sequence of instructions to consult the bitmap further executes the sequence of instructions to evaluate each bit in the bitmap to determine changes between the first row and the second row.

20. The computer system of claim 17, wherein the bitmap is a multidimensional bit map.

21. The computer system of claim 17, where the first and second rows are not consecutive rows.

22. The computer system of claim 17, wherein the second set of data comprises a smaller memory footprint than the first set of data.

23. A computer-implemented process for increasing data storage efficiency, comprising:

receiving a second set of data that is a reduced version of a first set of data from a server through a computer network;

storing the second set of data at a first location in a non-transitory computer readable medium, wherein

the second set of data does not include data redundancies comprised in the first set of data,

the data redundancies are determined by calculating row differences between successive rows of the first set of data to generate a bitmap that is further stored at a second location in the non-transitory computer readable medium, and

the second set of data is obtained by consulting the bitmap corresponding to changes between a first row and a second row of the first set of data; and

configuring, using a processor, a plurality of data elements associated with redundant data in the first set of data by pointing the plurality of data elements to a same data item in the second set of data such that the same data item is accessed for the plurality of data elements.

24. The process of claim 23, wherein calculating the row differences between the successive rows in the first set of data is performed by identifying identical column values for the successive rows.

25. The process of claim 23, wherein consulting the bitmap is performed by evaluating each bit in the bitmap to determine changes between the first row and the second row.

26. The process of claim 23, wherein the first and the second rows are not consecutive rows of the database table.

27. The process of claim 23, wherein the second set of data comprises a smaller memory footprint than the first set of data.

28. The process of claim 23, wherein the second set of data is associated with a first bit map that corresponds with a first row difference between a first row and a second row of data in the first set of data.

29. The process of claim 28, wherein the second set of data is associated with a second bit map that corresponds with a second row difference between the second row and a third row of data in the first set of data.

30. A computer program product that includes a non-transitory computer-usable storage medium usable by a processor, the non-transitory computer-usable storage medium having stored thereon a sequence of instructions which, when executed by the processor, causes the processor to execute a set of acts for increasing the efficiency of data storage, the set of acts comprising:

receiving a second set of data that is a reduced version of a first set of data from a server through a computer network;

storing the second set of data at a first location in a non-transitory computer readable medium, wherein

the second set of data does not include data redundancies comprised in the first set of data,

the data redundancies are determined by calculating row differences between successive rows of the first set of data to generate a bitmap that is further stored at a second location in the non-transitory computer readable medium, and

the second set of data is obtained by consulting the bitmap corresponding to changes between a first row and a second row of the first set of data; and

configuring, using the processor, a plurality of data elements associated with redundant data in the first set of data by pointing the plurality of data elements to a same data item in the second set of data such that the same data item is accessed for the plurality of data elements.

31. The product of claim 30, wherein calculating the row differences between the successive rows in the first set of data is performed by identifying identical column values for the successive rows.

32. A computer system comprising:

a processor;

a display device and/or a volatile or non-volatile computer-usable medium, wherein the system is configured to increase the efficiency of data storage at least by executing a sequence of instructions to;

receive a second set of data that is a reduced version of a first set of data from a server through a computer network;

store the second set of data at a first location in a non-transitory computer readable medium, wherein

the second set of data does not include data redundancies comprised in the first set of data,

the data redundancies are determined by calculating row differences between successive rows of the first set of data to generate a bitmap that is further stored at a second location in the non-transitory computer readable medium, and

the second set of data is obtained by consulting the bitmap corresponding to changes between a first row and a second row of the first set of data; and

configure, using the processor, a plurality of data elements associated with redundant data in the first set of data by pointing the plurality of data elements to a same data item in the second set of data such that the same data item is accessed for the plurality of data elements.

33. The system of claim 32 wherein the computer system that executes the sequence of instructions to calculate the row differences between the successive rows in the first set of data further executes the sequence of instructions to identify identical column values for successive row.