@@ -16,7 +16,7 @@ Authors: Sanjay Ghemawat (sanjay@google.com) and Jeff Dean (jeff@google.com)
1616 * External activity (file system operations etc.) is relayed through a virtual interface so users can customize the operating system interactions.
1717
1818# Documentation
19- [ LevelDB library documentation] ( https://rawgit.com/google/leveldb/master/doc/index.html ) is online and bundled with the source code.
19+ [ LevelDB library documentation] ( https://rawgit.com/google/leveldb/master/doc/index.md ) is online and bundled with the source code.
2020
2121
2222# Limitations
@@ -113,29 +113,30 @@ by the one or two disk seeks needed to fetch the data from disk.
113113Write performance will be mostly unaffected by whether or not the
114114working set fits in memory.
115115
116- readrandom : 16.677 micros/op; (approximately 60,000 reads per second)
117- readseq : 0.476 micros/op; 232.3 MB/s
118- readreverse : 0.724 micros/op; 152.9 MB/s
116+ readrandom : 16.677 micros/op; (approximately 60,000 reads per second)
117+ readseq : 0.476 micros/op; 232.3 MB/s
118+ readreverse : 0.724 micros/op; 152.9 MB/s
119119
120120LevelDB compacts its underlying storage data in the background to
121121improve read performance. The results listed above were done
122122immediately after a lot of random writes. The results after
123123compactions (which are usually triggered automatically) are better.
124124
125- readrandom : 11.602 micros/op; (approximately 85,000 reads per second)
126- readseq : 0.423 micros/op; 261.8 MB/s
127- readreverse : 0.663 micros/op; 166.9 MB/s
125+ readrandom : 11.602 micros/op; (approximately 85,000 reads per second)
126+ readseq : 0.423 micros/op; 261.8 MB/s
127+ readreverse : 0.663 micros/op; 166.9 MB/s
128128
129129Some of the high cost of reads comes from repeated decompression of blocks
130130read from disk. If we supply enough cache to the leveldb so it can hold the
131131uncompressed blocks in memory, the read performance improves again:
132132
133- readrandom : 9.775 micros/op; (approximately 100,000 reads per second before compaction)
134- readrandom : 5.215 micros/op; (approximately 190,000 reads per second after compaction)
133+ readrandom : 9.775 micros/op; (approximately 100,000 reads per second before compaction)
134+ readrandom : 5.215 micros/op; (approximately 190,000 reads per second after compaction)
135135
136136## Repository contents
137137
138- See doc/index.html for more explanation. See doc/impl.html for a brief overview of the implementation.
138+ See [ doc/index.md] ( doc/index.md ) for more explanation. See
139+ [ doc/impl.md] ( doc/impl.md ) for a brief overview of the implementation.
139140
140141The public interface is in include/* .h. Callers should not include or
141142rely on the details of any other header files in this package. Those
@@ -148,7 +149,7 @@ Guide to header files:
148149* ** include/options.h** : Control over the behavior of an entire database,
149150and also control over the behavior of individual reads and writes.
150151
151- * ** include/comparator.h** : Abstraction for user-specified comparison function.
152+ * ** include/comparator.h** : Abstraction for user-specified comparison function.
152153If you want just bytewise comparison of keys, you can use the default
153154comparator, but clients can write their own comparator implementations if they
154155want custom ordering (e.g. to handle different character encodings, etc.)
@@ -165,7 +166,7 @@ length into some other byte array.
165166* ** include/status.h** : Status is returned from many of the public interfaces
166167and is used to report success and various kinds of errors.
167168
168- * ** include/env.h** :
169+ * ** include/env.h** :
169170Abstraction of the OS environment. A posix implementation of this interface is
170171in util/env_posix.cc
171172
0 commit comments