Skip to main content

Appian UUID vs ID


IDs in Appian:-

There are 2 kinds of IDs which are observed in Appian namely UUIDs and IDs. Let’s go through them briefly. 




Many of the functionalities are covered by Smart Services hence the explicit use of Ids are reduced or those can be done by relational database entries in some special cases.


Sources:
Appian Documentation
Appian Community

Labels

Labels:

Comments

Post a Comment

Popular posts from this blog

Solution Python QnA #1

Solution for Python QnA for November 14, 2018. # OUTPUT****************************************** >>> x = input () 12 >>> y = int ( input ( 'Please enter a number' )) Please enter a number45 >>> x + y Traceback (most recent call last): File "<stdin>" , line 1 , in < module > TypeError : must be str , not int >>> y + y 90 >>> x + x '1212' In this (x+y); addition of integer and string is not allowed. hence we get the TypeError.
Post a Comment
Read more

Swapping of variables

There are a couple of classical ways to do it. Let the variables be:- a = 5 b = 10 1. By using temporary variable "temp" (name as per your convenience). temp = a a = b b = temp 2. Without "temp" or any extra variable a = a + b   // 15 b = a - b   // b becomes 5 a = a - b   // a becomes 10 3. In Python like a Boss!! :D a, b = b, a
Post a Comment
Read more

Picking the structure!!

Use of arrays, rather sorted arrays or a linked list is somewhat difficult because both have their pros and cons.  Arrays excel when we have to perform a binary search while it’s faster to add and remove elements from linked lists.  A tree is one structure where there is ONLY ONE path to reach to a node. This can be explained further as “Nodes cannot be in closed loop” . Also there is a hierarchical relationship of parent and child. The average complexity varies from logarithmic to linear time. Now coming further to a data structure BSTs aka Binary Search Trees . Points to be remembered here:- Maximum two children. Left child is smaller than parent. Right one is greater than parent. Traversals :-   In order Traversal Ascending Sort; left subtree + root+ right subtree. So the above tree will look like:  4, 12, 16, 25, 28, 32 Pre order Traversal Root + left subtree + right subtree recursively. Eg: 25, 12, 4, 16, 32, 28 Po...
Post a Comment
Read more