VLDB.md

 ## Analysis & Experiments Track
 Analysing NVM-based data & index structures
+* [Overview](https://link.springer.com/article/10.1007%2Fs13222-018-0301-1)
 
-### Hypothese
-* Which data structure for which scenarios/access patterns
+### Hypothese/Contribution
+* which data structure for which scenarios/access patterns
+* effect of certain changes
 * any missing data structures (gaps) - similar to periodic table (stratos)
 
 ### Data Structures
-* NV-Tree
-* FP-Tree
-* HiKV
-* Bz-Tree
+
+* [NV-Tree](https://www.usenix.org/system/files/conference/fast15/fast15-paper-yang.pdf)
+* [FP-Tree](https://wwwdb.inf.tu-dresden.de/misc/papers/2016/Oukid_FPTree.pdf)
+* [HiKV](https://www.usenix.org/system/files/conference/atc17/atc17-xia.pdf)
+* [Bz-Tree](https://dl.acm.org/citation.cfm?id=3164147)
 * PMDK-based B-Tree
-* (PTable/BDCC?)
+* ([PTable/BDCC](http://www.carch.ac.cn/~ictdb/HardBD-Active-2018/papers/GotzeBS-hardbd-active-18.pdf)?)
 * (LSM-tree)
 * Skiplist (hybrid)
 
 ### Measurements/Experiments
-* 1. category (internal): read, write, travers (vertical, horizontal), structure changes (split, merge)
-* 2. category (structure): get, update, delete, put, scan, recovery
-* 3. category (scalability): workloads (YCSB-based), multi-threaded performance
+* *1. category (internal):* read, write, travers (vertical, horizontal), structure changes (split, merge)
+* *2. category (structure):* get, update, delete, put, scan, recovery
+* *3. category (scalability):* workloads (YCSB-based), multi-threaded performance
 * adjustments: sorted vs. unsorted, using fingerprinting/hashing, node sizes, ...
\ No newline at end of file