O Javie jutro nad Wisłą

Jeśli jeszcze nie macie planów na sobotę, może zajrzycie na nadwiślański j.Piknik? O 11:00 merytoryczną część imprezy rozpocznie Jakub Nabrdalik z TouK.

Jeśli jeszcze nie macie planów na sobotę, może zajrzycie na nadwiślański j.Piknik? O 11:00 merytoryczną część imprezy rozpocznie Jakub Nabrdalik z TouK.

Apocomito? Czyli jakie problemy rozwiązały mi DDD, CQRS, NoSQL, TDD i inni, a gdzie się kompletnie nie nadają – to temat wystąpienia Jakuba. Z pełną agendą imprezy można zapoznać się na stronie pikniku.  Oprócz uczty dla umysłu, nie zabraknie też strawy dla ciała.

I wykłady, i wspólne grillowanie odbędzie się w Temat Rzeka na plaży obok Mostu Poniatowskiego. Nie bójcie się deszczu, organizatorzy, czyli  Grupa Allegro i Fundacja PROIDEA, podobno zadbali o namioty:)

Wstęp na imprezę jest wolny.

You May Also Like

SortedSet + Joda DateTime == danger

It's been quite a long time since I wrote something on this blog... Two things occurred that made me do this. Firstly, I'm going to talk at Java Developer's Conference in Cairo and at Booster conference in Bergen next month, so I want to have some co...

Journal.IO 1.3 released

AboutJust a moment ago (in February 17th) Journal.IO 1.3 has been released. Journal.IO (https://github.com/sbtourist/Journal.IO) is a lightweight, zero-dependency journal storage implementation written in Java. We use it in our project for storing appl...AboutJust a moment ago (in February 17th) Journal.IO 1.3 has been released. Journal.IO (https://github.com/sbtourist/Journal.IO) is a lightweight, zero-dependency journal storage implementation written in Java. We use it in our project for storing appl...

Distributed scans with HBase

HBase is by design a columnar store, that is optimized for random reads. You just ask for a row using rowId as an identifier and you get your data instantaneously. Performing a scan on part or whole table is a completely different thing. First of all, it is sequential. Meaning it is rather slow, because it doesn't use all the RegionServers at the same time. It is implemented that way to realize the contract of Scan command - which has to return results sorted by key. So, how to do this efficiently?HBase is by design a columnar store, that is optimized for random reads. You just ask for a row using rowId as an identifier and you get your data instantaneously. Performing a scan on part or whole table is a completely different thing. First of all, it is sequential. Meaning it is rather slow, because it doesn't use all the RegionServers at the same time. It is implemented that way to realize the contract of Scan command - which has to return results sorted by key. So, how to do this efficiently?