Download as PDF, PPTX
![[ α1 α1 α1 ...αn ] ρ](https://image.slidesharecdn.com/cassandrasummit2015-dataanalyticswithcassandraandclojure-151002213523-lva1-app6891/75/codecentric-AG-Using-Cassandra-and-Clojure-for-Data-Crunching-backends-44-2048.jpg)
![[[Mean(x1), Var(x1)]
[Mean(x2), Var(x3)]
...
[Mean(xn), Var(xn)]]](https://image.slidesharecdn.com/cassandrasummit2015-dataanalyticswithcassandraandclojure-151002213523-lva1-app6891/75/codecentric-AG-Using-Cassandra-and-Clojure-for-Data-Crunching-backends-56-2048.jpg)
![[ α1 α1 α1 ...αn ] ρ](https://crownmelresort.com/image.slidesharecdn.com/cassandrasummit2015-dataanalyticswithcassandraandclojure-151002213523-lva1-app6891/75/codecentric-AG-Using-Cassandra-and-Clojure-for-Data-Crunching-backends-44-2048.jpg)
![[[Mean(x1), Var(x1)]
[Mean(x2), Var(x3)]
...
[Mean(xn), Var(xn)]]](https://crownmelresort.com/image.slidesharecdn.com/cassandrasummit2015-dataanalyticswithcassandraandclojure-151002213523-lva1-app6891/75/codecentric-AG-Using-Cassandra-and-Clojure-for-Data-Crunching-backends-56-2048.jpg)
Uploaded byDataStax Academy
codecentric AG: Using Cassandra and Clojure for Data Crunching backends
The document discusses Cassandra monitoring, emphasizing the distinction between semantics and anomaly detection. It covers various techniques, including ad-hoc queries, data modeling for machine learning, and the use of data structures like Bloom filters and count-min sketches for efficient data handling. Additionally, it addresses performance optimizations and the lightweight design of data representation compatible with parallel processing.
More Related Content
Similar to codecentric AG: Using Cassandra and Clojure for Data Crunching backends
![Support, Monitoring, Continuous Improvement & Scaling Agentic Automation [3/3]](https://cdn.slidesharecdn.com/ss_thumbnails/agenticcommunityseries-day3-cfd-251120170304-ddef8112-thumbnail.jpg?width=640&height=640&fit=bounds)
codecentric AG: Using Cassandra and Clojure for Data Crunching backends
- 1.
- 2.
- 4.
- 5.
- 6.
- 7.
- 8.
- 9. Do you seethe elephant being swallowed by the snake?
- 10.
- 11.
- 12.
- 13.
- 14.
- 15. +---------------+---------------+ | timestamp |sequenceId | +---------------+---------------+
- 16.
- 17.
- 18. ts1 ts2 ts3ts4 ts5 ts6 ts7 ts8 ts9 ts10 ts11 ts12 ts13 RangeTables
- 19. FullTableScan ts1 ts2 ts3ts4 ts5 ts6 ts7 ts8 ts9 ts10 ts11 ts12 ts13 Start End
- 20. ts1 ts2 ts3ts4 ts5 ts6 ts7 ts8 ts9 ts10 ts11 ts12 ts13
- 21. OpenRange Start End ts1 ts2ts3 ts4 ts5 ts6 ts7 ts8 ts9 ts10 ts11 ts12 ts13
- 22. ts1 ts2 ts3ts4 ts5 ts6 ts7 ts8 ts9 ts10 ts11 ts12 ts13
- 23. “Between”Range ts1 ts2 ts3ts4 ts5 ts6 ts7 ts8 ts9 ts10 ts11 ts12 ts13 Start End
- 24. ts1 ts2 ts3ts4 ts5 ts6 ts7 ts8 ts9 ts10 ts11 ts12 ts13
- 25.
- 27.
- 28.
- 29.
- 30.
- 31. data Step datacursor = Yield data !cursor | Skip !cursor | Done data Stream data = ∃s. Stream (cursor → Step data cursor) cursor
- 32.
- 33. map Yield data cursor→ Yield (f cursor) cursor Skip cursor → Skip cursor Done → Done maps :: (a → b) → Stream a → Stream b
- 34. filter Yield data cursor| p data → Yield data cursor | otherwise → Skip cursor Skip cursor → Skip cursor Done → Done filters :: (a → Bool) → Stream a → Stream a
- 35. reduce/fold Yield x cursor→ loop (f data x) cursor Skip cursor → loop data cursor Done → z foldls :: (Monoid acc) => (acc → a → acc) → acc → Stream a → acc
- 36. Append class Monoid awhere mempty :: a mappend :: a -> a -> a -- ^ Identity of 'mappend' -- ^ An associative operation
- 37. class (Monoid intermediate)=> Aggregate intermediate end where combine :: intermediate -> end Combine
- 38. data Count =Count Int instance Monoid Count where mempty = Count 0 mappend (Count a) (Count b) = Count $ a + b instance Aggregate Count Int where combine (Count a) = a CountExample
- 39.
- 40.
- 41.
- 43.
- 44. [ α1 α1α1 ...αn ] ρ
- 45.
- 46. CREATE TABLE support_vectors( pathvarchar, alpha list<double>, phi int, PRIMARY KEY(path))
- 47.
- 48.
- 49.
- 50. 0 8 1624 32 40 n*8 +----+----+----+----+----+----+----+----+ | α | α | α | α | α | ... | α | +----+----+----+----+----+----+----+----+ byte address points 1 2 3 40 n
- 51.
- 52. 0 8 1624 32 40 n*8 +----+----+----+----+----+---------+----+ | α | α | α | α | α | ... | α | +----+----+----+----+----+---------+----+ 01 02 03 0400 1n n*8+ 0 8 16 24 32 40 n*8 +----+----+----+----+----+---------+----+ | α | α | α | α | α | ... | α | +----+----+----+----+----+---------+----+ 01 02 03 0400 1n m*n*8+ 0 8 16 24 32 40 n*8 +----+----+----+----+----+---------+----+ | α | α | α | α | α | ... | α | +----+----+----+----+----+---------+----+ m1 m2 m3 m4m0 mn
- 53.
- 54.
- 55.
- 56.
- 57. 0 8 16 +---------+---------+ |Mean(x )| Var(x ) | +---------+---------+ 0 0 16 24 32 +---------+---------+ | Mean(x )| Var(x ) | +---------+---------+ 1 1 2n*8 (2n+1)*8 +---------+---------+ | Mean(x )| Var(x ) | +---------+---------+ n n byte address payloads
- 58.
- 59.
- 60.
- 61.
- 62.
- 63. 0 8 +---+---+---+---+---+---+---+---+ | 0| 0 | 0 | 0 | 0 | 0 | 0 | 0 | +---+---+---+---+---+---+---+---+ 8 16 +---+---+---+---+---+---+---+---+ | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | +---+---+---+---+---+---+---+---+ 16 24 +---+---+---+---+---+---+---+---+ | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | +---+---+---+---+---+---+---+---+ 24 32 +---+---+---+---+---+---+---+---+ | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | +---+---+---+---+---+---+---+---+ ... bit address
- 64.
- 65.
- 66. 0 8 1624 32 40 n*8 +----+----+----+----+----+---------+----+ | α | α | α | α | α | ... | α | +----+----+----+----+----+---------+----+ 01 02 03 0400 1n n*8+ 0 8 16 24 32 40 n*8 +----+----+----+----+----+---------+----+ | α | α | α | α | α | ... | α | +----+----+----+----+----+---------+----+ 01 02 03 0400 1n m*n*8+ 0 8 16 24 32 40 n*8 +----+----+----+----+----+---------+----+ | α | α | α | α | α | ... | α | +----+----+----+----+----+---------+----+ m1 m2 m3 m4m0 mn
- 67.
- 68. 0 8 1624 32 40 n*8 +----+----+----+----+----+---------+----+ | α | α | α | α | α | ... | α | +----+----+----+----+----+---------+----+ 01 02 03 0400 1n 0 8 16 24 32 40 n*8 +----+----+----+----+----+---------+----+ | α | α | α | α | α | ... | α | +----+----+----+----+----+---------+----+ 01 02 03 0400 1n byte address byte address Longs (counts) Doubles (bin start number)
- 69.
- 70.