Path: utzoo!attcan!uunet!dgis!jkrueger
From: jkrueger@dgis.daitc.mil (Jonathan Krueger)
Newsgroups: comp.databases
Subject: Re: Extended RDB vs OODB
Message-ID: <31@dgis.daitc.mil>
Date: 17 Aug 89 21:05:56 GMT
References: <28@dgis.daitc.mil> <1989Aug17.180057.2623@agate.berkeley.edu>
Organization: DTIC Special Projects Office (DTIC-SPO), Alexandria VA
Lines: 14

hughes@math.berkeley.edu (Eric Hughes) writes:

>"inherently bad performace" would require that one find some predicate
>which is invariant over all possible implementations and show that
>such an invariant has certain undesirable minimum time and/or space
>growth rates.

Example: find all descendents.

-- Jon
-- 
Jonathan Krueger    jkrueger@dgis.daitc.mil   uunet!dgis!jkrueger
Isn't it interesting that the first thing you do with your
color bitmapped window system on a network is emulate an ASR33?