Sears Russell
db1d79efcd
Removed Tinstant* and broken logical hash stuff
2008-09-30 15:34:42 +00:00
Sears Russell
7e2c37534e
Partial implementation of a collection oriented interface for ROSE. (Checking in to create version to diff against.)
2007-11-01 20:09:55 +00:00
Sears Russell
cd5ec5f70c
Initial ROSE check in.
2007-10-15 17:46:44 +00:00
Sears Russell
5bd2138a8b
Fixes a number of memory leaks; adds pageCleanup() callback, and allows callers to use custom allocators with LSM trees
2007-08-20 21:58:20 +00:00
Sears Russell
356387eafe
support "make install", and use libtool to generate .so, .a files.
2007-06-25 15:47:28 +00:00
no author
d0274c3304
Renamed 'lladd' directories and python module to 'stasis'
2007-06-11 21:36:57 +00:00
Sears Russell
a06077d12d
Conditionally compile benchmarks
2006-11-21 06:45:22 +00:00
Sears Russell
b8d0ccce79
Modularized the build; made berkeleydb and confuse optional. No longer build as many things by default.
2006-11-09 23:00:50 +00:00
Sears Russell
0c6c0ec50b
Removed pbl header; fixed makefile bugs and the compilation warnings
...
they obscured.
2006-06-20 22:05:45 +00:00
Sears Russell
6485a4aae9
No more PBL.
2006-06-20 21:44:17 +00:00
Sears Russell
27f7df6f09
Fixed races on flushedLSN and page->dirty.
2006-06-12 20:05:28 +00:00
Sears Russell
11c311bc91
Added support for raw pages, implemented posix_memalign workaround, and re-enabled O_DIRECT by default
2006-04-12 01:41:35 +00:00
Sears Russell
cf58e1fb72
Transitive closure working!
2005-03-24 04:43:22 +00:00
Sears Russell
ef3c30b190
Benchmark updates.
2005-03-20 05:17:25 +00:00
Sears Russell
1bfb634103
Preliminary benchmark program uploads for SEDA-style response time percentiles vs requests / second
...
Also added a few cute little utilities:
- truncate_log
- run_recovery
Upped max # of concurrent transactions. (Current throughput during benchmarking remains ~flat up to 32,000
threads, but past max concurrent transactions was 1,000...)
2005-03-12 22:11:18 +00:00
Sears Russell
18c772234d
new benchmarks revealed that inserts for linkedList, pageOrientedList were taking O(n) time, yielding O(n^2)
...
time to build a list, since the lists could not contain duplicate keys. These operations are now O(1), and
the lists can contain duplicates.
2005-03-10 20:10:49 +00:00
Sears Russell
aead6a5a83
New benchmark, fixed for PROFILE_LATCHES.
2004-10-20 21:55:00 +00:00
Sears Russell
af9e7adee0
Starting work on the actual graph-generation portion of the benchmarks. :)
2004-10-20 06:21:21 +00:00
Sears Russell
ec1276f26f
Preliminary version of logical logging linear hash. (No latching yet, and there are some bugs re-opening a closed hash.)
2004-10-18 18:24:54 +00:00
