in effect, this turns the filesystem into a "poor-mans" balanced tree.
the rdbms gives you a "rich-mans" balanced tree, but along with the
overhead of the rdbms.
cheers
--e--
On Thu, 21 Sep 2000 15:20:39 +0300, Alessio Bragadini wrote:
> Neil Conway wrote:
>
> > > a BLOB. Conversely, Un
Neil Conway wrote:
> > a BLOB. Conversely, Unix filesystems store directories as unsorted
> > lists, which are a lot slower to search than the database's
> > structured indexes.
> Wow, can anyone confirm this (with Postgres preferrably)? In talking
> with some developers at my old job, they all
On Wed, Sep 20, 2000 at 03:45:39PM -0700, Tim Kientzle wrote:
> Steven Lacroix asks:
> > ... what kind of performance hits do BLOBS have on a database ...
> > Note that it would be for web database project.
>
> I haven't tried this with PostgreSQL, but I ran some experiments
> to compare the spee
Steven Lacroix asks:
> ... what kind of performance hits do BLOBS have on a database ...
> Note that it would be for web database project.
I haven't tried this with PostgreSQL, but I ran some experiments
to compare the speed of access for large numbers of BLOBs stored
in a single MySQL table and
