Postgres Pro
Downloads
Home   >   mailing lists

Indexing - comparison of tree structures - Mailing list pgsql-hackers

From Sascha Kuhl
Subject Indexing - comparison of tree structures
Date
Msg-id CAPvVvKAYfTXDgYzNSHxoMEBTyxLMFEem_Dn7m5qAgqVZ7knBUA@mail.gmail.com
Whole thread Raw
Responses Re: Indexing - comparison of tree structures  ("Jonah H. Harris" <jonah.harris@gmail.com>)
List pgsql-hackers
Tree view
Hi,

I compared two data structures realistically by time, after estimating big O. T-tree outperforms b-tree, which is commonly used, for a medium size table. Lehmann and Carey showed the same, earlier.

Can you improve indexing by this?

Understandably

Sascha Kuhl
Attachment

pgsql-hackers by date:

Previous
From: Ajin Cherian
Date:
Subject: Re: Zedstore - compressed in-core columnar storage
Next
From: David Rowley
Date:
Subject: Re: Top-N sorts in EXPLAIN, row count estimates, and parallelism