Show HN: ACM SIGMOD Programming Contest – Optimistic Concurrency Control

http://db.in.tum.de/sigmod15contest/

by mtodat • 11 years ago

22 4 11 years ago

db.in.tum.de

mtodat• 11 years ago

This year's contest features a challenging task in the field of optimistic concurrency control for databases.

To spare you the boring parts we already provide working implementations in C++, Java, Go and Rust! Simply register, try our implementations, improve them, and work your way to the top of our leaderboard. The top-5 best-ranking undergrad or grad student teams are invited to the ACM SIGMOD 2015 conference in Melbourne, with the best one winning a $5,000 prize.

teraflop• 11 years ago

The title should probably be updated to say "ACM SIGMOD Programming Contest", to distinguish it from other contests like ICPC and ICFP.

sctb• 11 years ago

Thanks, we updated the title.

mkaufmann• 11 years ago

I would be interested why the go implementation is so much slower than the Java implementation. The algorithms behind both implementations seem to be exactly the same and both are garbage collection languages. There probably has to be a stupid performance mistake somewhere. I tested with the small dataset from the task page.

Show HN: ACM SIGMOD Programming Contest – Optimistic Concurrency Control

Related Stories