greg/stasis-aries-wal
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

shortened references

Browse source
This commit is contained in:
Sears Russell 2005-03-26 07:24:18 +00:00
parent 69245efa89
commit 1617075291
1 changed files with 6 additions and 6 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

12
doc/paper2/LLADD.tex
View file

@ -363,7 +363,7 @@ developed. Some are extremely complex, such as semantic file
systems, where the file system understands the contents of the files systems, where the file system understands the contents of the files
that it contains, and is able to provide services such as rapid that it contains, and is able to provide services such as rapid
search, or file-type specific operations such as thumb nails \cite{reiser,semantic}. Others are simpler, such as search, or file-type specific operations such as thumb nails \cite{reiser,semantic}. Others are simpler, such as
Berkeley~DB~\cite{bdb, berkeleyDB}, which provides transactional Berkeley~DB~\cite{berkeleyDB}, which provides transactional
storage of data in indexed form using a hashtable or tree, or as a queue. storage of data in indexed form using a hashtable or tree, or as a queue.
% bdb's recno interface seems to be a specialized b-tree implementation - Rusty % bdb's recno interface seems to be a specialized b-tree implementation - Rusty
@ -2334,7 +2334,7 @@ initiate nested top actions) where appropriate, and to ensure
compliance with \yad's API. We also hope to re-use the infrastructure compliance with \yad's API. We also hope to re-use the infrastructure
that implements such checks to detect opportunities for that implements such checks to detect opportunities for
optimization. Our benchmarking section shows that our simple default optimization. Our benchmarking section shows that our simple default
hashtable implementation is 3 to 4 times slower then our optimized hashtable implementation is 3 to 4 times slower than our optimized
implementation. Using static checking and high-level automated code implementation. Using static checking and high-level automated code
optimization techniques may allow us to narrow or close this optimization techniques may allow us to narrow or close this
gap, and enhance the performance and reliability of application-specific gap, and enhance the performance and reliability of application-specific
@ -2420,9 +2420,9 @@ benefit from the power of transactions.
\begin{small} \begin{small}
\bibitem[1]{multipleGenericLocking} Agrawal, et al. {\em Concurrency Control Performance Modeling: Alternatives and Implications}. TODS 12(4): (1987) 609-654 \bibitem[1]{multipleGenericLocking} Agrawal, et al. {\em Concurrency Control Performance Modeling: Alternatives and Implications}. TODS 12(4): (1987) 609-654
\bibitem[2]{bdb} Berkeley~DB, {\tt http://www.sleepycat.com/} %\bibitem[2]{bdb} Berkeley~DB, {\tt http://www.sleepycat.com/}
\bibitem[3]{capriccio} R. von Behren, J Condit, F. Zhou, G. Necula, and E. Brewer. {\em Capriccio: Scalable Threads for Internet Services} SOSP 19 (2003). %\bibitem[3]{capriccio} R. von Behren, J Condit, F. Zhou, G. Necula, and E. Brewer. {\em Capriccio: Scalable Threads for Internet Services} SOSP 19 (2003).
\bibitem[4]{oo7} Carey, Michael J., DeWitt, David J., Naughton, Jeffrey F. {\em The OO7 Benchmark.} SIGMOD (1993) \bibitem[4]{oo7} Carey, Michael J., DeWitt, David J., Naughton, Jeffrey F. {\em The OO7 Benchmark.} SIGMOD (1993)
@ -2430,7 +2430,7 @@ benefit from the power of transactions.
\bibitem[5]{mapReduce} Jeffrey Dean and Sanjay Ghemawat. {\em Simplified Data Processing on Large Clusters. } OSDI (2004) \bibitem[5]{mapReduce} Jeffrey Dean and Sanjay Ghemawat. {\em Simplified Data Processing on Large Clusters. } OSDI (2004)
\bibitem[5]{lru2s} Envangelos P. Markatos. {\em On Caching Search Engine Results}. Institute of Computer Science, Foundation for Research \& Technology - Hellas (FORTH) Technical Report 241 (1999) %\bibitem[5]{lru2s} Envangelos P. Markatos. {\em On Caching Search Engine Results}. Institute of Computer Science, Foundation for Research \& Technology - Hellas (FORTH) Technical Report 241 (1999)
\bibitem[6]{soft-updates} Greg Ganger. {\em Soft Updates: A Solution to the Metadata Update Problem in File Systems } ACM Transactions (2000) \bibitem[6]{soft-updates} Greg Ganger. {\em Soft Updates: A Solution to the Metadata Update Problem in File Systems } ACM Transactions (2000)
@ -2448,7 +2448,7 @@ benefit from the power of transactions.
\bibitem[11]{lamb} Lamb, et al., {\em The ObjectStore System.} CACM 34(10) (1991) \bibitem[11]{lamb} Lamb, et al., {\em The ObjectStore System.} CACM 34(10) (1991)
\bibitem[12]{blink} Lehman \& Yao, {\em Efficient Locking for Concurrent Operations in B-trees.} TODS 6(4) (1981) p. 650-670 %\bibitem[12]{blink} Lehman \& Yao, {\em Efficient Locking for Concurrent Operations in B-trees.} TODS 6(4) (1981) p. 650-670
\bibitem[12]{lht} Litwin, W., {\em Linear Hashing: A New Tool for File and Table Addressing}. Proc. 6th VLDB, Montreal, Canada, (Oct. 1980) % p. 212-223 \bibitem[12]{lht} Litwin, W., {\em Linear Hashing: A New Tool for File and Table Addressing}. Proc. 6th VLDB, Montreal, Canada, (Oct. 1980) % p. 212-223