Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!watmath!clyde!caip!im4u!ut-sally!ark
From: ark@ut-sally.UUCP (Arthur M. Keller)
Newsgroups: net.database
Subject: Re: Re: speed of ORACLE, large INFORMIX DBMS's
Message-ID: <5457@ut-sally.UUCP>
Date: Thu, 31-Jul-86 15:34:49 EDT
Article-I.D.: ut-sally.5457
Posted: Thu Jul 31 15:34:49 1986
Date-Received: Sat, 2-Aug-86 02:58:50 EDT
References: <449@oracle.UUCP> <235@hdsvx1.UUCP> <456@oracle.UUCP>
Reply-To: ark@sally.UUCP (Arthur M. Keller)
Organization: U. Texas CS Dept., Austin, Texas
Lines: 17

In article <456@oracle.UUCP> bradbury@oracle.UUCP (Robert Bradbury) writes:
>What I meant by the (nor do any ...) comment was that I suspected no one
>actually encoded the data (7-bit ascii massaged to fill 8 bit bytes for
>example) owing to the problems of scanning and ordering the data.

The problems of indexing, etc., that apply to data compression (such
as Hammond coding) also apply to encryption.  If you are going to
encrypt the data anyway, using data compression techniques before
encryption incurs little cost over encryption alone, saves space, and
may make unwanted decryption by others more difficult.

Arthur

-- 
------------------------------------------------------------------------------
Arpanet: ARK@SALLY.UTEXAS.EDU
UUCP:    {gatech,harvard,ihnp4,pyramid,seismo}!ut-sally!ark