building_data_management_systems.Xuanzhou.2024Fall.DaSE
/
leveldb_base
23
0
Forka 2
Codice Problemi 0 Pull Requests 0 Rilasci 0 Wiki Attività
提供基本的ttl测试用例
Non puoi selezionare più di 25 argomenti Gli argomenti devono iniziare con una lettera o un numero, possono includere trattini ('-') e possono essere lunghi fino a 35 caratteri.
113 Commit
2 Rami (Branch)
1.6 MiB
Albero (Tree): 9fcae61641
Rami (Branch) Tag
${ item.name }
Crea branch ${ searchTerm }
da '9fcae61641'
${ noResults }
leveldb_base/TODO

14 righe
535 B
Originale Vista normale Cronologia

Initial checkin. git-svn-id: https://leveldb.googlecode.com/svn/trunk@2 62dab493-f737-651d-591e-8d6aee1b9529
13 anni fa
​
​
​
​
​
​
​
​
Update to leveldb 1.6 Highlights ---------- Mmap at most 1000 files on Posix to improve performance for large databases. Support for more architectures (thanks to Alexander K.) Building and porting -------------------- HP/UX support (issue 126) AtomicPointer for ia64 (issue 123) Sparc v9 support (issue 124) Atomic ops for powerpc Use -fno-builtin-memcmp only when using g++ Simplify IOS build rules (issue 114) Use CXXFLAGS instead of CFLAGS when invoking C++ compiler (issue 118) Fix snappy shared library problem (issue 94) Fix shared library installation path regression Endian-ness detection tweak for FreeBSD Bug fixes --------- Stop ignoring FLAGS_open_files in db_bench Make bloom test behavior agnostic to endian-ness Performance ----------- Limit number of mmapped files to 1000 to improve perf for large dbs Do not delay for 1 second on shutdown path (issue 125) Misc ---- Make InMemoryEnv return a no-op logger C binding now has a wrapper for free (issue 117) Add thread-safety annotations Added an in-process lock table (issue 120) Make RandomAccessFile and SequentialFile non-copyable
12 anni fa
Initial checkin. git-svn-id: https://leveldb.googlecode.com/svn/trunk@2 62dab493-f737-651d-591e-8d6aee1b9529
13 anni fa
A number of smaller fixes and performance improvements: - Implemented Get() directly instead of building on top of a full merging iterator stack. This speeds up the "readrandom" benchmark by up to 15-30%. - Fixed an opensource compilation problem. Added --db=<name> flag to control where the database is placed. - Automatically compact a file when we have done enough overlapping seeks to that file. - Fixed a performance bug where we would read from at least one file in a level even if none of the files overlapped the key being read. - Makefile fix for Mac OSX installations that have XCode 4 without XCode 3. - Unified the two occurrences of binary search in a file-list into one routine. - Found and fixed a bug where we would unnecessarily search the last file when looking for a key larger than all data in the level. - A fix to avoid the need for trivial move compactions and therefore gets rid of two out of five syncs in "fillseq". - Removed the MANIFEST file write when switching to a new memtable/log-file for a 10-20% improvement on fill speed on ext4. - Adding a SNAPPY setting in the Makefile for folks who have Snappy installed. Snappy compresses values and speeds up writes. git-svn-id: https://leveldb.googlecode.com/svn/trunk@32 62dab493-f737-651d-591e-8d6aee1b9529
13 anni fa
​
​
 
  1. ss
  2. - Stats
  3. 

  4. db
  5. - Maybe implement DB::BulkDeleteForRange(start_key, end_key)
  6.   that would blow away files whose ranges are entirely contained
  7.   within [start_key..end_key]?  For Chrome, deletion of obsolete
  8.   object stores, etc. can be done in the background anyway, so
  9.   probably not that important.
  10. - There have been requests for MultiGet.
  11. 

  12. After a range is completely deleted, what gets rid of the
  13. corresponding files if we do no future changes to that range.  Make
  14. the conditions for triggering compactions fire in more situations?