outline

_papers/thesis-report/additional/extended-abstract.typ

@@ -1,6 +1,7 @@
 #import "../utils/review.typ": *
 #import "../utils/general.typ": *
 #import "../raw/consts.typ": *
+#import "../raw/evaluation-tables.typ": *
 
 // multiple bibliography issues: https://github.com/typst/typst/issues/1097
 // -> We will mymic a bibliography (and we dont't care about the title scope)
@@ -35,7 +36,7 @@
   }
 }
 
-#show figure.where(kind: "table"): set figure.caption(position: top)
+#show figure.where(kind: table): set figure.caption(position: top)
 #show figure.caption: set align(left)
 #show figure.where(kind: raw): set figure(kind: image)
 
@@ -351,13 +352,23 @@ These organization structures are then evaluated using queries that test five di
 + deleting a resource.
 ]
 
-#IRT[We definitely need to mention some results here in some way! E.g. via a figure or table. Feel free to shorten future work to make space for this.]
+Choke points 1 and 3 are most essential for SGV,
+we therefore provide the measure execution time for these in respectively @fig1:res-insert-data-complete and @fig1:res-delete-insert-id.
+The interested reader can find the other evaluations in the accompanying document.
 
-From these evaluations, we concluded that our hypothesis holds for all choke points except one.
-An SGV-aware query engine evaluating a query that does move the resource is slower than the same query evaluated by a non-SGV aware engine.
-Note that the other engine does not move the resource, and that a SPARQL query has no way of expressing a resource move because it cannot express the CBD.
+From evaluations, we concluded that our hypothesis holds when we compare the execution time of an SGV query engine to a non-SGV engine that executes the same
+operations.
+Note that using a non-SGV engine, one cannot express the resource move using a single SPARQL query because SPARQL cannot express the CBD.
 
-We can thus conclude from our benchmarks that the hypothesis holds only in case the SGV-query behaviour could be expressed using a SPARQL query.
+#figure(
+  insert-data-short,
+  caption: [Average execution time of inserting data (avg. of 100 runs)]
+) <fig1:res-insert-data-complete>
+
+#figure(
+  delete-insert-id-short,
+  caption: [Average execution time of moving a resource (avg. of 100 runs)]
+) <fig1:res-delete-insert-id>
 
 
 = Future Work

_papers/thesis-report/chapters/preface.typ

@@ -101,5 +101,25 @@ The reason being that applications are typically created in such a way that they
 
 == Outline
 
-#todo[describe outline when we are done]
+In the next chapter, we describe the Semantic Web, an idea launched by the inventor of the Web almost two decades ago.
+The semantic web is an enormous research domain, so we limit the discussion to what is required to understand this work.
+We therefore focus on data representation, data query language, data validation and data retrieval.
+
+We continue by discussing parts of the Solid specification and positioning it in the broader data storage field.
+
+In our fourth chapter, we shortly discuss the use case used throughout the examples of this work.
+
+After discussing the use case, we discuss our contributions in detail.
+To clearly explain the introduced vocabulary, we start by providing a high-level overview, after which we walk through some user flows.
+Only once those high-level views are explained will we delve into the details of the vocabulary.
+We conclude the chapter on our contributions by sketching three short configurations that handle a single use case.
+
+After explaining vocabulary, we continue to evaluate it.
+This evaluation knows both a theoretical and empirical faced.
+In the end, we will conclude that our hypothesis does indeed hold.
+
+Now that we proved our work heads in the right direction, we look onto to the future, discussing various research opportunities.
+Since this work is, to our knowledge, the first of its kind in this ecosystem, we see a lot of research avenues.
+
+We end in a conclusion where we look back at the presented work.
 

_papers/thesis-report/main.typ

@@ -1,3 +1,7 @@
+////////////////////////////////////////////////////////
+/////////////// TYPST VERSION: 0.11.1 //////////////////
+////////////////////////////////////////////////////////
+
 #import "@preview/drafting:0.2.0": set-page-properties // https://typst.app/universe/package/drafting
 // #import "@preview/exzellenz-tum-thesis:0.1.0": exzellenz-tum-thesis
 #import "@preview/hydra:0.4.0": hydra

_papers/thesis-report/raw/evaluation-tables.typ

@@ -42,6 +42,20 @@ Same behaviour
   [insert data complete by creation location: SGV], [23], [43005.366], [±2.20%],
   [insert data complete by creation location: RAW], [35], [28003.949], [±2.53%],
 )
+#let insert-data-short = table(
+  columns: (auto, auto, auto, auto),
+  table.header(
+    [*frag. Strat.*], [*ops/sec*], [*Average Time (ms)*], [*Margin*],
+  ),
+  [by date: SGV], [22], [44582.068], [±1.73%],
+  [by date: RAW], [35], [27899.513], [±2.07%],
+  [one file: SGV], [6], [149415.739], [±2.98%],
+  [one file: RAW], [7], [134361.192], [±8.66%],
+  [own file: SGV], [10], [91851.395], [±2.56%],
+  [own file: RAW], [13], [76672.217], [±3.07%],
+  [by location: SGV], [23], [43005.366], [±2.20%],
+  [by location: RAW], [35], [28003.949], [±2.53%],
+)
 
 #let delete-data-complete = table(
   columns: (auto, auto, auto, auto),
@@ -117,6 +131,20 @@ Same behaviour
   [delete insert id by creation location: SGV], [7], [133052.120], [±0.60%],
   [delete insert id by creation location: RAW], [12], [81066.196], [±1.15%],
 )
+#let delete-insert-id-short = table(
+  columns: (auto, auto, auto, auto),
+  table.header(
+    [*Task*], [*ops/sec*], [*Average Time (ms)*], [*Margin*],
+  ),
+  [by date: SGV], [7], [141940.530], [±1.28%],
+  [by date: RAW], [11], [87113.119], [±0.75%],
+  [one file: SGV], [2], [343690.220], [±1.70%],
+  [one file: RAW], [4], [208930.211], [±2.04%],
+  [own file: SGV], [5], [177991.908], [±0.58%],
+  [own file: RAW], [12], [80729.940], [±1.06%],
+  [by location: SGV], [7], [133052.120], [±0.60%],
+  [by location: RAW], [12], [81066.196], [±1.15%],
+)
 
 #let delete-where-complete = table(
   columns: (auto, auto, auto, auto),