Re: directory tree query with big planner variation

Поиск
Список
Период
Сортировка
От Axel Rau
Тема Re: directory tree query with big planner variation
Дата
Msg-id 1D01FFCF-2C45-4D8C-A956-50320BDE5FB7@Chaos1.DE
обсуждение исходный текст
Ответ на Re: directory tree query with big planner variation  (Mark Lewis <mark.lewis@mir3.com>)
Список 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 по дате отправления:

Предыдущее
От: Axel Rau
Дата:
Сообщение: Re: directory tree query with big planner variation
Следующее
От: Arjen van der Meijden
Дата:
Сообщение: Re: Performances with new Intel Core* processors