Skip Navigation

The Computer Journal 1985 28(3):309-312; doi:10.1093/comjnl/28.3.309
© 1985 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (6)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Samson, W. B.
Right arrow Articles by Bendell, A.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Rank Order Distributions and Secondary Key Indexing

W. B. Samson * and A. Bendell *

Dundee College of Technology, Bell Street, Dundee, UK

The performance of a secondary index depends greatly upon the distribution of secondary key values, especially when these are not unique. The nature of these distributions is discussed and a model for the minimum indexing time is proposed. Normally, at the time the database is designed, little is known about the nature of the data to be stored. A technique is described for modelling the underlying distribution of a secondary key population, based on a small sample from that population. Alternative indexing strategies may be compared on the basis of this model distribution at an early stage of design. Possible strategies for improving indexing performance are discussed.



* Dundee College of Technology, Bell Street, DUNDEE, DD1 1HG


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.