Relationships in salesforce ?

-
A relationship is a bi-directional association between two objects.

Types of relationship : -
  →  Master-Detail
  →  Lookup
  →  Many-to-Many

Master-Detail Relationship:
  • A tightly coupled relationship between Master Object and Child Object.
  • When a record of the master object is deleted, its related detail records are also deleted.
  • The master-detail relationship field is required on the page layout of the detail record.
Lookup Relationship :
  • A loosely coupled relationship between Master Object and Child Object.
  • If we delete the master record then child record will not be deleted.
  • 25 lookup relation relationships allowed per object.
Many-to-Many Relationship :
  • A many-to-many relationship allows each record of one object to be linked to multiple records from another object and vise versa.
  • To create a many-to-many relationship, simply create a custom junction object with two master-detail relationship fields, each linking to the objects you want to relate.
        A→C→B
        A1→C1→B1
        A2→C1→B2
        A3→C1→B3

Note :
  • A relationship is always defined on the child object. 
  • Rollup summary field always works with Master-Detail Relationship.
      A → Master Object. 
      B → Child Object
      
      If we want to create relationships between A and B then we will define the relationship on B. 

Example :


Comments

Post a Comment

Popular posts from this blog

How to Build REST API Using PHP

-
Image
Create REST API in PHP API stands for Application Programming Interface and the idea behind API is to connect different applications irrespective of their platforms to share information. Generally, API takes requests from different applications, processes it and gives back the response. What is REST API? REST stands for Representational State Transfer and it means that the request and the response should contain a representation of the information i.e., should be in a certain format. So basically, the requests must use proper HTTP methods and the response must be in a proper format like JSON or XML instead of plain text. REST API is nothing but a normal API with a set of principles. We need to follow a set of rules while creating and consuming REST API. The rules include the following : 1. Use appropriate HTTP methods while performing API calls. The following are the four primary HTTP methods which should be used to send and receive API requests.     ...
Read more

AVL Tree Rotations

-
Image
Rotations When the tree structure changes, we need to modify the tree to restore the AVL tree property. This can be done using single or double rotations. Types of Violations Let us assume the node that must be rebalanced in X. Violations might occur in four cases: Insertion into the left subtree of the left child of X. Insertion into the right subtree of the right child of X.  Insertion into the right subtree of the left child of X. Insertion into the left subtree of the right child of X. Single Rotation Left Left Rotation (LL Rotation) [Case 1]: Rotation does not have to be done at the root of a tree. In general, we start at the node inserted and travel up the tree, updating the balance information at every node on the path. public AVLTree rotateLeft (AVLTree x) {        AVLTree  y = x.right;        // Perform rotation            y.left = x;    ...
Read more

Disjoint Set (Union-Find)

-
A disjoint-set data structure is a data structure that keeps track of a set of elements partitioned into a number of non-overlapping subsets. Union-Find Algorithm is an algorithm which performs two operations: Find: Determine which subset a particular element is in. Union: Join two subsets into a single subset.   Source code in java import java.util.*; import java.lang.*; import java.io.*; class Graph { int V, E; // V-> no. of vertices & E->no.of edges Edge edge[]; // /collection of all edges class Edge { int src, dest; }; // Creates a graph with V vertices and E edges Graph(int v,int e) { V = v; E = e; edge = new Edge[E]; for (int i=0; i<e; ++i) edge[i] = new Edge(); } // A utility function to find the subset of an element i int find(int parent[], int i) { if (parent[i] == -1) return i; return find(parent, parent[i]); } // A uti...
Read more