Maximizing a monotone submodular function under cardinality constraint k is a core problem in machine learning and database with many basic applications, including video and data summarization, recommendation systems, feature extraction, exemplar clustering, and coverage problems. We study this classic problem in the fully dynamic model where a stream of inserts and deletes of elements of an underlying ground set is given and the goal is to maintain an approximate solution using a fast update ti…