aboutsummaryrefslogtreecommitdiff
path: root/src/backend/access/spgist/spgtextproc.c
diff options
context:
space:
mode:
Diffstat (limited to 'src/backend/access/spgist/spgtextproc.c')
-rw-r--r--src/backend/access/spgist/spgtextproc.c4
1 files changed, 2 insertions, 2 deletions
diff --git a/src/backend/access/spgist/spgtextproc.c b/src/backend/access/spgist/spgtextproc.c
index 9ffc8705645..8d50dcc6183 100644
--- a/src/backend/access/spgist/spgtextproc.c
+++ b/src/backend/access/spgist/spgtextproc.c
@@ -1,7 +1,7 @@
/*-------------------------------------------------------------------------
*
* spgtextproc.c
- * implementation of compressed-suffix tree over text
+ * implementation of radix tree (compressed trie) over text
*
*
* Portions Copyright (c) 1996-2013, PostgreSQL Global Development Group
@@ -23,7 +23,7 @@
/*
- * In the worst case, a inner tuple in a text suffix tree could have as many
+ * In the worst case, a inner tuple in a text radix tree could have as many
* as 256 nodes (one for each possible byte value). Each node can take 16
* bytes on MAXALIGN=8 machines. The inner tuple must fit on an index page
* of size BLCKSZ. Rather than assuming we know the exact amount of overhead