Skip site navigation (1)
Skip section navigation (2)
Peripheral Links
Header And Logo
|
Site Navigation
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: Mon, 31 Jul 2006 18:20:56 +0200
Am 31.07.2006 um 15:53 schrieb Mark Lewis:
It seems like you might be able to avoid the expensive directory lookupsentirely 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 acheck 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
- References:
- directory tree query with big planner variation
- From: Axel Rau
- Re: directory tree query with big planner variation
- From: Michael Stone
- Re: directory tree query with big planner variation
- From: Axel Rau
- Re: directory tree query with big planner variation
- From: Michael Stone
- Re: directory tree query with big planner variation
- From: Mark Lewis
- directory tree query with big planner variation
- Prev by Date: Re: directory tree query with big planner variation
- Next by Date: Re: Performances with new Intel Core* processors
- Previous by thread: Re: directory tree query with big planner variation
- Next by thread: Re: directory tree query with big planner variation
- Indexes: