EFFECTIVENESS OF THE BINARY SEARCH METHOD IN DATABASE FILES IN THE CASE OF A GENERALIZED DISTRIBUTION OF PROBABILITIES OF ACCESS TO RECORDS.

Анотація

The article presents a formula for calculating the mathematical expectation of the number of comparisons needed to nd a record in a le in the case of generalized distribution of the probabilities of accessing records. We compare the eectiveness of the binary search method in the case of generalized distribution of probabilities of access to records and Zipf's law.