From: | Peter Eisentraut <peter(dot)eisentraut(at)2ndquadrant(dot)com> |
---|---|
To: | Andres Freund <andres(at)anarazel(dot)de>, pgsql-hackers(at)postgresql(dot)org, Haribabu Kommi <kommi(dot)haribabu(at)gmail(dot)com>, Alexander Korotkov <a(dot)korotkov(at)postgrespro(dot)ru>, Robert Haas <robertmhaas(at)gmail(dot)com>, Amit Kapila <amit(dot)kapila16(at)gmail(dot)com> |
Subject: | Re: What to name the current heap after pluggable storage / what to rename? |
Date: | 2018-12-19 08:27:36 |
Message-ID: | 4daa88ea-53d1-cc6e-dda4-3f2da3ff84da@2ndquadrant.com |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers |
On 19/12/2018 05:17, Andres Freund wrote:
> I'm concerned that naming it heap, and the corresponding functions
> fitting with that name, will be confusing. There's a lot of functions
> that have a heap_ prefix (or similar) that aren't really dependent on
> how the storage works, but much more general infrastructure (consider
> e.g. heap_create_with_catalog()).
I'm wondering where the choice of the name "heap" originally came from
and what it refers to. In "The Design of Postgres"[0], it is said that
"All relations will be stored as heaps (as in [ASTR76]) with an optional
collection of secondary indexes." But ASTR76[1] does not mention the
word "heap", so it doesn't appear to refer to any specific method or
algorithm.
The heap is clearly not the tree data structure. Is it meant in the
sense of memory allocation, a place to store a large amount of stuff in
a mostly unorganized way?
[0]: http://db.cs.berkeley.edu/papers/ERL-M85-95.pdf
[1]: http://daslab.seas.harvard.edu/reading-group/papers/astrahan-1976.pdf
--
Peter Eisentraut http://www.2ndQuadrant.com/
PostgreSQL Development, 24x7 Support, Remote DBA, Training & Services
From | Date | Subject | |
---|---|---|---|
Next Message | Pavel Stehule | 2018-12-19 08:38:22 | single user mode -P option is ignored |
Previous Message | Julien Rouhaud | 2018-12-19 07:40:55 | Re: Ordered Partitioned Table Scans |