Skip to content
项目
群组
代码片段
帮助
正在加载...
帮助
为 GitLab 提交贡献
登录/注册
切换导航
H
h2database
项目
项目
详情
活动
周期分析
仓库
仓库
文件
提交
分支
标签
贡献者
分枝图
比较
统计图
议题
0
议题
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
CI / CD
CI / CD
流水线
作业
计划
统计图
Wiki
Wiki
代码片段
代码片段
成员
成员
折叠边栏
关闭边栏
活动
分枝图
统计图
创建新议题
作业
提交
议题看板
打开侧边栏
Administrator
h2database
Commits
5064fb56
提交
5064fb56
authored
1月 23, 2015
作者:
Thomas Mueller
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Documentation.
上级
1e776e6b
显示空白字符变更
内嵌
并排
正在显示
2 个修改的文件
包含
15 行增加
和
12 行删除
+15
-12
changelog.html
h2/src/docsrc/html/changelog.html
+10
-1
MVStore.java
h2/src/main/org/h2/mvstore/MVStore.java
+5
-11
没有找到文件。
h2/src/docsrc/html/changelog.html
浏览文件 @
5064fb56
...
...
@@ -17,7 +17,16 @@ Change Log
<h1>
Change Log
</h1>
<h2>
Next Version (unreleased)
</h2>
<ul><li>
In version 1.4.184, a bug was introduced that broke queries
<ul><li>
The default limit for in-place LOB objects was changed from 128 to 256 bytes.
This is because each read creates a reference to a LOB, and maintaining the references
is a big overhead. With the higher limit, less references are needed.
</li><li>
Tables without columns didn't work.
(The use case for such tables is testing.)
</li><li>
The LIRS cache now resizes the table automatically in all cases
and no longer needs the averageMemory configuration.
</li><li>
Creating a linked table from an MVStore database to a non-MVStore database
created a second (non-MVStore) database file.
</li><li>
In version 1.4.184, a bug was introduced that broke queries
that have both joins and wildcards, for example:
select * from dual join(select x from dual) on 1=1
</li></ul>
...
...
h2/src/main/org/h2/mvstore/MVStore.java
浏览文件 @
5064fb56
...
...
@@ -53,15 +53,14 @@ MVStore:
- test and possibly improve compact operation (for large dbs)
- is data kept in the stream store if the transaction is not committed?
- automated 'kill process' and 'power failure' test
- compact: avoid processing pages using a counting bloom filter
- defragment (re-creating maps, specially those with small pages)
- store number of write operations per page (maybe defragment
if much different than count)
- r-tree: nearest neighbor search
- use a small object value cache (StringCache), test on Android
for default serialization
- MVStoreTool.dump
: dump values (using a callback)
- close the file on out of memory or disk write error (out of disk space or so)
- MVStoreTool.dump
should dump the data if possible;
possibly using a callback for serialization
- implement a sharded map (in one store, multiple stores)
to support concurrent updates and writes, and very large maps
- to save space when persisting very small transactions,
...
...
@@ -72,8 +71,6 @@ MVStore:
- remove features that are not really needed; simplify the code
possibly using a separate layer or tools
(retainVersion?)
- MVStoreTool.dump should dump the data if possible;
possibly using a callback for serialization
- optional pluggable checksum mechanism (per page), which
requires that everything is a page (including headers)
- rename "store" to "save", as "store" is used in "storeVersion"
...
...
@@ -98,7 +95,6 @@ MVStore:
- write a LSM-tree (log structured merge tree) utility on top of the MVStore
with blind writes and/or a bloom filter that
internally uses regular maps and merge sort
- LIRS cache: maybe remove 'mask' field, and dynamically grow the arrays
- chunk metadata: maybe split into static and variable,
or use a small page size for metadata
- data type "string": maybe use prefix compression for keys
...
...
@@ -122,7 +118,6 @@ MVStore:
- rollback of removeMap should restore the data -
which has big consequences, as the metadata map
would probably need references to the root nodes of all maps
- combine MVMap and MVMapConcurrent
*/
...
...
@@ -322,14 +317,13 @@ public class MVStore {
int
mb
=
o
==
null
?
16
:
(
Integer
)
o
;
if
(
mb
>
0
)
{
int
maxMemoryBytes
=
mb
*
1024
*
1024
;
int
averageMemory
=
Math
.
max
(
10
,
pageSplitSize
/
2
);
int
segmentCount
=
16
;
int
stackMoveDistance
=
maxMemoryBytes
/
averageMemory
*
2
/
100
;
int
stackMoveDistance
=
8
;
cache
=
new
CacheLongKeyLIRS
<
Page
>(
maxMemoryBytes
,
averageMemory
,
maxMemoryBytes
,
segmentCount
,
stackMoveDistance
);
cacheChunkRef
=
new
CacheLongKeyLIRS
<
PageChildren
>(
maxMemoryBytes
/
4
,
20
,
maxMemoryBytes
/
4
,
segmentCount
,
stackMoveDistance
);
}
o
=
config
.
get
(
"autoCommitBufferSize"
);
...
...
编写
预览
Markdown
格式
0%
重试
或
添加新文件
添加附件
取消
您添加了
0
人
到此讨论。请谨慎行事。
请先完成此评论的编辑!
取消
请
注册
或者
登录
后发表评论