<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0" xmlns:cc="http://cyber.law.harvard.edu/rss/creativeCommonsRssModule.html">
    <channel>
        <title><![CDATA[Stories by Ishara Srimal on Medium]]></title>
        <description><![CDATA[Stories by Ishara Srimal on Medium]]></description>
        <link>https://medium.com/@isharasrimal4?source=rss-36454a9391d1------2</link>
        <image>
            <url>https://cdn-images-1.medium.com/fit/c/150/150/1*jQQ4Qj2mnTruVZqAQktbRg.jpeg</url>
            <title>Stories by Ishara Srimal on Medium</title>
            <link>https://medium.com/@isharasrimal4?source=rss-36454a9391d1------2</link>
        </image>
        <generator>Medium</generator>
        <lastBuildDate>Fri, 20 Nov 2026 02:47:56 GMT</lastBuildDate>
        <atom:link href="https://medium.com/@isharasrimal4/feed" rel="self" type="application/rss+xml"/>
        <webMaster><![CDATA[yourfriends@medium.com]]></webMaster>
        <atom:link href="http://medium.superfeedr.com/" rel="hub"/>
        <item>
            <title><![CDATA[Introduction to Object-Oriented Programming (OOP) in Java]]></title>
            <link>https://medium.com/@isharasrimal4/introduction-to-object-oriented-programming-oop-in-java-6504355b8aeb?source=rss-36454a9391d1------2</link>
            <guid isPermaLink="false">https://medium.com/p/6504355b8aeb</guid>
            <dc:creator><![CDATA[Ishara Srimal]]></dc:creator>
            <pubDate>Tue, 13 Aug 2024 16:00:29 GMT</pubDate>
            <atom:updated>2024-08-13T16:00:29.398Z</atom:updated>
            <content:encoded><![CDATA[<p>Object-Oriented Programming (OOP) is a fundamental programming paradigm that models real-world phenomena using “objects.” This approach helps developers structure their code in a way that mirrors real-world systems, making it more intuitive and easier to manage. Java, as a prominent object-oriented language, embodies the principles of OOP, providing a robust framework for building scalable and maintainable software.</p><p>In this blog, we will explore the core concepts of OOP in Java, including classes and objects, encapsulation, inheritance, polymorphism, and abstraction. Each concept plays a crucial role in crafting well-designed Java applications. Let’s dive into these concepts to understand how they work and how they can be leveraged effectively.</p><h4><strong><em>1. Classes and Objects: The Building Blocks of OOP</em></strong></h4><p><strong>Introduction</strong>: Classes and objects are the cornerstone of object-oriented programming. Think of a class as a blueprint or a template that defines the structure and behavior of objects. An object, on the other hand, is an instance of a class — it’s a concrete realization of the blueprint that encapsulates both data and behavior.</p><p><strong>Classes</strong> provide a way to define the attributes and methods that characterize an object. They act as a user-defined data type that can model real-world entities. <strong>Objects</strong> are instances of these classes and can interact with each other, which allows for more complex and meaningful interactions within a program.</p><p>In Java, classes are defined using the class keyword, and objects are created using the new keyword. Here’s a simple example to illustrate this:</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/606/1*JmWdCHO1Ex8xtarkkgcrpA.png" /></figure><h4><strong>2. Encapsulation: Protecting Data with Access Control</strong></h4><p><strong>Introduction</strong>: Encapsulation is a principle that helps in protecting the internal state of an object from unintended interference and misuse. It involves bundling the data (attributes) and methods (functions) that operate on the data into a single unit or class and restricting direct access to some of the object’s components.</p><p>By using encapsulation, you can control how the important data in an object is accessed and modified. This is achieved by making the attributes private and providing public getter and setter methods to access and update the values.</p><p>In Java, you achieve encapsulation by using access modifiers like private, protected, and public. Here’s an example:</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/571/1*RyzxBwD1fcoCfAcA_D3S5g.png" /></figure><h4><strong>3. Inheritance: Building Hierarchies and Reusing Code</strong></h4><p><strong>Introduction</strong>: Inheritance is a mechanism that allows one class (the subclass) to inherit the properties and behaviors of another class (the superclass). This concept promotes code reusability and establishes a natural hierarchy between classes.</p><p>Inheritance helps in extending existing code with minimal modifications. By inheriting from a superclass, a subclass can reuse code, add new features, or override existing ones. This makes it easier to manage and maintain complex systems by organizing them into hierarchical relationships.</p><p>In Java, you use the extends keyword to create a subclass from a superclass. Here’s an example demonstrating inheritance:</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/505/1*b-f8C6HBiclXNCa4R8RDZQ.png" /></figure><h4><strong>4. Polymorphism: One Interface, Multiple Implementations</strong></h4><p><strong>Introduction</strong>: Polymorphism, meaning “many forms,” allows objects to be treated as instances of their parent class rather than their actual class. It enables a single interface to be used for a general class of actions, with specific actions depending on the exact nature of the situation.</p><p>Polymorphism can be achieved through <strong>method overriding</strong> and <strong>method overloading</strong>. Method overriding allows a subclass to provide a specific implementation of a method that is already defined in its superclass. Method overloading allows multiple methods with the same name but different parameters within the same class.</p><p>Here’s how polymorphism works in Java:</p><ul><li><strong>Method Overriding</strong>:</li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/530/1*S8rqYILgMD7xiBit_7sh4w.png" /></figure><ul><li><strong>Method Overloading</strong>:</li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/372/1*VIxn8Q0a8_ISBc_BvnvF9w.png" /></figure><h4><strong>5. Abstraction: Simplifying Complex Systems</strong></h4><p><strong>Introduction</strong>: Abstraction is the process of hiding complex implementation details and showing only the essential features of an object. It helps in reducing complexity and allows a programmer to focus on interactions at a higher level.</p><p>In Java, abstraction is achieved through <strong>abstract classes</strong> and <strong>interfaces</strong>. An abstract class can have abstract methods (methods without implementation) that must be implemented by subclasses. An interface defines a contract that classes can implement, providing a way to define capabilities without specifying how they are implemented.</p><p>Here’s an example of abstraction in Java:</p><ul><li><strong>Abstract Class</strong>:</li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/520/1*z-gLYDi3ojJluw9A_ejPVw.png" /></figure><ul><li><strong>Interface</strong>:</li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/547/1*JHAeL5kSYCHnRrgToi6-3g.png" /></figure><p><strong>Conclusion</strong></p><p>Understanding and applying these OOP concepts,classes and objects, encapsulation, inheritance, polymorphism, and abstraction will help you design and develop more effective Java programs. These principles not only provide a clear structure for your code but also enhance its flexibility and maintainability.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=6504355b8aeb" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Seven Keys Of Database Management System…]]></title>
            <link>https://medium.com/@isharasrimal4/seven-keys-of-database-management-system-1d8a1dde5072?source=rss-36454a9391d1------2</link>
            <guid isPermaLink="false">https://medium.com/p/1d8a1dde5072</guid>
            <dc:creator><![CDATA[Ishara Srimal]]></dc:creator>
            <pubDate>Thu, 21 Sep 2023 18:10:01 GMT</pubDate>
            <atom:updated>2023-09-21T18:10:01.873Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*SPG5E1f7-eVnPrJQ59WOyw.jpeg" /></figure><p><strong>What are the keys in database?</strong></p><p>Database management systems (DBMS) play a crucial role in organizing, storing, and retrieving vast amounts of data efficiently. To ensure seamless data management, DBMS rely on seven fundamental principles, or &quot;keys,&quot; that serve as the foundation for their functionality. In this article, we will explore each of these keys in detail, shedding light on their significance and impact on the overall performance of a DBMS.</p><h3><strong>Types of keys</strong></h3><ol><li>Super Keys</li><li>Primary Keys</li><li>Candidate Keys</li><li>Alternate Keys</li><li>Foreign Keys</li><li>Composite Keys</li><li>Unique Keys</li></ol><figure><img alt="" src="https://cdn-images-1.medium.com/max/500/1*B0ft_BWqIj0pOoCZ84vuZw.png" /></figure><h3><strong>1.Super Keys</strong></h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*e9op2yRRLul1Mw-W6ZqSlQ.jpeg" /></figure><p>In database management systems (DBMS), a super key is a set of one or more attributes (columns) that can uniquely identify a tuple (row) in a relation (table). It is a broader concept than a primary key, as it allows for the inclusion of additional attributes beyond what is necessary for unique identification.</p><p>A super key guarantees uniqueness and can be used to identify a specific tuple within a relation. However, it may contain more attributes than necessary for this purpose. For example, in a &quot;Customers&quot; table, a super key could include attributes such as customer ID, name, and email address. While customer ID alone may be sufficient for unique identification, including additional attributes still forms a valid super key.</p><p>Super keys are important in database design as they help determine the minimal set of attributes required for unique identification, which is known as a candidate key. From the set of candidate keys, one is selected as the primary key for the relation. The primary key serves as the main identifier for tuples and is used for referencing and maintaining data integrity within the database.</p><h3>Characteristics of super keys</h3><blockquote>1. Uniqueness: A super key must guarantee uniqueness, meaning that no two tuples in a relation can have the same combination of attribute values.</blockquote><blockquote>2. Minimality: A super key should contain the minimum number of attributes required for unique identification. It should not include any redundant or unnecessary attributes.</blockquote><blockquote>3. Inclusion: A super key must include all attributes necessary for unique identification. It should not omit any attribute that is required to uniquely identify a tuple.</blockquote><blockquote>4. Flexibility: A super key can include additional attributes beyond what is necessary for unique identification. This allows for more flexibility in querying and retrieving data from the database.</blockquote><blockquote>5. Determination: A super key should be able to determine a specific tuple within a relation. This means that given the values of the attributes in a super key, it should be possible to uniquely identify and retrieve the corresponding tuple.</blockquote><h3><strong>2.Primary Keys</strong></h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*pG9e7s1K0ya4m0EkQwrUwg.jpeg" /></figure><p>In database management systems (DBMS), a primary key is a specific type of super key that is chosen to uniquely identify each tuple (row) within a relation (table). It is a crucial concept in database design and plays a vital role in ensuring data integrity and efficiency.</p><p>The primary key guarantees uniqueness, meaning that no two tuples in a relation can have the same combination of attribute values for the primary key. It must be unique for each tuple and cannot contain null values. Additionally, a primary key should be minimal, meaning it should contain the minimum number of attributes required for unique identification.</p><p>One of the main benefits of using a primary key is its ability to enforce entity integrity. By uniquely identifying each tuple, the primary key ensures that every record in the table represents a distinct entity or object. This helps maintain data consistency and accuracy, as it prevents duplicate or redundant data from being entered into the database.</p><p>Another advantage of using a primary key is its role in establishing referential integrity. When a primary key is referenced by foreign keys in other tables, it allows for the creation of relationships between tables. This ensures that data dependencies are maintained and that any changes or updates to the primary key are properly propagated throughout the database.</p><p>Additionally, a primary key provides optimization benefits. As the primary key uniquely identifies each tuple, it serves as an efficient means of locating and retrieving specific records. This improves query performance by allowing the DBMS to quickly narrow down the search to the desired tuples based on the primary key values.</p><p>In summary, a primary key in DBMS ensures uniqueness, enforces entity integrity, establishes referential integrity, and improves query performance. It is a crucial component of database design that helps maintain data integrity and efficiency.</p><h3>3.Candidate Keys</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*OPpuzIJMF9xr_oGpGxbERg.jpeg" /></figure><blockquote>In database management systems (DBMS), a candidate key refers to a set of attributes that can uniquely identify each tuple (row) in a relation (table). It is a minimal set of attributes that can uniquely identify a record in a table.</blockquote><p>Here are some key points about candidate keys:</p><p>1. Uniqueness: A candidate key must guarantee uniqueness, meaning that no two tuples can have the same combination of values for the candidate key attributes.</p><p>2. Minimality: A candidate key should be minimal, meaning that removing any attribute from the candidate key would result in losing the uniqueness property.</p><p>3. Multiple Candidate Keys: A relation can have multiple candidate keys, and each one can be used to uniquely identify tuples.</p><p><strong>Benefits of candidate keys in DBMS:</strong></p><p>1. Data Integrity: By enforcing candidate keys, DBMS ensures that each tuple in a table is uniquely identifiable. This prevents duplicate or inconsistent data from being inserted into the table.</p><p>2. Primary Key Selection: Candidate keys help in selecting the primary key for a table. The primary key is a chosen candidate key that will be used as the main identifier for the table and is often used as a reference in other tables.</p><p>3. Join Operations: Candidate keys are often used in join operations to combine data from multiple tables based on their common attributes. This allows for efficient and accurate retrieval of related information.</p><p>4. Indexing: Candidate keys are typically indexed by the DBMS, which improves the performance of search operations. Indexing allows for faster retrieval of data based on the values of the candidate key attributes.</p><p><em>Overall, candidate keys play a crucial role in maintaining data integrity, enabling efficient data retrieval, and ensuring accurate identification of tuples within a relational database.</em></p><h3><strong>4.Alternate Keys</strong></h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*3pZ0uH1AplABXPl9iszy-Q.jpeg" /></figure><blockquote>In database management systems (DBMS), an alternate key refers to a candidate key that is not selected as the primary key for a table. It is another set of attributes that can uniquely identify each tuple in a relation (table).</blockquote><p>Here are some key points about alternate keys:</p><p>1. Uniqueness: Like candidate keys, alternate keys must guarantee uniqueness, meaning that no two tuples can have the same combination of values for the alternate key attributes.</p><p>2. Minimality: Similar to candidate keys, alternate keys should also be minimal, meaning that removing any attribute from the alternate key would result in losing the uniqueness property.</p><p><strong>Benefits of alternate keys in DBMS:</strong></p><p>1. Flexibility: By having alternate keys, DBMS provides flexibility in choosing the primary key for a table. Sometimes, there may be multiple attributes or combinations of attributes that can uniquely identify tuples. Alternate keys allow for different options when selecting the primary key based on the specific requirements of the database.</p><p>2. Data Integrity: Alternate keys help in maintaining data integrity by ensuring that each tuple in a table is still uniquely identifiable, even if the primary key changes. This prevents duplicate or inconsistent data from being inserted into the table.</p><p>3. Query Optimization: Alternate keys can be used in query optimization to improve the performance of search operations. By having multiple keys, the DBMS can choose the most efficient key to use in a particular query, resulting in faster retrieval of data.</p><p>4. Foreign Key References: Alternate keys are often used as references in other tables as foreign keys. This allows for establishing relationships between tables based on the alternate key attributes, enabling efficient and accurate retrieval of related information.</p><blockquote>Overall, alternate keys provide flexibility in primary key selection, maintain data integrity, optimize query performance, and support relationships between tables in a relational database.</blockquote><h3><strong>5.Foreign key</strong></h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*-tEcuYTokvvDK6DaPC5gCQ.jpeg" /></figure><blockquote>In database management systems (DBMS), an alternate key is a candidate key that is not chosen as the primary key for a table. It is an additional set of attributes that can uniquely identify each tuple (row) in a relation (table). Here are some characteristics of alternate keys:</blockquote><p><strong>1. Uniqueness:</strong> Like candidate keys, alternate keys must ensure uniqueness. This means that no two tuples in the table can have the same combination of values for the attributes that form the alternate key.</p><p><strong>2. Minimality:</strong> Alternate keys should also be minimal, just like candidate keys. This means that removing any attribute from the alternate key would result in losing the uniqueness property. In other words, every attribute in the alternate key is necessary to maintain uniqueness.</p><p><strong>3. Non-Primary Key Status:</strong> The main characteristic of an alternate key is that it is not chosen as the primary key for the table. The primary key is the attribute or combination of attributes that uniquely identifies each tuple in the table. However, an alternate key can still uniquely identify tuples and serve as a reference in other tables as a foreign key.</p><p><strong>4. Flexibility:</strong> Alternate keys provide flexibility in choosing the primary key for a table. In some cases, there may be multiple attributes or combinations of attributes that can uniquely identify tuples. Alternate keys allow for different options when selecting the primary key based on the specific requirements of the database.</p><p><strong>5. Data Integrity:</strong> Alternate keys help maintain data integrity by ensuring that each tuple in the table is still uniquely identifiable, even if the primary key changes. This prevents duplicate or inconsistent data from being inserted into the table.</p><p><strong>6. Query Optimization:</strong> Alternate keys can be used in query optimization to improve the performance of search operations. By having multiple keys, the DBMS can choose the most efficient key to use in a particular query, resulting in faster retrieval of data.</p><p><strong>7. Foreign Key References:</strong> Alternate keys are often used as references in other tables as foreign keys. This allows for establishing relationships between tables based on the attributes that form the alternate key. It enables efficient and accurate retrieval of related information.</p><blockquote>In summary, alternate keys in DBMS provide flexibility in primary key selection, maintain data integrity, optimize query performance, and support relationships between tables in a relational database.</blockquote><h3>6.Composite key</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*M1RFYMSGgsSApqgF8mARfQ.jpeg" /></figure><blockquote>In database management systems (DBMS), a composite key is a key that consists of multiple attributes or columns. Unlike a simple or single attribute key, which uses only one attribute to uniquely identify each tuple in a table, a composite key combines two or more attributes to achieve uniqueness.</blockquote><blockquote>Here are some characteristics of composite keys:</blockquote><p>1. Uniqueness: Like any other key, a composite key must ensure uniqueness. This means that no two tuples in the table can have the same combination of values for all the attributes that form the composite key. The combination of values across all the attributes in the composite key must be unique.</p><p>2. Combination of Attributes: A composite key is formed by combining two or more attributes from the table. These attributes may have different data types and represent different aspects of the data. For example, in a table of employees, a composite key may consist of the attributes &quot;employee ID&quot; and &quot;department ID,&quot; combining both attributes to uniquely identify each employee.</p><p>3. Minimality: Similar to alternate keys and candidate keys, a composite key should also be minimal. This means that removing any attribute from the composite key would result in losing the uniqueness property. Every attribute included in the composite key is necessary to maintain uniqueness.</p><p>4. Primary Key Status: A composite key can be chosen as the primary key for a table if it satisfies the uniqueness and minimality requirements. The primary key is the attribute or combination of attributes that uniquely identifies each tuple in the table. If a composite key is selected as the primary key, it becomes the main identifier for the table.</p><p>5. Foreign Key References: Composite keys can also be used as references in other tables as foreign keys. This allows for establishing relationships between tables based on the combination of attributes that form the composite key. It enables efficient and accurate retrieval of related information.</p><p>6. Query Optimization: Composite keys can be used in query optimization to improve the performance of search operations. By having multiple attributes in the key, the DBMS can choose the most efficient combination of attributes to use in a particular query, resulting in faster retrieval of data.</p><p>7. Data Integrity: Composite keys help maintain data integrity by ensuring that each tuple in the table is still uniquely identifiable, even if the primary key changes. This prevents duplicate or inconsistent data from being inserted into the table.</p><blockquote>In summary, a composite key in DBMS is a key that consists of multiple attributes or columns. It provides uniqueness, combines attributes from the table, can be chosen as the primary key, supports foreign key references, aids in query optimization, and maintains data integrity.</blockquote><h3><strong>7.Unique key</strong></h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/483/1*fpJmd4rswzchau1efE2c5w.jpeg" /></figure><p>Unique keys are columns in a relational database table that uniquely identify items in the rows. This sounds a lot like a primary key, but the main difference is that unique keys can have NULL values. Their purpose is to prevent duplicate items in rows, but the items in the row also don’t need to have a value.</p><p>A unique key is a set of one or more than one fields/columns of a table that uniquely identify a record in a database table. You can say that it is little like primary key but it can accept only one null value and it cannot have duplicate values.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=1d8a1dde5072" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[The Evaluation Of BIG DATA…]]></title>
            <link>https://medium.com/@isharasrimal4/the-evaluation-of-big-data-b913e650adb0?source=rss-36454a9391d1------2</link>
            <guid isPermaLink="false">https://medium.com/p/b913e650adb0</guid>
            <dc:creator><![CDATA[Ishara Srimal]]></dc:creator>
            <pubDate>Sat, 26 Aug 2023 08:25:07 GMT</pubDate>
            <atom:updated>2023-08-26T08:26:15.779Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/800/1*g9uAlAN2exhuqJZXwsihlQ.jpeg" /></figure><h3>Big data refers to the vast amount of structured and unstructured data that is generated and collected by organizations on a daily basis. It includes data from various sources such as social media, sensors, machines, and transactional systems. Big data is characterized by its volume, velocity, and variety.</h3><h3>Volume</h3><p>Big data is generated in large volumes, often in terabytes or petabytes. This data can come from multiple sources and can be both structured (e.g., databases) and unstructured (e.g., text, images, videos).</p><h3><strong>Velocity</strong></h3><p>Big data is generated at high speeds and requires real-time or near real-time processing. For example, social media platforms generate a massive amount of data every second that needs to be processed quickly for meaningful insights.</p><h3>Variety</h3><p>Big data comes in various formats and types, including structured data (e.g., databases), semi-structured data (e.g., XML files), and unstructured data (e.g., emails, social media posts). It also includes different types of data such as text, images, audio, video, etc.</p><p>Big data is valuable because it holds potential insights and patterns that can help organizations make informed decisions, improve operations, identify trends, and gain a competitive advantage. However, analyzing and extracting meaningful insights from big data can be challenging due to its sheer volume, complexity, and variety. This is where advanced technologies like data analytics, machine learning, and artificial intelligence come into play to process and analyze big data efficiently.</p><h3>Big Data Challenges</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*jJGdd-1hwEAfFqaYDWaxOg.jpeg" /></figure><h3>knowledge Insufficient</h3><blockquote>Most of the companies don’t even know the basics of big data. They also don’t know the benefits of big data. If you don’t have a clear understanding, then your big data project will fail. Companies are wasting a lot of resources and time on technologies like big data. But, they don’t even know the basics of these new technologies. Most of your employees also don’t understand the true value of big data. Thus, they are not willing to change their existing processes. This can cause serious damage to your company process.</blockquote><h3>Difficult to manage data quality</h3><blockquote>Data integration is one of the biggest challenges that you need to overcome. Your software will collect data from various different sources. For example, it can collect data from call-centers, website logs, and social media. The data format of this data will differ. Hence, it is difficult to integrate all this data.</blockquote><blockquote>Also, the big data can’t guarantee 100% accuracy. You need to make sure that it is collecting only reliable data. Sometimes you can collect wrong or duplicate information. This type of data is not useful for your organization.</blockquote><blockquote>You can improve this by cleansing your data. First, you should work on creating a proper big data model. After that, you must focus on comparing your data with each other. If some record is already available, then you should merge both records. This will help you in increasing the accuracy of your big data model.</blockquote><h3>Security holes</h3><blockquote>Big data can open various security holes in your network. Most of the companies don’t care about security when they are launching their big data project. But, this is not a smart move. Big data is evolving with time. Still, it lacks many security features. You can deal with this by focusing more on security.</blockquote><h3>Upscaling</h3><blockquote>The most important feature of big data is that it grows with time. This is also the most serious challenge of dealing with big data. Most companies think that they can upscale their projects by increasing their storage capacity. They focus on increasing their computing power. But, it is still difficult to upscale without declining your system performance. Every company has a limited IT budget. Thus, you need to ensure that you are staying within your budget.</blockquote><blockquote>You should focus on having a decent architecture for your solution. This will help you in upscaling your project in the future. If your big data solution has good architecture, then you don’t need to worry about most of the challenges. Your algorithm should be designed by keeping the upscaling in mind.</blockquote><blockquote>You also need to do proper planning for your system support and maintenance. This will help you in dealing with the upscaling problem. Also, you should regularly check the performance of your system. This will help you in identifying weak spots in your system. Thus, you can address them on time.</blockquote><h3>Types of Big Data..</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/654/1*zCi8mZFIXKbSEA6oPH-pnw.png" /></figure><h4>Structured data</h4><blockquote>Structured data is highly system-wide, usually in written form, such as data in linked databases or data in Excel tables. For example, there is a database of a company carrying one million pieces of information for one hundred thousand of its customers.</blockquote><blockquote>Structured data contains each person’s name, phone number, and place of residence, job, and others.<br>These data are in a structured and organized way that you can easily search.</blockquote><h4>Unstructured data</h4><blockquote>Unstructured data is random and unordered. Examples include data on social media sites, whether written, such as Facebook, Twitter, and LinkedIn, or videos such as YouTube and images uploaded randomly on the Internet.</blockquote><h4>Semi-Structured data</h4><blockquote>Between structured data and unstructured data, there are also semi-structured data that carry some of the rankings and are not categorized by full randomness, and there are other conditions that can be defined by the data as big data besides size, speed, and diversity.</blockquote><h3>Conclusion</h3><p>Big Data’s influence on our world is undeniable. It has the potential to revolutionize industries, drive innovation, and address some of humanity’s most pressing challenges. However, realizing this potential requires a careful balance between harnessing the power of data and addressing ethical, privacy, and security concerns. As we navigate this data-driven era, it is essential to leverage Big Data responsibly, ensuring that its benefits are accessible to all while safeguarding the values we hold dear.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=b913e650adb0" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Database Management System vs. Relational Database Management System]]></title>
            <link>https://medium.com/@isharasrimal4/database-management-system-vs-relational-database-management-system-2504dbad5762?source=rss-36454a9391d1------2</link>
            <guid isPermaLink="false">https://medium.com/p/2504dbad5762</guid>
            <dc:creator><![CDATA[Ishara Srimal]]></dc:creator>
            <pubDate>Tue, 15 Aug 2023 20:24:51 GMT</pubDate>
            <atom:updated>2023-08-16T08:31:59.989Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/601/1*gh9cL8yeMih7Hmki24JZ6g.jpeg" /></figure><h3><strong>Introduction</strong></h3><blockquote>In the world of technology and data management, databases play a vital role in storing, organizing, and retrieving vast amounts of information. Over the years, two prominent types of database management systems have emerged: the traditional Database Management System (DBMS) and the more advanced Relational Database Management System (RDBMS). This essay aims to compare and contrast these two systems, highlighting their features, benefits, and limitations.</blockquote><h3>Database Management System</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/612/1*NrdMWoEk19N0SMcPB1ymUQ.jpeg" /></figure><blockquote><strong>A Database Management System (DBMS)</strong> refers to a software application that interacts with users, applications, and the database itself to capture, store, and manage data efficiently. It provides a structured framework for creating, accessing, and manipulating databases.</blockquote><h3>Key Features of DBMS:</h3><ul><li><strong><em>Data Independence:</em></strong> DBMS offers independence from physical storage structures, allowing users to focus on data retrieval and manipulation without worrying about underlying implementation details.</li><li><strong><em>Scalability:</em></strong> DBMS can handle large volumes of data and accommodate growth by providing mechanisms for adding more storage capacity.</li><li><strong><em>Security:</em></strong> DBMS provides security features such as access control, authentication, and encryption to protect sensitive data from unauthorized access.</li><li><strong><em>Data Integrity:</em></strong> DBMS ensures data integrity by enforcing constraints and validation rules, preventing inconsistent or incorrect data from being stored.</li><li><strong><em>Backup and Recovery:</em></strong> DBMS offers mechanisms to create regular backups of data and restore it in case of system failures or data loss.</li></ul><h3><strong>Advantages of DBMS:</strong></h3><ul><li><strong><em>Reduced data redundancy and improved data consistency:</em></strong> a DBMS eliminates data redundancy by not storing the same data in multiple locations, which means the data is consistent across all applications.</li><li><strong><em>Centralized access control:</em></strong> a DBMS provides centralized access and control over the database, ensuring that data is secure.</li><li><strong><em>Improved data integrity:</em></strong> a DBMS uses various techniques like validation and referential integrity to ensure data accuracy and consistency.</li><li><strong><em>Improved data sharing:</em></strong> with a DBMS, multiple users can simultaneously access the same data.</li></ul><h3>Disadvantages of DBMS:</h3><ul><li><strong><em>Complexity:</em></strong> modern DBMS systems can be complex and may require specialized knowledge to set up and maintain.</li><li><strong><em>Expensive:</em></strong> DBMS systems can be expensive to buy, set up, and maintain, particularly for large-scale systems.</li><li><strong><em>Increased hardware requirements:</em></strong> DBMS systems can require additional hardware resources to support their operations.</li></ul><h3>Relational Database Management System</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/500/1*2DUhCZFeIunIOmuP7TgiPw.jpeg" /></figure><p><strong>A Relational Database Management System (RDBMS)</strong> is a specialized type of DBMS that organizes data into tables with predefined relationships between them. It uses a structured query language (SQL) to interact with the database.</p><h3>Key Features of RDBMS:</h3><ul><li><strong><em>Tabular Structure:</em></strong> RDBMS stores data in tables with rows and columns, providing a clear representation of relationships between different entities.</li><li><strong><em>Data Integrity:</em></strong> RDBMS enforces referential integrity, ensuring that data relationships are maintained accurately and consistently.</li><li><strong><em>Flexible Queries:</em></strong> RDBMS allows users to retrieve and manipulate data using SQL, a powerful language that supports complex queries and operations.</li><li><strong><em>ACID Compliance:</em></strong> RDBMS follows the ACID (Atomicity, Consistency, Isolation, Durability) properties, ensuring reliable and transactional data processing.</li><li><strong><em>Data Normalization:</em></strong> RDBMS employs normalization techniques to eliminate data redundancy and maintain data consistency.</li></ul><h3><strong>Advantages of RDBMS:</strong></h3><ul><li><strong><em>Ad hoc query capability:</em></strong> An RDBMS facilitates flexible and powerful querying of data that allows users to make ad hoc queries and generate reports quickly.</li><li><strong><em>Data integrity:</em></strong> Data is accessed and updated in a structured and consistent manner, ensuring that the integrity and accuracy of the data are maintained.</li><li><strong><em>Reduced data redundancy:</em></strong> The normalization process eliminates data redundancies to reduce disk space usage.</li></ul><h3>Disadvantages of RDBMS:</h3><ul><li><strong><em>Lack of scalability:</em></strong> RDBMS may not be as scalable as other database models, which can lead to performance issues if the system grows beyond its original design.</li><li><strong><em>Complex design requirements:</em></strong> designing an RDBMS system can be complex and time-consuming, particularly for large-scale systems.</li><li><strong><em>Limited support for unstructured data:</em></strong> RDBMS systems work well with structured data but may not be as suitable for managing unstructured data that doesn’t fit well into a predefined schema.</li></ul><h3>Comparison and Contrast</h3><blockquote>While both DBMS and RDBMS serve the purpose of managing databases, they differ significantly in their approach and capabilities.</blockquote><h3>1.Data Organization:</h3><p><strong>DBMS:</strong> DBMS organizes data using various models like hierarchical, network, or object-oriented, allowing flexibility in data representation.</p><p><strong>RDBMS:</strong> RDBMS organizes data into structured tables, ensuring standardized relationships between entities.</p><h3><strong>2. Data Retrieval:</strong></h3><p><strong>DBMS:</strong> DBMS provides basic retrieval capabilities but lacks the advanced querying features offered by RDBMS.</p><p><strong>RDBMS:</strong> RDBMS enables complex queries using SQL, facilitating efficient data retrieval and manipulation.</p><h3><strong>3. Data Integrity:</strong></h3><p><strong>DBMS:</strong> DBMS relies on application-level constraints for data integrity, making it prone to inconsistencies and errors.</p><p><strong>RDBMS:</strong> RDBMS enforces referential integrity through primary key-foreign key relationships, ensuring consistent and accurate data.</p><h3><strong>4. Scalability:</strong></h3><p><strong>DBMS:</strong> DBMS may face scalability challenges when handling large volumes of data or accommodating growth.</p><p><strong>RDBMS:</strong> RDBMS offers better scalability options due to its structured and optimized storage mechanisms.</p><h3><strong>5. Data Normalization:</strong></h3><p><strong>DBMS:</strong> DBMS does not emphasize data normalization, leading to data redundancy and inconsistency.</p><p><strong>RDBMS:</strong> RDBMS follows normalization techniques to eliminate data redundancy and maintain consistency.</p><h3>Conclusion</h3><blockquote>In conclusion, both Database Management Systems (DBMS) and Relational Database Management Systems (RDBMS) serve the purpose of managing databases, but they differ significantly in their approach and capabilities. While DBMS provides flexibility and simplicity, RDBMS offers advanced querying capabilities, data integrity enforcement, scalability, and data normalization. The choice between the two depends on the specific requirements of the organization or application. Understanding the differences and benefits of each system is crucial for efficient data management and decision-making in today&#39;s data-driven world.</blockquote><h3>Questions about database management system Vs.Relational database management system</h3><ol><li><strong>How does data independence work in a DBMS? </strong>Data independence in a DBMS refers to the ability to modify the database schema without affecting the applications that use the database. It is achieved through the use of data abstraction layers.</li><li><strong>How does an RDBMS enforce data integrity? </strong>An RDBMS enforces data integrity through various mechanisms such as primary keys, foreign keys, unique constraints, check constraints, and triggers. These mechanisms ensure that data remains consistent and accurate.</li><li><strong>What is the purpose of SQL in an RDBMS? </strong>Structured Query Language (SQL) is used in an RDBMS to perform various operations such as creating and modifying database structures, querying and retrieving data, and manipulating data.</li><li><strong>How does an RDBMS handle complex queries and operations? </strong>An RDBMS handles complex queries and operations by optimizing query execution plans, utilizing indexes, and employing query optimization techniques such as join elimination, predicate pushdown, and subquery optimization.</li><li><strong>What are the ACID properties and why are they important in an RDBMS? </strong>ACID stands for Atomicity, Consistency, Isolation, and Durability. These properties ensure that database transactions are executed reliably, consistently, and with integrity. They are important in an RDBMS to maintain data integrity and reliability.</li><li><strong>How does normalization help in maintaining data consistency in an RDBMS? </strong>Normalization is the process of organizing data in a database to eliminate redundancy and dependency issues. It helps in maintaining data consistency by reducing data anomalies, ensuring data is stored only once, and minimizing update anomalies.</li><li><strong>What are some scalability challenges that a DBMS may face? </strong>Some scalability challenges that a DBMS may face include handling large volumes of data, supporting concurrent user access, maintaining performance as the database grows, and distributing data across multiple servers for load balancing.</li></ol><h4>These questions and answers provide a comprehensive overview of Database Management System (DBMS) and Relational Database Management System (RDBMS), covering their definitions, features, advantages, data integrity, querying capabilities, and scalability challenges.</h4><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=2504dbad5762" width="1" height="1" alt="">]]></content:encoded>
        </item>
    </channel>
</rss>