hamidr

/**
 * Code generation of SQL query ====================================================================
 *
 * This exercise is a simplified example of the type of logic one needs to write when targeting
 * XONAI underlying compiler to accelerate big data computations. Data is presented in columnar
 * format (as opposed to default Spark row format) similarly to the format used by our engine. The
 * goal is to write the missing code that performs the computation of the query.
 *
 * ATTENTION:
 * It should be written with performance in mind where every extra instruction matters. Also use of

hamidr

General Background and Overview

1. Probabilistic Data Structures for Web Analytics and Data Mining : A great overview of the space of probabilistic data structures and how they are used in approximation algorithm implementation.
2. Models and Issues in Data Stream Systems
3. Philippe Flajolet’s contribution to streaming algorithms : A presentation by Jérémie Lumbroso that visits some of the hostorical perspectives and how it all began with Flajolet
4. Approximate Frequency Counts over Data Streams by Gurmeet Singh Manku & Rajeev Motwani : One of the early papers on the subject.
5. [Methods for Finding Frequent Items in Data Streams](http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.187.9800&rep=rep1&t

hamidr

remove gnome apps

sudo dnf remove gnome-tour gnome-abrt gnome-calculator gnome-calendar gnome-maps gnome-weather \
    rhythmbox gnome-contacts totem gnome-logs gnome-photos gnome-clocks gedit gnome-system-moniter \
    gnome-user-docs gnome-screenshot gnome-remote-desktop

remove fedora chromium policies

sudo dnf remove fedora-chromium-config

hamidr

Keybase proof

I hereby claim:

• I am hamidr on github.
• I am 1hamidr (https://keybase.io/1hamidr) on keybase.
• I have a public key ASDxHGQzij7bT0_0PyICcSxSPRwU3UkAEpavutBHv_V1tAo

To claim this, I am signing this object:

hamidr

object MyTest {
  def main(args: Array[String]): Unit = {
    println(sequence1(Seq(Some(1), None, Some(2), None)))
    println(sequence2(Seq(Some(1), Some(3), Some(2), Some(5))))
  }

  def sequence1[T](items: Seq[Option[T]]): Option[Seq[T]] = {
    items.foldLeft(Option(Seq[T]())) { (res, e) =>
      e match {

hamidr

✗ make
-- Configuring done
-- Generating done
-- Build files have been written to: /home/hamid/adro/async-redis/build
Scanning dependencies of target parser
[  4%] Building CXX object CMakeFiles/parser.dir/src/parser/base_resp_parser.cpp.o
[  8%] Building CXX object CMakeFiles/parser.dir/src/parser/array_parser.cpp.o
[ 13%] Building CXX object CMakeFiles/parser.dir/src/parser/bulk_string_parser.cpp.o
[ 17%] Building CXX object CMakeFiles/parser.dir/src/parser/error_parser.cpp.o
[ 21%] Building CXX object CMakeFiles/parser.dir/src/parser/number_parser.cpp.o

hamidr

### Keybase proof

I hereby claim:

  * I am hamidr on github.
  * I am hamidr (https://keybase.io/hamidr) on keybase.
  * I have a public key whose fingerprint is BBF0 99B2 6EE7 9A27 1D32  9226 ADF6 4645 AA37 EFEB

To claim this, I am signing this object: