Tue Nov 2 01:40:37 PST 2004
- Previous message: [Slony1-general] redundant setval calls
- Next message: [Slony1-general] redundant setval calls
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
On Monday November 1 2004 11:38, Andrew Sullivan wrote: > On Mon, Nov 01, 2004 at 12:05:18PM -0600, Ed L. wrote: > > > It could impose a pretty severe memory footprint with a lot of > > > sequences, though. > > > > By my rough guess, it will take around 128 bytes to store all data for > > a sequence along with a few data structure pointers. > > Well, if you can do it in 128 bytes, that's a different story. How > do you calculate that, though? I'd be interested to know. I just looked at the columns of a sequence relation, figured 8 bytes for each of the 5 bigints (40 bytes), 64 bytes for the name, 2 bytes for the booleans, for ~106 bytes + pointers. Probably not exact, but close. Ed
- Previous message: [Slony1-general] redundant setval calls
- Next message: [Slony1-general] redundant setval calls
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
More information about the Slony1-general mailing list