Add 'Conclusion', remove unused references

Author: Gerold103

compaction_implementation.pdf

@@ -2,58 +2,58 @@
 \@writefile{toc}{\contentsline {section}{\numberline {1}Introduction}{1}}
 \@writefile{toc}{\contentsline {section}{\numberline {2}Background and motivation}{1}}
 \citation{kai:slimdb}
-\@writefile{lof}{\contentsline {figure}{\numberline {1}{\ignorespaces LSM-tree ranges dump and compaction}}{2}}
+\@writefile{lof}{\contentsline {figure}{\numberline {1}{\ignorespaces LSM tree ranges dump and compaction}}{2}}
 \newlabel{fig:compaction_schema}{{1}{2}}
 \@writefile{toc}{\contentsline {subsection}{\numberline {2.1}Compaction}{2}}
-\@writefile{toc}{\contentsline {subsection}{\numberline {2.2}LSM-tree based table structure}{2}}
-\@writefile{lof}{\contentsline {figure}{\numberline {2}{\ignorespaces LSM-tree based table inconsistency example}}{2}}
-\newlabel{fig:inconsistent_example}{{2}{2}}
-\@writefile{toc}{\contentsline {subsection}{\numberline {2.3}Multiple indexes update problem}{2}}
+\@writefile{toc}{\contentsline {subsection}{\numberline {2.2}LSM tree-based table structure}{2}}
+\@writefile{toc}{\contentsline {subsection}{\numberline {2.3}Multiple index update problem}{2}}
 \@writefile{toc}{\contentsline {section}{\numberline {3}Design and implementation}{2}}
+\@writefile{lof}{\contentsline {figure}{\numberline {2}{\ignorespaces LSM tree-based table inconsistency example}}{3}}
+\newlabel{fig:inconsistent_example}{{2}{3}}
 \@writefile{toc}{\contentsline {subsection}{\numberline {3.1}Deferred update}{3}}
-\@writefile{lof}{\contentsline {figure}{\numberline {3}{\ignorespaces LSM-tree based table if update is deferred}}{3}}
+\@writefile{lof}{\contentsline {figure}{\numberline {3}{\ignorespaces Deferred update of LSM tree-based table}}{3}}
 \newlabel{fig:table_after_deferred_update}{{3}{3}}
 \@writefile{toc}{\contentsline {subsection}{\numberline {3.2}Compaction}{3}}
 \@writefile{toc}{\contentsline {subsubsection}{\numberline {3.2.1}Primary index}{3}}
-\citation{Kirsch:bloom_less_hashing}
-\citation{Putze:bloom_cache_oblivious}
+\@writefile{toc}{\contentsline {subsubsection}{\numberline {3.2.2}Secondary index}{4}}
 \@writefile{lof}{\contentsline {figure}{\numberline {4}{\ignorespaces Secondary index compaction example}}{4}}
 \newlabel{fig:secondary_compaction_example}{{4}{4}}
-\@writefile{toc}{\contentsline {subsubsection}{\numberline {3.2.2}Secondary index}{4}}
 \@writefile{lof}{\contentsline {figure}{\numberline {5}{\ignorespaces Secondary index read example}}{4}}
 \newlabel{fig:secondary_reading_example}{{5}{4}}
 \@writefile{toc}{\contentsline {subsection}{\numberline {3.3}Read}{4}}
 \@writefile{toc}{\contentsline {subsection}{\numberline {3.4}Implementation}{4}}
+\citation{Kirsch:bloom_less_hashing}
+\citation{Putze:bloom_cache_oblivious}
 \citation{kai:slimdb}
 \@writefile{lof}{\contentsline {figure}{\numberline {6}{\ignorespaces Primary index compaction schema}}{5}}
 \newlabel{fig:compaction_implementation}{{6}{5}}
-\@writefile{toc}{\contentsline {section}{\numberline {4}Mathematical basics}{5}}
+\@writefile{toc}{\contentsline {section}{\numberline {4}Mathematical foundations}{5}}
 \@writefile{toc}{\contentsline {section}{\numberline {5}Evaluation}{6}}
 \@writefile{toc}{\contentsline {subsection}{\numberline {5.1}Microbench}{6}}
 \citation{Armstrong:linkbench}
 \citation{Edward:incremental_update}
 \citation{Lohman:differential_files}
-\citation{Wang:open_channel_ssd}
 \@writefile{lof}{\contentsline {figure}{\numberline {7}{\ignorespaces Microbenchmark RPS}}{7}}
 \newlabel{fig:rps_microbench}{{7}{7}}
-\@writefile{lof}{\contentsline {figure}{\numberline {8}{\ignorespaces Microbenchmark disk statement number}}{7}}
+\@writefile{lof}{\contentsline {figure}{\numberline {8}{\ignorespaces Microbenchmark disk statement count}}{7}}
 \newlabel{fig:disk_stmt_microbench}{{8}{7}}
-\@writefile{lof}{\contentsline {figure}{\numberline {9}{\ignorespaces Microbenchmark dump number}}{7}}
+\@writefile{lof}{\contentsline {figure}{\numberline {9}{\ignorespaces Microbenchmark dump count}}{7}}
 \newlabel{fig:dump_count_microbench}{{9}{7}}
-\@writefile{lot}{\contentsline {table}{\numberline {1}{\ignorespaces Microbenchmark RPS aggregated}}{7}}
+\@writefile{lot}{\contentsline {table}{\numberline {1}{\ignorespaces Microbenchmark aggregated RPS}}{7}}
 \newlabel{table:rps_microbench}{{1}{7}}
-\@writefile{lof}{\contentsline {figure}{\numberline {10}{\ignorespaces Linkbench RPS}}{7}}
-\newlabel{fig:linkbench}{{10}{7}}
-\@writefile{toc}{\contentsline {subsection}{\numberline {5.2}Linkbench}{7}}
+\@writefile{toc}{\contentsline {subsection}{\numberline {5.2}LinkBench}{7}}
 \@writefile{toc}{\contentsline {section}{\numberline {6}Related work}{7}}
+\citation{Wang:open_channel_ssd}
 \bibstyle{abbrv}
 \bibdata{vldb_sample}
 \bibcite{Armstrong:linkbench}{1}
 \bibcite{Kirsch:bloom_less_hashing}{2}
 \bibcite{Edward:incremental_update}{3}
 \bibcite{Putze:bloom_cache_oblivious}{4}
 \bibcite{kai:slimdb}{5}
-\bibcite{salas:calculus}{6}
-\bibcite{Lohman:differential_files}{7}
-\bibcite{Wang:open_channel_ssd}{8}
-\@writefile{toc}{\contentsline {section}{\numberline {7}References}{8}}
+\bibcite{Lohman:differential_files}{6}
+\bibcite{Wang:open_channel_ssd}{7}
+\@writefile{lof}{\contentsline {figure}{\numberline {10}{\ignorespaces LinkBench RPS}}{8}}
+\newlabel{fig:linkbench}{{10}{8}}
+\@writefile{toc}{\contentsline {section}{\numberline {7}Conclusion}{8}}
+\@writefile{toc}{\contentsline {section}{\numberline {8}References}{8}}

compaction_implementation.psd

@@ -7,60 +7,6 @@ @INPROCEEDINGS{kai:slimdb
 	YEAR = {2017},
 	VOLUME = "{10}"	}
 
-@ARTICLE{bowman:reasoning,
-	AUTHOR = "Mic Bowman and Saumya K. Debray and Larry L. Peterson",
-	TITLE = "Reasoning About Naming Systems",
-	JOURNAL = "ACM Trans. Program. Lang. Syst.",
-	VOLUME = {15},
-	NUMBER = {5},
-	PAGES = {795-825},
-	MONTH = "November",
-	YEAR = {1993}	}
-
-@ARTICLE{braams:babel,
-	AUTHOR = "Johannes Braams",
-	TITLE = "Babel, a Multilingual Style-Option System for Use with LaTeX's Standard Document Styles",
-	JOURNAL = {TUGboat},
-	VOLUME = {12},
-	NUMBER = {2},
-	PAGES = {291-301},
-	MONTH = "June",
-	YEAR = {1991}	}
-
-@INPROCEEDINGS{clark:pct,
-	AUTHOR = "Malcolm Clark",
-	TITLE = "Post Congress Tristesse",
-	BOOKTITLE = "TeX90 Conference Proceedings",
-	PAGES = "84-89",
-	ORGANIZATION = "TeX Users Group",
-	MONTH = "March", 
-	YEAR = {1991}	}
-
-@ARTICLE{herlihy:methodology,
-	AUTHOR = "Maurice Herlihy",
-	TITLE = "A Methodology for Implementing Highly Concurrent
-	Data Objects",
-	JOURNAL = {ACM Trans. Program. Lang. Syst.},
-	VOLUME = {15},
-	NUMBER = {5},
-	PAGES = {745-770},
-	MONTH = "November",
-	YEAR = {1993}	}
-
-@BOOK{Lamport:LaTeX,
-	AUTHOR = "Leslie Lamport",
-	TITLE = "LaTeX User's Guide and Document Reference Manual",
-	PUBLISHER = "Addison-Wesley Publishing Company",
-	ADDRESS = "Reading, Massachusetts",
-	YEAR = "1986"	}
-
-@BOOK{salas:calculus,
-	AUTHOR = "S.L. Salas and Einar Hille",
-	TITLE = "Calculus: One and Several Variable",
-	PUBLISHER = "John Wiley and Sons",
-	ADDRESS = "New York",
-	YEAR = "1978"	}
-
 @ARTICLE{Edward:incremental_update,
 	AUTHOR = "Edward Omiecinski and Wei Liu and Ian Akyildiz",
 	TITLE = "Analysis of a deferred and incremental update strategy for secondary indexes",

secondary_compaction_example.pdf

@@ -104,7 +104,7 @@
 this advantage is nullified by secondary indexes, because replace/delete-like
 operations require reading and explicitly deleting old data from each secondary index.
 This paper presents an LSM tree modification that allows not reading any indexes
-on replacement/deletion even if there are non-secondary indexes in the table.
+on replacement/deletion even if there are secondary indexes in the table.
 Experimental research of the modified LSM tree shows a 1.5-10-times increase
 in the write speed on tables with 2-4 non-unique secondary indexes, as compared
 with the original LSM tree. Write performance of the new LSM tree grows linearly with
@@ -668,9 +668,10 @@ \subsection{Microbench}
 index on the first field, and 4 secondary indexes, each on one field. In terms of the
 SQL syntax, it looks as follows:
 \begin{verbatim}
-create table test (field1 unsigned integer primary key, field2 unsigned integer,
-		   field3 unsigned integer, field4 unsigned integer,
-		   field5 unsigned integer);
+create table test
+(field1 unsigned integer primary key,
+ field2 unsigned integer, field3 unsigned integer,
+ field4 unsigned integer, field5 unsigned integer);
 create not unique index on test(field2);
 create not unique index on test(field3);
 create not unique index on test(field4);
@@ -778,6 +779,15 @@ \section{Related work}
 purely hardware, as the LSM tree is not changed at all, so it will not work for
 regular SSDs. However, this method can be combined with deferred updates.
 
+\section{Conclusion}
+
+This paper introduced a new version of the LSM tree that turns replace/delete
+operations into blind writes even if multiple indexes exist. The main idea is to
+defer old data lookup and deletion until compaction, which eliminates hidden
+reads. Several variants of the new compaction algorithm were proposed, and one
+of them was implemented. Exponential speed growth was mathematically proven for
+deferred updates, and the same results were obtained in experiments.
+
 % The following two commands are all you need in the
 % initial runs of your .tex file to
 % produce the bibliography for the citations in your paper.