summaryrefslogtreecommitdiff
path: root/obnam.md
diff options
context:
space:
mode:
authorAlexander Batischev <eual.jp@gmail.com>2020-10-17 01:20:33 +0300
committerAlexander Batischev <eual.jp@gmail.com>2020-10-17 23:23:06 +0300
commitfe95bbb9c738b8df3c51dcd76f89221cc212f990 (patch)
treea8c15f9bba04757a80cf1438fbbd136407c6e332 /obnam.md
parentf6f41ad2e50dcb487b254655ee1399fde81b9853 (diff)
downloadobnam2-fe95bbb9c738b8df3c51dcd76f89221cc212f990.tar.gz
doc: fix typos
Diffstat (limited to 'obnam.md')
-rw-r--r--obnam.md10
1 files changed, 5 insertions, 5 deletions
diff --git a/obnam.md b/obnam.md
index 0dedde2..55e84a3 100644
--- a/obnam.md
+++ b/obnam.md
@@ -90,8 +90,8 @@ The first milestone for the Obnam2 &ndash; the minimum viable product
&ndash; does not try to fulfil all the requirements for Obnam2.
Instead, the following semi-subset is the goal:
-* _Not done:_ **Can do a backup my own data and restore** This is the
- minimum functionality for a backup program.
+* _Not done:_ **Can do a backup of my own data and restore it:** This
+ is the minimum functionality for a backup program.
* _Not done:_ **Fast backups and restores:** a backup or restore of 10
GiB of live data, between two VMs on my big home server take less
than 200 seconds.
@@ -140,11 +140,11 @@ digraph "arch" {
}
~~~
-The server side is not very smart. I handles storage of chunks and
+The server side is not very smart. It handles storage of chunks and
their metadata only. The client is smarter:
* it scans live data for files to back up
-* it splits those files into chunks, and stores the chunks in the
+* it splits those files into chunks, and stores the chunks on the
server
* it constructs an SQLite database file, with all filenames, file
metadata, and the chunks associated with each live data file
@@ -374,7 +374,7 @@ acceptable speed.
### Can restore 10 GiB in 200 seconds
-This scenario verifies that the system can restored backed up data at
+This scenario verifies that the system can restore backed up data at
an acceptable speed.