Tuesday 3 July 2012

The cloud computing "state of the nation" in one paragraph

In basic terms, we have a multiplicity of application controls, data transport vectors and network gateways to deal with in a global cloud computing environment that is barely sure enough of itself to settle upon one single agreed set of open architectural standards.

Friday 20 April 2012

Hi there -- thanks for the InfoSec invite, I recieved over 250 emails and 30 phone calls so it's been pretty horrendous. Not one single PR person (OK, there was one - Maxine Ambrose) bothered to pitch me with this kind of style as follows: Dear Adrian - as I know that you specifically cover software application development tools, methodologies and components on your journalistic "beat"… and that you are also very focused on open source technology and application transformation and data management technologies at a deep level down to the command line --- I have read your blogs and taken on board what your editorial remit is before I have decided to pitch you with an opportunity to meet my client at InfoSec. NO -- quite the opposite. 249 pitches have just said -- come and meet my client please. As such, I am still deleting most emails if PR people have not gone the extra mile and tried to tie in vendor themes with current journalistic needs. Simply dropping in the terms "cloud", "virtualised", "customer references" and/or "we'd love to meet you" doesn't cut it -- sorry. I am completely booked up on Tuesday morning. Weds pm I may go in but will have to go to the sister ITSM show. Thursday is still open at this stage but that is a very long way away just now. Ma'a salaama

Tuesday 3 January 2012

B-tree data structures

NOTE: B-tree data structures themselves allow searching of data to be performed with support for sequential access as well as insertions or deletions that may be being performed in logarithmic time. B-trees have roots at the top and leaves (or nodes) at the bottom.

Geekinterview.com defines B-tree as follows: “B-Tree is an indexing technique most commonly used in databases and file systems where pointers to data are placed in a balance tree structure so that all references to any data can be accessed in an equal time frame. It is also a tree data structure, which keeps data sorted so that searching, inserting and deleting can be done in logarithmic amortized time. ”