java中的堆空间增加_在Eclipse中增加堆空间:(java.lang.OutOfMemoryError)

try {

// CompareRecord record = new CompareRecord();

Connection conn = new CompareRecord().getConection("eliteddaprd","eliteddaprd","192.168.14.104","1521");

ResultSet res = null;

if (conn != null){

Statement stmt = conn.createStatement();

res = stmt.executeQuery("select rowindx,ADDRLINE1 from dedupinitial order by rowindx");

}

Map adddressMap = new LinkedHashMap();

if (res != null){

System.out.println("result set is not null ");

while(res.next()){

adddressMap.put(res.getInt(1),res.getString(2));

}

}

System.out.println("address Map size =========> "+adddressMap.size());

Iterator it = adddressMap.entrySet().iterator();

int count = 0;

int min = 0;

while (it.hasNext()){

Map.Entry pairs = (Map.Entry)it.next();

Pattern p = Pattern.compile("[,\\s]+");

Integer outerkey = (Integer)pairs.getKey();

String outerValue = (String)pairs.getValue();

//System.out.println("outer Value ======> "+outerValue);

String[] outerresult = p.split(outerValue);

Map.Entry pairs2 = null;

count++;

List dupList = new ArrayList();

Iterator innerit = adddressMap.entrySet().iterator();

boolean first = true;

while (innerit.hasNext()){

//System.out.println("count value ===> "+count);

int totmatch = 0;

if(first){

if(count == adddressMap.size()){

break;

}

for(int i=0;i<=count;i++){

pairs2 = (Map.Entry)innerit.next();

}

first = false;

}

else{

pairs2 = (Map.Entry)innerit.next();

}

Integer innterKey = (Integer)pairs2.getKey();

String innerValue = (String)pairs2.getValue();

//System.out.println("innrer value "+innerValue);

String[] innerresult = p.split(innerValue);

for(int j=0;j

for(int k=0;k

if(outerresult[j].equalsIgnoreCase(innerresult[k])){

//System.out.println(outerresult[j]+" Match With "+innerresult[k]);

totmatch++;

break;

}

}

}

min = Math.min(outerresult.length, innerresult.length);

if(min != 0 && ((totmatch*100)/min) > 50) {

//System.out.println("maching inner key =========> "+innterKey);

dupList.add(innterKey);

}

}

//System.out.println("Duplilcate List Sisze ===================> "+dupList.size()+" "+outerkey);

}

System.out.println("End =========> "+new Date());

}

catch (Exception e) {

e.printStackTrace();

}

在这里ResultSet已经处理了大约500000条记录,但是它将给我类似以下错误:

Exception in thread "main" java.lang.OutOfMemoryError: Java heap space

at java.util.HashMap.resize(HashMap.java:508)

at java.util.LinkedHashMap.addEntry(LinkedHashMap.java:406)

at java.util.HashMap.put(HashMap.java:431)

at spite.CompareRecord.main(CompareRecord.java:91)

我知道此错误是由于VM内存引起的,但不知道如何在Eclipse中增加它?

如果我必须处理超过500,000条记录,该怎么办?

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值