Lines Matching refs:a

1 **LevelDB is a fast key-value storage library written at Google that provides an ordered mapping fr…
10   * Callers can provide a custom comparison function to override the sort order.
13   * Users can create a transient snapshot to get a consistent view of data.
16 …* External activity (file system operations etc.) is relayed through a virtual interface so users …
23 …* This is not a SQL database.  It does not have a relational data model, it does not support SQL q…
24   * Only a single process (possibly multi-threaded) can access a particular database at a time.
29 a reliable and fast key/value store. Changes that are in line with the
36    compiled, and tested on a POSIX platform - usually Linux. Very small
40 2. **Stable API**. We strive very hard to maintain a stable API. Changes that
44 3. **Tests**: All changes must be accompanied by a new (or changed) test, or
45    a sufficient explanation as to why a new (or changed) test is not required.
47 ## Submitting a Pull Request
48 Before any pull request will be accepted the author must first sign a
53 your changes down to a single commit and [rebase](https://git-scm.com/docs/git-rebase)
60 Here is a performance report (with explanations) from the run of the
62 be enough to get a ballpark performance estimate.
66 We use a database with a million entries.  Each entry has a 16 byte
67 key, and a 100 byte value.  Values used by the benchmark compress to
82 The "fill" benchmarks create a brand new database, in either
86 cache for a while.  The "overwrite" benchmark does random writes that
94 Each "op" above corresponds to a write of a single key/value pair.
95 I.e., a random write benchmark goes at approximately 400,000 writes per second.
98 than a disk seek (typically 10 milliseconds).  We suspect that this is
102 power to save its memory in the event of a power failure.
107 and reverse direction, and also the performance of a random lookup.
110 working set fits in memory.  The cost of reading a piece of data that
122 immediately after a lot of random writes.  The results after
139 [doc/impl.md](doc/impl.md) for a brief overview of the implementation.
158 an iterator from a DB object.
161 updates to a database.
163 * **include/slice.h**: A simple module for maintaining a pointer and a