Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
Greenplum
Gpdb
提交
1c7347f8
G
Gpdb
项目概览
Greenplum
/
Gpdb
通知
7
Star
1
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
DevOps
流水线
流水线任务
计划
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
G
Gpdb
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
DevOps
DevOps
流水线
流水线任务
计划
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
流水线任务
提交
Issue看板
体验新版 GitCode,发现更多精彩内容 >>
提交
1c7347f8
编写于
12月 16, 2005
作者:
N
Neil Conway
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Fix some typos in the TODO list.
上级
fb3dbdf9
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
11 addition
and
11 deletion
+11
-11
doc/TODO
doc/TODO
+11
-11
未找到文件。
doc/TODO
浏览文件 @
1c7347f8
...
...
@@ -135,7 +135,7 @@ Administration
pg_stop_backup() is called or the server is stopped
Doing this will allow administrators to know more easily when
the archive contins all the files needed for point-in-time
the archive cont
a
ins all the files needed for point-in-time
recovery.
o %Create dump tool for write-ahead logs for use in determining
...
...
@@ -185,7 +185,7 @@ Data Types
* Fix data types where equality comparison isn't intuitive, e.g. box
* %Prevent INET cast to CIDR if the unmasked bits are not zero, or
zero the bits
* %Prevent INET cast to CIDR from droping netmask, SELECT '1.1.1.1'::inet::cidr
* %Prevent INET cast to CIDR from drop
p
ing netmask, SELECT '1.1.1.1'::inet::cidr
* Allow INET + INT4 to increment the host part of the address, or
throw an error on overflow
* %Add 'tid != tid ' operator for use in corruption recovery
...
...
@@ -457,7 +457,7 @@ SQL Commands
This might require some background daemon to maintain clustering
during periods of low usage. It might also require tables to be only
par
it
ally filled for easier reorganization. Another idea would
par
ti
ally filled for easier reorganization. Another idea would
be to create a merged heap/index data file so an index lookup would
automatically access the heap data too. A third idea would be to
store heap rows in hashed groups, perhaps using a user-supplied
...
...
@@ -592,7 +592,7 @@ Clients
Currently, while \e saves a single statement as one entry, interactive
statements are saved one line at a time. Ideally all statements
w
h
ould be saved like \e does.
would be saved like \e does.
o Allow multi-line column values to align in the proper columns
...
...
@@ -664,10 +664,10 @@ libpq
o Allow statement results to be automatically batched to the client
Currently, all statement results are transfered to the libpq
Currently, all statement results are transfer
r
ed to the libpq
client before libpq makes the results available to the
application. This feature would allow the application to make
use of the first result rows while the rest are transfered, or
use of the first result rows while the rest are transfer
r
ed, or
held on the server waiting for them to be requested by libpq.
One complexity is that a statement like SELECT 1/col could error
out mid-way through the result set.
...
...
@@ -743,7 +743,7 @@ Exotic Features
* Add the features of packages
o Make private objects access
a
ble only to objects in the same schema
o Make private objects access
i
ble only to objects in the same schema
o Allow current_schema.objname to access current schema objects
o Add session variables
o Allow nested schemas
...
...
@@ -854,7 +854,7 @@ Cache Usage
* Add estimated_count(*) to return an estimate of COUNT(*)
This would use the planner ANALYZE statist
at
ics to return an estimated
This would use the planner ANALYZE statistics to return an estimated
count.
* Allow data to be pulled directly from indexes
...
...
@@ -880,7 +880,7 @@ Cache Usage
o Query results
* Allow sequential scans to take advantage of other concurrent
sequenti
q
al scans, also called "Synchronised Scanning"
sequential scans, also called "Synchronised Scanning"
One possible implementation is to start sequential scans from the lowest
numbered buffer in the shared cache, and when reaching the end wrap
...
...
@@ -893,7 +893,7 @@ Vacuum
* Improve speed with indexes
For large table adjust
e
ments during VACUUM FULL, it is faster to
For large table adjustments during VACUUM FULL, it is faster to
reindex rather than update the index.
* Reduce lock time during VACUUM FULL by moving tuples with read lock,
...
...
@@ -942,7 +942,7 @@ Startup Time Improvements
This would prevent the overhead associated with process creation. Most
operating systems have trivial process creation time compared to
database startup overhead, but a few operating systems (W
I
n32,
database startup overhead, but a few operating systems (W
i
n32,
Solaris) might benefit from threading. Also explore the idea of
a single session using multiple threads to execute a statement faster.
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录