While Aggregates  were neither used in E.F.  Codd's seminal work on
Relational Database, nor in early Logic Programming systems, their importance

in those two fields, and  in the many  others related to them, has grown 
exponentially over the years.  In this lecture, we will review past research
work on aggregates used  in problem areas such as deductive databases,
data mining,  data streams, and non-monotonic reasoning. Then, our presentation

will  focus on our recent  discoveries  that by overcoming the hurdles of 
 non-monotonicity  make possible the  use of aggregates in recursive

queries and programs. These  programs  can express declaratively  a wide range
of powerful algorithms that  deliver superior performance and scalability 
on BigData  applications and  Map-Reduce systems.