Re: directory tree query with big planner variation - Mailing list pgsql-performance

From Michael Stone
Subject Re: directory tree query with big planner variation
Date
Msg-id 20060731170833.GH2900@mathom.us
Whole thread Raw
In response to Re: directory tree query with big planner variation  (Axel Rau <Axel.Rau@Chaos1.DE>)
Responses Re: directory tree query with big planner variation
PITR performance overhead?
List pgsql-performance
On Mon, Jul 31, 2006 at 05:54:41PM +0200, Axel Rau wrote:
>The file table is the biggest one, because it contains one row per
>backup job and file (see my column description).

I never saw a column description--that would certainly help. :) I saw a
schema, but not an explanation of what the elements do. From what I can
understand of what you're saying, it is sounding as though the
bacula.file table contains an entry for the subdirectory itself as well
as entries for each file in the subdirectory? And the reason you need to
join back to the filename table is that there may be multiple copies of
the filename from multiple backups? Does the subdirectory itself have an
entry in the filename table? What is the content of the lstat column; can
it be used to distinguish a file from a directory? Similarly for the md5
column--what would it contain for a directory?

Mike Stone

pgsql-performance by date:

Previous
From: Arjen van der Meijden
Date:
Subject: Re: Performances with new Intel Core* processors
Next
From: Axel Rau
Date:
Subject: Re: directory tree query with big planner variation