Skip to content
GitLab
Explore
Sign in
Register
Primary navigation
Search or go to…
Project
P
postgres-lambda-diff
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Container Registry
Model registry
Operate
Environments
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
Jakob Huber
postgres-lambda-diff
Commits
9d6f2632
Commit
9d6f2632
authored
18 years ago
by
Neil Conway
Browse files
Options
Downloads
Patches
Plain Diff
Fix two typos.
parent
092ed294
No related branches found
Branches containing commit
No related tags found
Tags containing commit
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
contrib/tsearch2/README.tsearch2
+2
-2
2 additions, 2 deletions
contrib/tsearch2/README.tsearch2
with
2 additions
and
2 deletions
contrib/tsearch2/README.tsearch2
+
2
−
2
View file @
9d6f2632
...
@@ -149,7 +149,7 @@ Development History
...
@@ -149,7 +149,7 @@ Development History
introduced an interesting data structure suitable for sets -
introduced an interesting data structure suitable for sets -
RD-tree (Russian Doll tree). Further research lead us to the
RD-tree (Russian Doll tree). Further research lead us to the
idea to use GiST for implementing RD-tree, but at that time the
idea to use GiST for implementing RD-tree, but at that time the
GiST code was
i
ntouched for a long time and contained several
GiST code was
u
ntouched for a long time and contained several
bugs. After work on improving GiST for version 7.0.3 of
bugs. After work on improving GiST for version 7.0.3 of
PostgreSQL was done, we were able to implement RD-Tree and use
PostgreSQL was done, we were able to implement RD-Tree and use
it for index access to arrays of integers. This implementation
it for index access to arrays of integers. This implementation
...
@@ -159,7 +159,7 @@ Development History
...
@@ -159,7 +159,7 @@ Development History
by a single bit-signature, a so-called superimposed signature
by a single bit-signature, a so-called superimposed signature
(see "Index Structures for Databases Containing Data Items with
(see "Index Structures for Databases Containing Data Items with
Set-valued Attributes", 1997, Sven Helmer for details). We
Set-valued Attributes", 1997, Sven Helmer for details). We
developed
ed
the contrib/intarray module and used it for full
developed the contrib/intarray module and used it for full
text indexing.
text indexing.
tsearch v1
tsearch v1
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment