VLDB.md

+## Analysis & Experiments Track
+Analysing NVM-based data & index structures
+
+### Hypothese
+* Which data structure for which scenarios/access patterns
+* any missing data structures (gaps) - similar to periodic table (stratos)
+
+### Data Structures
+* NV-Tree
+* FP-Tree
+* HiKV
+* Bz-Tree
+* PMDK-based B-Tree
+* (PTable/BDCC?)
+* (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
+* adjustments: sorted vs. unsorted, using fingerprinting/hashing, node sizes, ...
\ No newline at end of file