![]() |

In the immortal words of Anonymous, "You can lead a horse to water but you can't make him drink." Still, regarding the lack of feedback and therefore apparent general lack of understanding, Nels Anderson suggested that maybe I wasn't presenting the FSX and MFT issues in the right way.
I now agree. I therefore thought very hard about how to simplify the main Musings #4 discussion points, and here's what I came up with. Oversimplifying for the sake of clarity ...
The catalog cards are organized alphabetically by the titles of the books. (There was also a separate catalog which listed the books by subject, but we'll ignore that one.) Given the name of the book you're after you can do a very efficient catalog search. Assuming the catalog cards to be in alphabetical order, start in the middle of the catalog and look at that card. If the name on the card is lower in the alphabet than the name of your book of interest, go to the upper half of the catalog and look at the card which is in the middle of the upper half. And so on.
Every time you look at a catalog card you might need to go lower in the alphabet, or higher, but at each step you will be narrowing the search significantly, and you will soon arrive at the card which exactly matches the name you are looking for. This kind of search is called a "binary search", and it is the fastest possible kind of search through indexes.
But let's say that the card catalog is not organized alphabetically. In fact, let's assume that the cards are in random order, just as your MFT would be in random order absent the UD or O&OD name sort. In this situation you can still locate a book, but to do so you must begin at the front of the catalog and look at every card in sequence until you happen upon the card of interest. We'll call this a "linear search".
Linear searches are slow. In fact, if you think about it, on average you would have to go through half the cards in the catalog to get to a book with a randomly chosen name. That's why the catalog/MFT name sort is so important to FSX performance. When scenery indexes and scenery files are to be loaded, a name sort allows the file manager to do fast binary searches instead of slow linear searches.
Now ... The "MFT adjacency" feature of UD does not affect either the catalog contents or the books' tables of contents. Rather, it has to do with how far you must walk from the catalog drawers (the MFT) to the bookshelves (where the folders are).
Each catalog card contains a unique Dewey Decimal Number which you can think of as a pointer into the bookshelves (the on-disk file structures). Such DDN pointers are entirely equivalent to the contents of MFT entries.
Mike McCarthy
Discuss This
in our Outer Marker (Feedback) Forum.
xxmikexx@qwest.net