1. A computerized method for representing the connectivity of Web pages, the Web pages including links between the Web pages, the links and Web pages being identified by names, comprising: sorting the names of the Web pages in a memory; delta encoding the sorted names while periodically storing full names as checkpoints in the memory, each delta encoded name and checkpoint having an assigned unique identification; twice sorting a list of pairs of identifications that represent the links between the Web page, each pair of identifications including a first identification and a second identification, first according to the first identification of each pair to produce an inlist, and second according to the second identification of each pair to produce an outlist; storing an array of elements in the memory, there being one array element for each Web page, each element including a first pointer to one of the checkpoints, a second pointer to an associated inlist of the Web page, and a third pointer to an associated outlist of the Web page; and indexing the array by a particular identification to locate connected Web pages.
2. The method of claim 1 wherein the names are uniform resource locators of the Web pages, and the uniform resource locators are sorted lexicographically.