[
  {
    "id": "cs-12-1",
    "type": "article-journal",
    "title": "An improved data stream summary: the count-min sketch and its applications",
    "author": [
      {
        "given": "Graham",
        "family": "Cormode"
      },
      {
        "given": "S.",
        "family": "Muthukrishnan"
      }
    ],
    "container-title": "Journal of Algorithms",
    "issued": {
      "date-parts": [
        [
          2005
        ]
      ]
    },
    "DOI": "10.1016/j.jalgor.2003.12.001",
    "URL": "https://www.cs.ox.ac.uk/people/graham.cormode/pubs/papers/cm-full.pdf"
  },
  {
    "id": "cs-12-2",
    "type": "article-journal",
    "title": "HyperLogLog: the analysis of a near-optimal cardinality estimation algorithm",
    "author": [
      {
        "given": "Philippe",
        "family": "Flajolet"
      },
      {
        "given": "Éric",
        "family": "Fusy"
      },
      {
        "given": "Olivier",
        "family": "Gandouet"
      },
      {
        "given": "Frédéric",
        "family": "Meunier"
      }
    ],
    "container-title": "Discrete Mathematics & Theoretical Computer Science",
    "issued": {
      "date-parts": [
        [
          2007
        ]
      ]
    },
    "DOI": "10.46298/dmtcs.3545",
    "URL": "https://dmtcs.episciences.org/articles/3545"
  },
  {
    "id": "cs-12-3",
    "type": "paper-conference",
    "title": "Finding Frequent Items in Data Streams",
    "author": [
      {
        "given": "Moses",
        "family": "Charikar"
      },
      {
        "given": "Kevin",
        "family": "Chen"
      },
      {
        "given": "Martin",
        "family": "Farach-Colton"
      }
    ],
    "container-title": "Lecture Notes in Computer Science; Automata, Languages and Programming",
    "issued": {
      "date-parts": [
        [
          2002
        ]
      ]
    },
    "DOI": "10.1007/3-540-45465-9_59",
    "URL": "https://www.cs.yale.edu/homes/el327/datamining2011aFiles/FindingFrequentItemsInDataStreams.pdf"
  }
]