Book Image

Architecting Data-Intensive Applications

By : Anuj Kumar
Book Image

Architecting Data-Intensive Applications

By: Anuj Kumar

Overview of this book

<p>Are you an architect or a developer who looks at your own applications gingerly while browsing through Facebook and applauding it silently for its data-intensive, yet ?uent and efficient, behaviour? This book is your gateway to build smart data-intensive systems by incorporating the core data-intensive architectural principles, patterns, and techniques directly into your application architecture.</p> <p>This book starts by taking you through the primary design challenges involved with architecting data-intensive applications. You will learn how to implement data curation and data dissemination, depending on the volume of your data. You will then implement your application architecture one step at a time. You will get to grips with implementing the correct message delivery protocols and creating a data layer that doesn’t fail when running high traffic. This book will show you how you can divide your application into layers, each of which adheres to the single responsibility principle. By the end of this book, you will learn to streamline your thoughts and make the right choice in terms of technologies and architectural principles based on the problem at hand.</p>
Table of Contents (18 chapters)
Title Page
Packt Upsell
Contributors
Preface
Index

Relational Database Management Systems and Big data


A Relational Database Management System was first conceptualized by Edgar Codd in the late 1960s. The underlying data structure that Relational Databases use for interacting with the data is a B-Tree. Balanced (and not Binary) Trees is a mechanism to place and locate data records in a database.

B-Tree was used primarily because the algorithm behind B-Tree minimizes the total number of times a disk must be accessed to locate a desired record, thereby essentially speeding up the overall process of fetching the data. There are two concepts that you should know with respect to the underlying disk storing the data record:

  • Seeking: A process where the head of the disk is moved to a particular place on the disk to either read or write the data. Latency of the disk operation is directly related to the seek time.
  • Bandwidth: A disk bandwidth defines the rate of the transfer of data between the disk and the underlying SATA interface or any other interface...