Code Zone

BPlusTree.py: Beispielimplementierung eines B+-Baums in Python. Erzeugt eine textuelle Repräsentation der Baumstruktur auf stdout. Schreibt zusätzlich ein .dot-File, das mit Hilfe der Graphviz-Software visualisiert werden kann. Beispiel:

K Nearest Neighbors Task Skeleton: we provide a few Java classes which serve as a skeleton to implement the K Nearest Neighbors programming exercise from Exercise Sheet 3. Given the KD-Trie implementation in the skeleton, you should provide two implementations for the NNFinder interface. The first one is a brute force implementation that you should use to validate your solution. The second is the actual priority-queue-based algorithm for finding nearest neighbors. You may visualize your solutions using an SVG Viewer. For example:

Operators Task Skeleton: we provide a few Java classes which serve as a skeleton to implement the programming exercise described in Exercise Sheet 5. You will implement a set of operators for the analytics engine of the ACME Corporation. See the ACME product catalog here.