Electrical computers and digital processing systems: memory – Storage accessing and control – Memory configuring
Reexamination Certificate
2006-05-11
2008-11-11
Peugh, Brian R (Department: 2187)
Electrical computers and digital processing systems: memory
Storage accessing and control
Memory configuring
C711S154000
Reexamination Certificate
active
07451290
ABSTRACT:
A method and mechanism is disclosed for implementing storage and compression in a computer system. Each granular portion of a file can be individually stored in either a compressed storage unit or an uncompressed storage unit. The storage units can be allocated apriori or on an as-needed basis.
REFERENCES:
patent: 4862167 (1989-08-01), Copeland, III
patent: 5237460 (1993-08-01), Miller et al.
patent: 5357431 (1994-10-01), Nakada et al.
patent: 5414834 (1995-05-01), Alexander et al.
patent: 5426426 (1995-06-01), Hymel
patent: 5627995 (1997-05-01), Miller et al.
patent: 5787415 (1998-07-01), Jacobson et al.
patent: 5918225 (1999-06-01), White et al.
patent: 5936560 (1999-08-01), Higuchi
patent: 6006232 (1999-12-01), Lyons
patent: 6112209 (2000-08-01), Gusack
patent: 6199070 (2001-03-01), Polo-Wood et al.
patent: 6205453 (2001-03-01), Tucker et al.
patent: 6208273 (2001-03-01), Dye et al.
patent: 6360300 (2002-03-01), Corcoran et al.
patent: 6374266 (2002-04-01), Shnelvar
patent: 6427145 (2002-07-01), Hara et al.
patent: 6721751 (2004-04-01), Furusho
patent: 6760907 (2004-07-01), Shaylor
patent: 6823329 (2004-11-01), Kirk et al.
patent: 7058783 (2006-06-01), Chandrasekaran et al.
patent: 7071999 (2006-07-01), Lee
patent: 7103608 (2006-09-01), Ozbutun et al.
patent: 2002/0073298 (2002-06-01), Geiger et al.
patent: 2002/0107988 (2002-08-01), Jordan
patent: 2003/0009595 (2003-01-01), Collins
patent: 2003/0023536 (2003-01-01), Hollerman et al.
patent: 2003/0028509 (2003-02-01), Sah et al.
patent: 2003/0065662 (2003-04-01), Cosic
patent: 2003/0212694 (2003-11-01), Potapov et al.
patent: 2004/0003196 (2004-01-01), Wilson et al.
patent: 2004/0034616 (2004-02-01), Witkowski et al.
patent: 2004/0162954 (2004-08-01), Chauvel
patent: 2005/0268068 (2005-12-01), Ignatius et al.
patent: 0079465 (1983-05-01), None
Bassiouni, M.A. “Data Compression in Scientific and Statistical Databases” IEEE Transactions on Software Engineering, Oct. 1985, vol. SE-11, No. 10, pp. 1047-1058.
Bayer, R. et al. “Organization and Maintenance of Large Ordered Indexes” Acta Informatica, 1972, vol. 1, pp. 173-189.
Beckmann, N. et al. “The R*-tree: An Efficient and Robust Access Method for Points and Rectangles+” Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD '92), San Diego, CA, Jun. 2-5, 1992, pp. 322-331.
Benveniste, C.D. et al. Cache-Memory Interfaces in Compressed Memory Systems, IEEE Transactions on Computer, Nov. 2001, vol. 50, No. 11, pp. 1106-1116.
Berchtold, S. et al. “The X-tree: An Index Structure for High-Dimensional Data” Proceedings of the 22nd International Conference on Very Large Databases (VLDB '96), Bombay, India, Sep. 3-6, 1996, pp. 28-39.
Chen, W.T. et al. “Counter for Full Table Scan Control in Data Redistribution” IBM Technical Disclosure Bulletin, Sep. 1, 1992, vol. 35, No. 4B, pp. 3-4.
Chen, Z. et al. “An Algebraic Compression Framework for Query Results” Proceedings of the 16th International Conference on Data Engineering (ICDE '00), San Diego, CA, Feb. 29-Mar. 3, 2000, pp. 177-188.
Cockshott, W.P. et al. “Data Compression in Database Systems” Proceedings of the 9th International Workshop on Database and Expert Systems Applications, Vienna, Austria, Aug. 26-28, 1998, pp. 981-990.
comp.compression Frequently Asked Questions (part 1/3), last modified Sep. 5, 1999, pp. 1-65, located at: http://www.faqs.org/faqs/compression-faq/part1/.
comp.compression Frequently Asked Questions (part 2/3), last modified Sep. 5, 1999, pp. 1-37, located at: http://www.faqs.org/faqs/compression-faq/part2/.
comp.compression Frequently Asked Questions (part 3/3), last modified Sep. 5, 1999, pp. 1-13, located at: http://www.faqs.org/faqs/compression-faq/part3/.
Couchman, J.S. “Oracle Certified Professional DBA Certification Exam Guide” 1998, Title page, copyright page, table of contents and pp. 54, 59, 69, 109-111, 125-131,133,185, 233, 271, 416, 460 and 503-512 provided, Osborne McGraw-Hill, Berkeley, CA.
deCastro, R.S. et al. “Adaptive Compressed Caching: Design and Implementation” Proceedings of the 15th Symposium on Computer Architecture and High Performance Computing (SBAC-PAD '03), Nov. 10-12, 2003, pp. 10-18.
Eggers, S.J. et al. “A Compression Technique for Large Statistical Databases” Proceedings of the 7th International Conference on Very Large Databases (VLDB '81), Cannes, France, Sep. 9-11, 1981, pp. 424-434.
Goldstein, J. et al. “Compressing Relations and Indexes” Technical Report No. 1355, CS Department, University of Wisconsin-Madison, Jun 18, 1997, pp. 1-23.
Goldstein, J. et al. “Compression Relations and Indexes” Proceedings of the 14th International Conference on Data Engineering (ICDE '98), Orlando, FL, Feb. 23-27, 1998, pp. 370-379.
Graefe, G. et al. “Data Compression and Database Performance” Proceedings of the 1991 Symposium on Applied Computing, Kansas City, MO, Apr. 3-5, 1991, pp. 22-27.
Guttman, A. “R-Trees: A Dynamic Index Structure of Spatial Searching” Proceedings of the ACM SIGMOND International Conference on Data Management (SIGMOD '84), Boston Massachusetts, Jun. 18-21, 1984, pp. 47-57.
Leutenegger, S.T. et al. “STR: A Simple and Efficient Algorithm for R-Tree Packing” Technical Report No. 96-02, Mathematics and Computer Science Department, University of Denver, 1996, pp. 1-29.
Lin, K.-I. et al. “The TV-Tree: An Index Structure for High-Dimensional Data” VLDB Journal, 1994, vol. 3, No. 4, pp. 517-542.
Ng, W.K. et al. “Relational Database Compression Using Augmented Vector Quantization” IEEE 11th International Conference on Data Engineering (ICDE '95), Taipei, Taiwan, Mar. 6-10, 1995, pp. 540-549.
Nievergelt, J. et al. “The Grid File: An Adaptable, Symmetric Multikey File Structure” Readings in Database Systems, 1988, Title page, copyright page and pp. 582-598, Morgan Kaufmann Publishers, Inc., San Mateo, CA.
Olken, F. et al. “Rearranging Data to Maximize the Efficiency of Compression” Journal of Computer and System Sciences, Apr. 1989, vol. 38, No. 2, pp. 405-430.
O'Neil, P. et al. “Improved Query Performance with Variant Indexes” Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOND '97), Tucson, AZ, May 13-15, 1997, pp. 38-49.
Roth, M.A. et al. “Database Compression” SIGMOD Record, Sep. 1993, vol. 22, No. 3, pp. 31-39.
Seeger, B. et al. “The Buddy-Tree: An Efficient and Robust Access Method for Spatial Data Base Systems” Proceedings of the 16th International Conference on Very Large Databases (VLDB '90) Brisbane, Queensland, Australia, Aug. 13-16, 1990, pp. 590-601.
Segev, A. et al. “Supporting Statistics in Extensible Databases: A Case Study” Proceedings of the 7th International Working Conference on Scientific and Statistical Database Management, Charlottesville, VA, Sep. 28-30, 1994, pp. 54-63.
Shannon, C.E. “A Mathematical Theory of Communication” The Bell System Technical Journal, Jul., Oct. 1948, vol. 27, pp. 379-423, 623-656, reprinted pp. 1-55.
Westmann, T. et al. “The Implementation and Performance of Compressed Databases” Reihe Informatik, Mar. 1998, 14 pgs.
Ziv, J. et al. “A Universal Algorithm for Sequential Data Compression” IEEE Transactions on Information Theory, May 1977, vol. IT-23, No. 3, pp. 337-343.
Chandrasekaran Sashikanth
Pruscino Angelo
Oracle International Corporation
Peugh Brian R
Vista IP Law Group LLP
LandOfFree
Method and mechanism for on-line data compression and... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method and mechanism for on-line data compression and..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and mechanism for on-line data compression and... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4038973