4. The “direct to data” quasardb technology
4
Fast and frugal
ACID transactions
Scale-out / Scale-up
Automatic replication
Batch processing
Streaming
Unlimited tagging
Multi-platform
Spark integration
And so much more!
6. In real life
Even for large entries
Even under pressure
We chose the impossible
6
Reliable
Fast
Scalable
Multi-processor friendly
Multi-nodes friendly
No software limit
Fail gracefully
No “small print”
7. Don’t search, tag!
7
• Indexing the whole content is slow
• Document oriented approach does not scale
• Relations don’t scale
Our solution: tagging
• Scalable
• Inexpensive
• Simple
• Flexible
8. Scalable thanks to the Chord Algorithm
8
100
150
200
12 1
• Consistent hashing distribution
• Fully symmetric: no master node
• Each node only knows about its neighbors
• Lookup: O (log n) complexity
Crawl the ring in O (log n) to find SHA-3 (key) successor
Data
Key SHA-3 21
28
1
12
9. What reliable means
9
Persistence Distribution Networking Memory
Synchronous
Consistent
Replication
Hot plug’n’play
Timeout
Retries
Safe
marshaling
Greedy
Overcome
low-memory
conditions
10. Symmetric, Asynchronous, Atomic and Lock-Free
10
Unlimited parallel read access
Highly optimized
memory
management
Elastic
and transparent
Continuous
self-
optimization
BA No global
lock
11. Optimized Memory Usage : Zero Copy
11
AFinal result
MarshallingA
BufferingA
A
Unmarshalling A
Network copy
Network transmissionA
A
Original
A
A
13. Benefits
13
Easy installation and set-up
• Simple user interface
• Data agnostic
• Hot plug’n’play
Scalability
• Theoretical infinite scalability thanks to a P2P design
• Automatic sharding on membership changes
• Schemaless design
Protect your investment
• Complete your ecosystem but does not replace it
• Works on all infrastructure types
• Interfaces with all market’s standards
14. Benefits cont…
14
Reliability
• Masterless design ensures fault tolerance system
• No single point of failure
• No errors even under heavy loads
• Data replication provides high availability
Frugality
• Run on supercomputer and on limited resources
connected objects as well
• Benchmarks have shown a 40% reduction of
computer resources
• Consumes only required computer resources
18. Mail sorting systems
18
A couple of milliseconds to perform
hundreds of queries.
Speed and accuracy of quasardb
delivers.
19. Document archival
19
Customer dissatisfied with elastic
search.
Speed, reliability and complexity
issues.
With quasardb: no more pains
points and double the
performance!
20. Historical financial data
20
Load the terabytes of data you
need in a couple of minutes in a
big memory machine.
And then… Sub-second
computations.
This is how you should do Big
Data.
Crawl the ring in O (log n) to find SHA-3 (key) successor
Consistent hashing distribution
Fully symmetric: no master node
Each node only knows about its neighbors
Lookup: O (log n) complexity
Crawl the ring in O (log n) to find SHA-3 (key) successor
Consistent hashing distribution
Fully symmetric: no master node
Each node only knows about its neighbors
Lookup: O (log n) complexity