zoukankan      html  css  js  c++  java
  • Java 最简单的批处理

    批处理Batch && PreparedStatement :

    import java.sql.*;
    
    public class TestBatch {
    	
    	public static void main(String[] args) throws ClassNotFoundException, SQLException
    	{
    		Class.forName("com.mysql.jdbc.Driver");
    		
    		Connection conn = DriverManager.getConnection
    		("jdbc:mysql://localhost/test","root","ZHEN"); 
    		
    		/*
    		Statement stmt = conn.createStatement();  //执行静态 SQL 语句并返回它所生成结果的对象。 
    		
    		stmt.addBatch("INSERT INTO student VALUES(30,'ddd',12,'ii')");
    		stmt.addBatch("INSERT INTO student VALUES(31,'ddd',12,'ii')");
    		stmt.addBatch("INSERT INTO student VALUES(32,'ddd',12,'ii')");
    		stmt.addBatch("INSERT INTO student VALUES(33,'ddd',12,'ii')");
    		
    		stmt.executeBatch();
    		
    		stmt.close();
    		
    		*/
    		
    		PreparedStatement pstmt = 
    			conn.prepareStatement("INSERT INTO student VALUES(?,?,?,?)");
    		
    		pstmt.setInt(1, 40);
    		pstmt.setString(2,"qq");
    		pstmt.setInt(3,5);
    		pstmt.setString(4,"ww");
    		pstmt.addBatch();
    		
    		pstmt.setInt(1, 41);
    		pstmt.setString(2,"qq");
    		pstmt.setInt(3,5);
    		pstmt.setString(4,"ww");
    		pstmt.addBatch();
    		
    		pstmt.setInt(1, 42);
    		pstmt.setString(2,"qq");
    		pstmt.setInt(3,5);
    		pstmt.setString(4,"ww");
    		pstmt.addBatch();
    		
    		pstmt.executeBatch();
    		pstmt.close();
    		
    		conn.close();
    		
    	}
    
    }
    

      

  • 相关阅读:
    poj 2100 尺取法 一个数字拆成连续数字平方和
    poj 1011 dfs+剪枝
    CF-242-C bfs+stl
    hdu 1297 递推
    poj 2104 划分树模板
    poj 3842 全排列+筛素数+暴力
    hdu 1421 经典dp
    hdu 1069 最长上升子序列变形
    hdu 3496 二维费用的01背包
    nyoj 16 最长上升子序列变形
  • 原文地址:https://www.cnblogs.com/sunxun/p/4701808.html
Copyright © 2011-2022 走看看