Next week Michael and I (Bradley) will be travelling to Silicon Valley to present a tutorial on Data Structures and Algorithms for Big Databases at the 6th XLDB Conference.

The tutorial, which is 4 hours on Monday afternoon, aims to cover the following topics (but it’s looking like we’ll have to drop several items for lack of time.)

This tutorial will explore data structures and algorithms for big databases. The topics include:

• Data structures including B-trees, Log Structured Merge Trees, and Streaming B-trees.
• Approximate Query Membership data structures including Bloom filters and cascade filters.
• Algorithms for join including hash joins and