Contact us

 

Comments

Post a Comment

Popular posts from this blog

Difference between Delete and Truncate in oracle sql.

Image
 " Most important question asked in an interview" Introduction: Delete and Truncate is used to remove the data from the relational table. SQL developer have to decide where to use these both concepts. By understanding the concept, it is useful for handling the data. Well analysis of all the rows to be deleted before using truncate command. Difference: Delete Truncate It is a Data Manipulation Language command. It is a Data Definition Language command. Syntax: Delete from tablename where condition; Delete from tablename; Syntax: Truncate table tablename; Delete command is slower than truncate. Truncate command is faster. Delete contain the where clause. Truncate don’t contain the where clause. It is used to remove or delete the specified row or tuple from the table using where clause. In absence of where clause, it is used to dele...
Read more

Monolithic vs microservices java application

 Introduction: Both monolithic and microservice are representing different approaches and architectures to build the particular java applications. In the development work, there is the main difference between them raises the few below questions.  How the application components are grouped and deployed?.   How the components are organized and released?. How the parts of the application are getting structured and deployed? How the modules are combined and get delivered? How the system components are getting arranged and get deployed?
Read more

What is hash join in oracle with example?SQL PLSQL

Image
  INTRODUCTION: It is the join strategy where the one table data is loaded into the hash table for an efficient lookup. Other table data is scanned to match with the hash table which is suitable for the large datasets. Database optimizer uses the two of the smaller tables to build the hash table into the memory. Its function is used to map join key values to the hash table locations. Larger table is also scanned for each row. It's fast and efficient for quick matching of rows which is based on the join condition. It is an effective when one or both of the tables are large and cannot fit in the memory. It is also effective when the join condition is an equally predicate i.e. table1.column=table2.column. It's cost is limited to the single read pass which is over the two data sets. It is situated in the PGA and the rows are accessed without latching. It will reduce I/O by preventing the necessity of repeatedly latching and reading blocks in the database buffer cache. If the data s...
Read more