Enabling Arbitrary Memory Constraint Standing Queries on Distributed Stream Processors using Approximate Algorithms
Relational algebra and SQL have been a standard in declarative analytics for decades. Yet, at web-scale, even simple analytics queries can prove challenging within Distributed Stream Processing environments. Two examples of such queries are "count" and "count distinct". Since afo...
Main Author: | Lindener, Tobias |
---|---|
Format: | Others |
Language: | English |
Published: |
KTH, Skolan för elektroteknik och datavetenskap (EECS)
2018
|
Subjects: | |
Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-237459 |
Similar Items
-
Effective Task Scheduling of In-Memory Databases on a Sub-NUMA Processor Topology
by: Greinsmark, Hadar
Published: (2020) -
Managed Distributed TensorFlow with YARN : Enabling Large-Scale Machine Learning on Hadoop Clusters
by: Johansson, Tobias
Published: (2018) -
Stream processor architecture - streaming memory system
by: Ngo, Wai Loon
Published: (2015) -
Reconfigurable Network Processor Implementation
by: Babataheri, Gazizeh
Published: (2014) -
In-memory Distributed Computing Based Approximate Query Processing on Spatial Data
by: QIU A'gen
Published: (2017-12-01)