![]() ![]() ![]() |
![]() |
|
|
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Return to Internet, Performance, and Systems Management We present compelling experimental evidence of the suitability of FOR compression for many database applications. While there has been some previous and concurrent work on compressing relations, no alternative solution combines the high compression ratios, low over-head, ease of incorporation into an RDBMS, and selective decompression that FOR compression achieves. Overall, we believe that this is a very attractive approach to implementing compression in an RDBMS. DiSC'01 Copyright ©2002 ACM Inc. |