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

From Axel Rau
Subject Re: directory tree query with big planner variation
Date
Msg-id 1D01FFCF-2C45-4D8C-A956-50320BDE5FB7@Chaos1.DE
Whole thread Raw
In response to Re: directory tree query with big planner variation  (Mark Lewis <mark.lewis@mir3.com>)
List pgsql-performance
Am 31.07.2006 um 15:53 schrieb Mark Lewis:

> It seems like you might be able to avoid the expensive directory
> lookups
> entirely without changing the schema by defining an immutable function
> dir_depth(path), which would just count the number of forward slashes.
> Then create a functional index on dir_depth(path) and in the query
> do a
> check for directories with a given prefix and the expected dir_depth.
Still I must check for flatfiles in those subdirectories...
See my clarification here
    http://archives.postgresql.org/pgsql-performance/2006-07/msg00311.php

Axel
Axel Rau, ☀Frankfurt , Germany                       +49-69-951418-0



pgsql-performance by date:

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