database/postgres
1
0
Fork 0
mirror of https://github.com/postgres/postgres.git synced 2025-07-05 07:21:24 +03:00
Code Activity

Use the term "radix tree" instead of "suffix tree" for SP-GiST text opclass.

Browse Source 
What we have implemented is a radix tree (or a radix trie or a patricia
trie), but the docs and code comments incorrectly called it a "suffix tree".

Alexander Korotkov
This commit is contained in:
Heikki Linnakangas
2013-05-08 14:29:28 +03:00
parent 20c00ca668
commit cb953d8b1b
9 changed files with 201 additions and 201 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
src/backend/access/spgist/spgtextproc.c
View File

@ -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