We propose a kernel-based online change detection algorithm, running in O(log n) time and space, and show its minimax optimality.