Skip site navigation (1) Skip section navigation (2)

Re: directory tree query with big planner variation

From: Axel Rau <Axel(dot)Rau(at)Chaos1(dot)DE>
To: Mark Lewis <mark(dot)lewis(at)mir3(dot)com>
Cc: Michael Stone <mstone+postgres(at)mathom(dot)us>, pgsql-performance(at)postgresql(dot)org
Subject: Re: directory tree query with big planner variation
Date: 2006-07-31 16:20:56
Message-ID: 1D01FFCF-2C45-4D8C-A956-50320BDE5FB7@Chaos1.DE (view raw or flat)
Thread:
Lists: 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



In response to

pgsql-performance by date

Next:From: Arjen van der MeijdenDate: 2006-07-31 16:30:27
Subject: Re: Performances with new Intel Core* processors
Previous:From: Axel RauDate: 2006-07-31 16:19:06
Subject: Re: directory tree query with big planner variation

Privacy Policy | About PostgreSQL
Copyright © 1996-2014 The PostgreSQL Global Development Group