Indexing - comparison of tree structures

From: Sascha Kuhl <yogidabanli(at)gmail(dot)com>
To: pgsql-hackers(at)postgresql(dot)org
Subject: Indexing - comparison of tree structures
Date: 2019-05-24 02:31:20
Message-ID: CAPvVvKAYfTXDgYzNSHxoMEBTyxLMFEem_Dn7m5qAgqVZ7knBUA@mail.gmail.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

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 Content-Type Size
Just another bit faster.pdf application/pdf 95.3 KB

Responses

Browse pgsql-hackers by date

  From Date Subject
Next Message David Rowley 2019-05-24 02:47:56 Re: Top-N sorts in EXPLAIN, row count estimates, and parallelism
Previous Message Ajin Cherian 2019-05-24 02:30:19 Re: Zedstore - compressed in-core columnar storage