Re: After deserialization program occupies about 66% more RAM
Robert Klemme wrote:
On 19.09.2006 10:42, setar wrote:
User "Eric Sosman" wrote:
My program stores in RAM dictionary with about 100'000 words. This
dictionary occupies about 380MB of RAM. [...]
... thus using an average of 3800 bytes per word! What
are you storing: bit-map images of the printed text?
I not only store text of words but also many more information about them,
for example: translation to english, synonyms, hypernyms, hyponyms
(ontology) and language. For each mentioned elements (they are actually
phrases of words not single words) I also store phrase parsed to component
words with information about type of connection between words and phase text
generated by concatenating parsed words (it can be different).
I will try to decrease amount of memory used by one word (phase) but I
estimated that on average one word must occupy at least 700 bytes.
Except of these I have three indices to be able to search words.
Serialization blows up strings. You can see with the attached program
if used with a debugger (I tested with 1.4.2 and 1.5.0 with Eclipse).
You can see that (1) copies of strings do not share the char array any
more and (2) that the char array is larger than that of the original
even though only some characters are used (the latter is true for 1.4.2
only, so Sun actually has improved this).
Kind regards
robert
--------------000303000500040801080806
Content-Type: text/plain
Content-Disposition: inline;
filename="SharingTest.java"
X-Google-AttachSize: 1302
package serialization;
import java.io.ByteArrayInputStream;
import java.io.ByteArrayOutputStream;
import java.io.IOException;
import java.io.ObjectInputStream;
import java.io.ObjectOutputStream;
public class SharingTest {
/**
* @param args
* @throws IOException in case of error
* @throws ClassNotFoundException never
*/
public static void main( String[] args ) throws IOException, ClassNotFoundException {
String root = "foobar";
Object[] a1 = { root, root.substring( 3 ) };
Object[] a2 = { root, root.substring( 3 ) };
ByteArrayOutputStream byteOut = new ByteArrayOutputStream();
ObjectOutputStream objectOut = new ObjectOutputStream( byteOut );
objectOut.writeObject( a1 );
objectOut.writeObject( a2 );
objectOut.close();
ByteArrayInputStream byteIn = new ByteArrayInputStream( byteOut.toByteArray() );
ObjectInputStream objectIn = new ObjectInputStream( byteIn );
Object[] c1 = ( Object[] ) objectIn.readObject();
Object[] c2 = ( Object[] ) objectIn.readObject();
// breakpoint here
System.out.println( c1 == c2 );
for ( int i = 0; i < c1.length; ++i ) {
System.out.println( i + ": " + ( c1[i] == c2[i] ) );
}
}
}
--------------000303000500040801080806--
Changing the code to actually show the internal reference shows that
the deserialized version produces the same results as the one before
serialization.
import java.io.ByteArrayInputStream;
import java.io.ByteArrayOutputStream;
import java.io.IOException;
import java.io.ObjectInputStream;
import java.io.ObjectOutputStream;
public class SharingTest
{
/**
* @param args
* @throws IOException in case of error
* @throws ClassNotFoundException never
*/
public static void main(String[] args)
throws IOException, ClassNotFoundException
{
String root = "foobar";
String[] a1 = { root, root.substring(3)};
String[] a2 = { root, root.substring(3)};
System.out.println(a1 == a2);
for (int i = 0; i < a1.length; ++i)
{
System.out.println(i + ": " + (a1[i].intern() == a2[i].intern()));
}
ByteArrayOutputStream byteOut = new ByteArrayOutputStream();
ObjectOutputStream objectOut = new ObjectOutputStream(byteOut);
objectOut.writeObject(a1);
objectOut.writeObject(a2);
objectOut.close();
ByteArrayInputStream byteIn =
new ByteArrayInputStream(byteOut.toByteArray());
ObjectInputStream objectIn = new ObjectInputStream(byteIn);
String[] c1 = (String[])objectIn.readObject();
String[] c2 = (String[])objectIn.readObject();
System.out.println("-----------------------------------");
// breakpoint here
System.out.println(c1 == c2);
for (int i = 0; i < c1.length; ++i)
{
System.out.println(i + ": " + (c1[i].intern() == c2[i].intern()));
}
}
}