I have been speaking at conferences, meetups, and other events since 2017. I really enjoyed the experience and need to try to get back to it again.
Introduced by Ralph C. Merkle, the Merkle Tree is a data structure used for efficiently summarizing and verifying the integrity of large sets of data. Due to its unique content validating and performance qualities, they are especially useful in distributed, peer-to-peer systems where the same data should exist in multiple places. Let's learn how to detect inconsistencies between trees and reduce the amount of transferred data enabling peer-to-peer file sharing by building our own tree with Elixir.
Introduced by Ralph C. Merkle, the Merkle Tree is a data structure used for efficiently summarizing and verifying the integrity of large sets of data. Due to its unique content validating and performance qualities, they are especially useful in distributed, peer-to-peer systems where the same data should exist in multiple places. Let's learn how to detect inconsistencies between trees and reduce the amount of transferred data enabling peer-to-peer file sharing by building our own tree with Elixir.
Let's sit together and discuss about one of the most misunderstood concept in distributed systems, introduced by Eric A. Brewer in the paper Harvest, Yield, and Scalable Tolerant Systems, the CAP Theorem.
Let's sit together and discuss about one of the most misunderstood concept in distributed systems, introduced by Eric A. Brewer in the paper Harvest, Yield, and Scalable Tolerant Systems, the CAP Theorem.
In order to select the storage engine that is appropriate for your application, you need to have a rough idea of what the storage engine is doing under the hood. In this talk, we’ll discuss and examine some core data structures such as Hash Indexes, SSTables, LSM-Trees, and B-Trees, that are used in the traditional relational databases and NoSQL databases.
In order to select the storage engine that is appropriate for your application, you need to have a rough idea of what the storage engine is doing under the hood. In this talk, we’ll discuss and examine some core data structures such as Hash Indexes, SSTables, LSM-Trees, and B-Trees, that are used in the traditional relational databases and NoSQL databases.
We live surrounded by bad practices, stress, and fear of missing a delivery timeline. We all work or worked, on projects with those characteristics. If we don't enforce a shared culture of testing, no matter what, the quality of the software that we produce will suffer. With this talk/topic, I want to share the problems and solutions that will enable us to create a shared testing culture across our team and company.
We live surrounded by bad practices, stress, and fear of missing a delivery timeline. We all work or worked, on projects with those characteristics. If we don't enforce a shared culture of testing, no matter what, the quality of the software that we produce will suffer. With this talk/topic, I want to share the problems and solutions that will enable us to create a shared testing culture across our team and company.
We need to ensure that when we deploy a new service into production, our changes won't break any consumer; We can do this kind of testing without the need of a real consumer by using consumer-driven contracts. In this talk, I will show you how to implement consumer-driven contracts and we'll move TDD to the level of software architecture.
We need to ensure that when we deploy a new service into production, our changes won't break any consumer; We can do this kind of testing without the need of a real consumer by using consumer-driven contracts. In this talk, I will show you how to implement consumer-driven contracts and we'll move TDD to the level of software architecture.