summaryrefslogtreecommitdiff
path: root/src/backend/utils/misc/guc-file.l
diff options
context:
space:
mode:
authorHeikki Linnakangas <heikki.linnakangas@iki.fi>2014-11-24 13:41:47 +0200
committerHeikki Linnakangas <heikki.linnakangas@iki.fi>2014-11-24 13:43:33 +0200
commit49b86fb1c97878ea2e3a8118df072c95f60077ac (patch)
treea6697c0b8b2ee5a4399fd3c2e54c9bdc9a3e92e8 /src/backend/utils/misc/guc-file.l
parent0bd624d63b056205fda17a2d694d91db16468e3f (diff)
downloadpostgresql-49b86fb1c97878ea2e3a8118df072c95f60077ac.tar.gz
Add a few paragraphs to B-tree README explaining L&Y algorithm.
This gives an overview of what Lehman & Yao's paper is all about, so that you can understand the rest of the README without having to read the paper. Per discussion with Peter Geoghegan and others.
Diffstat (limited to 'src/backend/utils/misc/guc-file.l')
0 files changed, 0 insertions, 0 deletions