Compression of tables based on occurrence of values

Details Compression of tables based on occurrence of values Compression of tables based on occurrence of values

2007-05-21

2011-10-04

Abel-Jalil, Neveen (Department: 2165)

Data processing: database and file management or data structures

Data integrity

Fragmentation, compaction and compression

Reexamination Certificate

active

08032499

ABSTRACT:
Methods and apparatus, including computer program products, for compression of tables based on occurrence of values. In general, a number representing an amount of occurrences of a frequently occurring value in a group of adjacent rows of a column is generated, a vector representing whether the frequently occurring value exists in a row of the column is generated, and the number and the vector are stored to enable searches of the data represented by the number and the vector. The vector may omit a portion representing the group of adjacent rows. The values may be dictionary-based compression values representing business data such as business objects. The compression may be performed in-memory, in parallel, to improve memory utilization, network bandwidth consumption, and processing performance.

REFERENCES:
patent: 5523946 (1996-06-01), Kaplan et al.
patent: 5574906 (1996-11-01), Morris
patent: 5870036 (1999-02-01), Franaszek et al.
patent: 6112208 (2000-08-01), Ikegami
patent: 6529912 (2003-03-01), Satoh et al.
patent: 2003/0135495 (2003-07-01), Vagnozzi
patent: 2004/0034616 (2004-02-01), Witkowski et al.
patent: 2005/0187962 (2005-08-01), Grondin et al.
patent: 2005/1019299 (2005-09-01), Dittrich et al.
patent: 2008/0275847 (2008-11-01), Chellapilla et al.
Stonebraker, Mike et al., “C-Store: A column-oriented DBMS,” VLDB Proc. Int. Conference Large Data Bases: VLDB 2005—Proceedings of 31stInternational Conference on Very Large Data Bases 2005, vol. 2, 2005, pp. 553-564.
Pinar, A et al., “Compressing Bitmap Indices by Data Reorganization,” Data Engineering, 2005. ICDE 2005 Proceedings, 21stInternational Conference on Tokyo, Japan Apr. 5-8, 2005, Piscataway, NJ, IEEE, Apr. 5, 2005 p. 310-321.
Wen-jann Yang et al., “Parallel intersecting compressed bit vectors in a high speed query server for processing postal addresses,” High-Performance Computer Architecture 1996, Proceedings Second International Symposium on San Jose, CA, Feb. 3-7, 1996, Los Alamitos, IEEE Comput. Soc. US Feb. 3, 1996, p. 232-241.
Wu, K et al., “Optimizing bitmap indices with efficient compression,” ACM Transactions on Database Systems ACM, USA, vol. 31, No. 1, Mar. 2006, p. 1-38.
Abadi, Daniel et al., “Integrating compression and execution in column-oriented database systems,” Proc. ACM Sigmod Int. Conf. Manage. Data; Proceedings of the ACM Sigmod International Conference on Management of Data; Sigmod 2006, p. 671-682.
Communication, May 8, 2008, Application No. 080051766-223.
Extended European Search Report (EESR) dated Jun. 8, 2009, issued by the European Patent Office in connection with European patent application No. 08008447.8-1247.
Salomon, David, “Data Compression: The Complete Reference, 3rdEdition”, Springer Verland, New York, USA, 2004 (pp. 168-171).
Ian H. Witten, Alistair Moffat, and Timothy C. Bell,Managing Gigabytes: Compressing and Indexing Documents and Images, San Francisco: Morgan Kaufmann Publishing, 1999.
Navneet Goyal, et al., “Improved Bitmap Indexing Strategy for Data Warehouses”, ICIT '06, 9th International Conference on Information Technology, Dec. 18-21, 2006, Bhubaneswar, India, IEEE, Piscataway, NJ, USA, Dec. 1, 2006, pp. 213-216.
Legler, T., et al., “Data Mining with the SAP Net Weaver BI Accelerator”, VLDB '06, Proceedings of the 32nd International Conference on Very Large Data Bases, Sep. 12, 2006, pp. 1059-1068, Retrieved from the Internet: <URL:http://delivery.acm.org/10.1145/1170000/1164218/p1059- legler.pdf?ip=145.64.134.245&CFID=34433516&CFTOKEN=66219892&—acm—=1312534710—ae5bc043e1e47af00f7acd0989c7fa4e>, retrieved on Aug. 5, 2011.
Examination Report dated Aug. 12, 2011, issued by the European Patent Office in connection with corresponding European Patent Application No. 08005176.6-222e.

Affiliated with

Also associated with

Rating

Compression of tables based on occurrence of values does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Compression of tables based on occurrence of values, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Compression of tables based on occurrence of values will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4280559