Patent ID: 7117434

Claim:
A computer implemented method of navigating data blocks, comprising: opening a first data block of a plurality of data blocks of interest, said plurality of data blocks being spatially indexed in N dimensions; viewing a closeness relationship between said first data block opened and a second plurality of data blocks based on their content; accessing a second data block of said second plurality of data blocks which is viewed to be closest to said first data block; and spatially indexing a collection of data blocks using a collection of text strings 1 to N as a search criteria, wherein said spatially indexing includes: determining whether an index record i is less than a number M of blocks in the database and if so setting a number j to 0; determining whether j is less than the number N of keywords in a search corpus, and if so, calculating a search result Rj as a number of occurrences of word Wj in the data block B(i); storing the search result Rj in an index of block B(i); and incrementing j by “1” and determining whether j is less than N.