Read/latency-optimized log-structured merge tree.

sears f2df52319d Rewrote datapage. There is a feature regression: datapages do not try to extend themselves when they encounter a large record, and there is a 1:1 relationship between datapages and regions. A later revision will change the interface with the region allocator in order to address this. This will establish a 1 region -> n datapage relationship. There used to be an n:m mapping. ... git-svn-id: svn+ssh://svn.corp.yahoo.com/yahoo/yrl/labs/pnuts/code/logstore@560 8dad8b1f-cf64-0410-95b6-bcf113ffbcfe		2010-02-11 20:04:42 +00:00
test	Rewrote datapage. There is a feature regression: datapages do not try to extend themselves when they encounter a large record, and there is a 1:1 relationship between datapages and regions. A later revision will change the interface with the region allocator in order to address this. This will establish a 1 region -> n datapage relationship. There used to be an n:m mapping.	2010-02-11 20:04:42 +00:00
adriana-lima.awk	initial import; removed cruft from mert's tarball, tweaked make's clean targets	2010-01-23 02:13:59 +00:00
CMakeLists.txt	backport client code from ydht load generator	2010-02-02 23:50:16 +00:00
cmds.txt	initial import; removed cruft from mert's tarball, tweaked make's clean targets	2010-01-23 02:13:59 +00:00
datapage.cpp	Rewrote datapage. There is a feature regression: datapages do not try to extend themselves when they encounter a large record, and there is a 1:1 relationship between datapages and regions. A later revision will change the interface with the region allocator in order to address this. This will establish a 1 region -> n datapage relationship. There used to be an n:m mapping.	2010-02-11 20:04:42 +00:00
datapage.h	Rewrote datapage. There is a feature regression: datapages do not try to extend themselves when they encounter a large record, and there is a 1:1 relationship between datapages and regions. A later revision will change the interface with the region allocator in order to address this. This will establish a 1 region -> n datapage relationship. There used to be an n:m mapping.	2010-02-11 20:04:42 +00:00
datatuple.h	Reworked memory allocation and network protocol. This gargantuan commit also reduces the default size of C0, and removes quite a bit of redundant logic and error handling.	2010-02-10 21:49:50 +00:00
logiterators.cpp	removed some more redundant code by unifying merge_iterators	2010-01-28 02:20:49 +00:00
logiterators.h	Reworked memory allocation and network protocol. This gargantuan commit also reduces the default size of C0, and removes quite a bit of redundant logic and error handling.	2010-02-10 21:49:50 +00:00
logserver.cpp	Reworked memory allocation and network protocol. This gargantuan commit also reduces the default size of C0, and removes quite a bit of redundant logic and error handling.	2010-02-10 21:49:50 +00:00
logserver.h	Reworked memory allocation and network protocol. This gargantuan commit also reduces the default size of C0, and removes quite a bit of redundant logic and error handling.	2010-02-10 21:49:50 +00:00
logstore.cpp	Rewrote datapage. There is a feature regression: datapages do not try to extend themselves when they encounter a large record, and there is a 1:1 relationship between datapages and regions. A later revision will change the interface with the region allocator in order to address this. This will establish a 1 region -> n datapage relationship. There used to be an n:m mapping.	2010-02-11 20:04:42 +00:00
logstore.h	Rewrote datapage. There is a feature regression: datapages do not try to extend themselves when they encounter a large record, and there is a 1:1 relationship between datapages and regions. A later revision will change the interface with the region allocator in order to address this. This will establish a 1 region -> n datapage relationship. There used to be an n:m mapping.	2010-02-11 20:04:42 +00:00
merger.cpp	Reworked memory allocation and network protocol. This gargantuan commit also reduces the default size of C0, and removes quite a bit of redundant logic and error handling.	2010-02-10 21:49:50 +00:00
merger.h	Reworked memory allocation and network protocol. This gargantuan commit also reduces the default size of C0, and removes quite a bit of redundant logic and error handling.	2010-02-10 21:49:50 +00:00
network.h	Reworked memory allocation and network protocol. This gargantuan commit also reduces the default size of C0, and removes quite a bit of redundant logic and error handling.	2010-02-10 21:49:50 +00:00
NOTES	initial import; removed cruft from mert's tarball, tweaked make's clean targets	2010-01-23 02:13:59 +00:00
server.cpp	Rewrote datapage. There is a feature regression: datapages do not try to extend themselves when they encounter a large record, and there is a 1:1 relationship between datapages and regions. A later revision will change the interface with the region allocator in order to address this. This will establish a 1 region -> n datapage relationship. There used to be an n:m mapping.	2010-02-11 20:04:42 +00:00
tcpclient.cpp	Reworked memory allocation and network protocol. This gargantuan commit also reduces the default size of C0, and removes quite a bit of redundant logic and error handling.	2010-02-10 21:49:50 +00:00
tcpclient.h	Reworked memory allocation and network protocol. This gargantuan commit also reduces the default size of C0, and removes quite a bit of redundant logic and error handling.	2010-02-10 21:49:50 +00:00
tuplemerger.cpp	Reworked memory allocation and network protocol. This gargantuan commit also reduces the default size of C0, and removes quite a bit of redundant logic and error handling.	2010-02-10 21:49:50 +00:00
tuplemerger.h	initial import; removed cruft from mert's tarball, tweaked make's clean targets	2010-01-23 02:13:59 +00:00