Efficient data structures

Address #20 

No more O(N) look-ups!
- alerts : binary tree O(ln N + d)
- items: interval tree (augmented tree) O(ln N + d)
- anchors: binary tree O(ln N + d)