Skip to content
No description, website, or topics provided.
Jupyter Notebook Other
Branch: master
Clone or download
Latest commit 3d78b21 Sep 17, 2019
Type Name Latest commit message Commit time
Failed to load latest commit information.
.github/workflows try 2 Sep 17, 2019
deps Adding catch for unit testing Sep 12, 2019
include Creating generator class Sep 13, 2019
plots WIP: Plots Aug 30, 2019
src Adding small test case Sep 13, 2019
test Found sneaky cmake file Sep 17, 2019
.gitignore CMake version is too high adding clion stuff to gitignore Sep 17, 2019
CMakeLists.txt CMake version is too high adding clion stuff to gitignore Sep 17, 2019 README Aug 7, 2019 First version of experiments script Jul 31, 2019 wip Aug 2, 2019

Multidimensional Adaptive Indexing (MDAI)

In this stand-alone implementation, we present various MDAI approaches and compare them to state of the art indexing strategies for multidimensional data through several different benchmarks.


How to run

Run the following command on the root of the project, it will guide you through selecting the experiment and algorithms to run. Then it will provide instructions on what to do next.


To Do

  • Data Generator Benchmark
  • Workload Generator Benchmark
  • Implement Full Scan
  • Implement Testing procedures
  • Implement Cracking KD-Tree Broad
  • Make both KD-Trees update their statistics (height, number of nodes, min_height)
  • Implement Cracking KD-Tree Narrow (Need to fix bugs and improve its speed)
  • Implement KD-Tree with median
  • Implement KD-Tree with average
  • Implement Quasii
  • Implement Full Index B-Tree
  • Implement Regular Cracking using B-Tree
  • Implement a Row-Store Table to check if they have difference
  • Check "Bitwise dimensional co-clustering for analytical workloads"


  • Cracking KD-Tree: The First Multidimensional Adaptive Indexing (Position Paper). P. Holanda, M. Nerone, E. C. de Almeida and S. Manegold @ DATA 2018
You can’t perform that action at this time.