Hi to all. I'd like to benchmark PG. I'd like to compare sorting performances (time spent, #of disk accesses, # of run produced etc) of the present Replacement Selection (external sorting) algorithm and of a refinement I'm going to implement. I'm new on PG, I just had the idea of how to possibly get better that algorithm and choosed to test it on PG since it's an open-source DBMS. I've been searching the web for a benchmark. I suppose TPC-H and Wisconsin could fit, but had problems when trying to use them. Any suggestion on a "good benchmark"? Any tutorial on how to use them? Thanks for your time. Regards. Manolo. _________________________________________________________________ Express yourself instantly with MSN Messenger! Download today it's FREE! http://messenger.msn.click-url.com/go/onm00200471ave/direct/01/ ---------------------------(end of broadcast)--------------------------- TIP 6: explain analyze is your friend
