CSV to SQL import

CSV to SQL import

Link : https://tinyurl.com/csv-sql-import


What is this app all about ?

This app allows users to import a .csv file and save it in MySQL. The .csv file needs to be in a specified format, something like  this .
Once the data is saved we can see and delete the table data on the front-end.

Whats there on back-end and front-end ?

  • Back-End :
    • NodeJS
    • ExpressJS
    • MySQL
  • Front-End :
    • ReactJS
    Here is the table structure :

    Field           Type
    ---------------------------
    id         int(11)
    level_col varchar(255)
    cvss         varchar(255)
    title         varchar(255)
    vulnerability varchar(255)
    solution varchar(255)
    reference_col varchar(255)

    Where is it deployed ?

    Client side app ( React app ) is deployed on Netlify

    Server side app ( Node app ) is deployed on Heroku

    MySQL database is deployed on Remote Mysql


    How to run it locally ?

    To run it locally we need to clone two git repositories, one for the server and other for the client ( front-end).

    To clone the client repo :
    git clone https://github.com/krishankantray/csv-to-sql-import-client.git 

    To clone the server repo :
    git clone https://github.com/krishankantray/csv-to-sql-import-server.git

    The above git setup is for online server auto deployment on Heroku and Netlify.
    We need to make some changes in it to run it locally.

    First we setup the server locally  :
    • Open the directory : csv-to-sql-import-server ,  in any vscode or any other editor.
    • If you have a local MySql db then do replace the details in the app>>config>>db.config.js
    If you don't have a local MySql db then leave it as it is.  

    Now, open terminal ( in the directory - csv-to-sql-import-server ),
    • npm install
    • npm start
    It should print in terminal : Server is running on port 9000.
    ( Make sure there is nothing previously running on port 9000, if there is then change the port from line 25 of server.js )

    To test if all APIs are working, open postman and use following APIs
    • GET call for obtaining all the records

    • GET call for single records by id
    Similarly other calls , 

    • POST call for bulk create records  : http://localhost:9000/bulkcreate This call needs a body to be passed
    • POST call for single create records  http://localhost:9000/customers This call needs a body to be passed
    • DELETE call for all records deletion   http://localhost:9000/customers 
    • DELETE call for records deletion   http://localhost:9000/customers/963 
    • PUT call to update a single record http://localhost:9000/customers/963

    Now, we will configure the local front-end ( React app ) :
      We only need to make some changes in App.js within src directory. 

      Just change the line 35, 69 and 97, i.e we need to change the URL of all the fetch calls from Apps.js.

      35 : Before  https://csv-to-sql-import.herokuapp.com/bulkcreate
      35 : After     http:localhost:9000/bulkcreate 

      Similarly for line 69 and 97, just replace this part of URL - 
      https://csv-to-sql-import.herokuapp.com
      with 
      http:localhost:9000
      and rest of the part of url remains same. 

      Now, its time to run the app

      Goto the folder csv-to-sql-import-client in terminal 
      • npm install 
      • npm start
      It should automatically start in browser, wait for few seconds and if it doesn't loads then open it manually - http://localhost:3000/ 

      Now, the app is running locally. 

      Comments

      Post a Comment

      Popular posts from this blog

      HackerRank Problem : Reverse and capitalise first alphabet of each word.

        Problem : ( Link : Click here to visit this problem on HackerRank. ) Reverse the words in a string and capitalize the first letter of each reversed word, preserving the capitalization in the original stri. For eg: "Hello World" would be transformed to "OlleH DlroW". Input : The first line of input would be the number of test cases followed by each string in a line. Output : Output should be the string with each word reversed and first letter of each reversed word capitalized. Each output string should be printed to a new line.   Sample Input Sample Output 1 Hello World OlleH DlroW ------------------------------------------------------------------------------------------------------------------------------------------------------------------------ Solution : ( in C++ ) #include   <iostream> #include   <string> #include   <algorithm> #include   <cctype> using   namespace std ...
      Keep reading

      CodeChef : Breaking Bricks || Problem Code: BRKBKS

      CodeChef : https://www.codechef.com/JAN20B/problems/BRKBKS Problem: For her next karate demonstration, Ada will break some bricks. Ada stacked three bricks on top of each other. Initially, their widths (from top to bottom) are W1,W2,W3. Ada's strength is S. Whenever she hits a stack of bricks, consider the largest k≥0 such that the sum of widths of the topmost k bricks does not exceed S; the topmost k bricks break and are removed from the stack. Before each hit, Ada may also decide to reverse the current stack of bricks, with no cost. Find the minimum number of hits Ada needs in order to break all bricks if she performs the reversals optimally. You are not required to minimise the number of reversals. Input The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows. The first and only line of each test case contains four space-separated integers S, W1, W2 and W3. Output For each test case, pri...
      Keep reading

      LeetCode: 169 Majority Element

      LEETCODE : 169. Majority Element Link :  https://leetcode.com/problems/majority-element/ Problem Description :  Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times. You may assume that the array is non-empty and the majority element always exist in the array. For example: Example 1: Input: [3,2,3] Output: 3   Example 2: Input: [2,2,1,1,1,2,2] Output: 2       ______________________________________________________________________________     Explaination :  There is pretty easy way to solve it by using count of every element and then returning the element which has count greater than n/2 . But this solution comes with a cost of O(n) time and O(n) space.  There is a better solution which can do the job in O(n) time and O(1) space. Atleast we are saving some of the space.  How does our space efficient algor...
      Keep reading