| From: | Jeff Davis <pgsql(at)j-davis(dot)com> |
|---|---|
| To: | Andrew Borodin <amborodin(at)acm(dot)org> |
| Cc: | PostgreSQL-development <pgsql-hackers(at)postgresql(dot)org>, Vladimir Borodin <root(at)simply(dot)name> |
| Subject: | Re: Review: GIN non-intrusive vacuum of posting tree |
| Date: | 2017-01-24 17:29:37 |
| Message-ID: | CAMp0ubfHk1PUxJWG64NqArii3jyB9cs9NC-m2nxJaFP05-w3Ew@mail.gmail.com |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
On Tue, Jan 24, 2017 at 3:18 AM, Andrew Borodin <borodin(at)octonica(dot)com> wrote:
> Technically, approach of locking a subtree is not novel. Lehman and
> Yao focused on "that any process for manipulating the tree uses only a
> small (constant) number of locks at any time." We are locking unknown
> and possibly large amount of pages.
By the way, can you show me where the Lehman and Yao paper addresses
page recycling?
It says that one approach is to allow fewer than K entries on a leaf
node; presumably as few as zero. But it doesn't seem to show how to
remove all references to the page and recycle it in a new place in the
tree.
Regards,
Jeff Davis
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Tobias Oberstein | 2017-01-24 17:37:14 | Re: lseek/read/write overhead becomes visible at scale .. |
| Previous Message | Tom Lane | 2017-01-24 17:27:36 | Re: Performance improvement for joins where outer side is unique |