Using XML processing typically simplifies a developer’s job–but not when you’re programming in c++. Ever wish someone would create the C++ equivalent of XMLBeans? Someone has. Find out how this new open-source tool fills a serious gap in the C++ software environment.
You May Also Like
SoapUI ext libs and its weirdness
- byMarcin Cylke
- November 2, 2011
Suppose you want to add some additional jars to your SoapUI installation. It all should work ok if…
micro-burn has Trello integration
- byArek Burdach
- February 22, 2015
After a few long evenings I've finally integrated micro-burn with Trello. All you need to run it for your Trello board is to write short configuration and run fat jar. It renders burndown chart visualising progress of cards on your board.You can specif...After a few long evenings I've finally integrated micro-burn with Trello. All you need to run it for your Trello board is to write short configuration and run fat jar. It renders burndown chart visualising progress of cards on your board.
Distributed scans with HBase
- byMarcin Cylke
- December 10, 2013
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?