Data compression and encryption system and method representing records as differences between sorted domain ordinals that represent field values
作者： Chinya Venkataram Ravishankar , Wee-Keong Ng
DOI:
关键词:
摘要: Records in the relational database are converted into ordinal numbers. The numbers then sorted by a predetermined ordering rule. Next, for each record, difference between number and preceding is computed this used to represent that record. Alternatively, some other record's within same block compression technique results highly compressed data can still be handled conventional software record insertion, deletion standard operations.
lens.org 参考文章(13)
Herman P. Miller, Narrow band transmission system and method ,(1976)
Glenn T. Davis, Method and system for storing and retrieving compressed data ,(1988)
Georges Bonnerot, Transmission system using differential pulse code modulation ,(1979)
Glen G. Langdon, Ahmad Zandi, Balakrishna R. Iyer, Sort order preserving method for data storage compression ,(1992)
Iii John T Maxwell, Ronald M Kaplan, Text compression technique using frequency ordered array of word number mappers ,(1993)
Amnon Waisman, Andrew M. Weiss, B-tree structured data base using sparse array bit maps to store inverted lists ,(1983)
Jacob Ziv, Martin Cohn, Abraham Lempel, Willard L. Eastman, Apparatus and method for compressing data signals and restoring the compressed data signals ,(1981)
Hosagrahar Visvesvaraya Jagadish, Rakesh Agrawal, A method for computing transitive closure ,(1988)
Marc A. Potter, Basil E. Potter, Encoding method for compressing a tabular database by selecting effective compression routines for each field and structure of partitions of equal sized records ,(1994)
John P. Lazarus, David Wilhite, Craig A. Friske, Balakrishna R. Iyer, Chung-Chia Chang, Gregory L. Davoll, Kenneth E. Plambeck, Mohamed H. El-Ruby, Method and system for adaptively building a static Ziv-Lempel dictionary for database compression ,(1994)