Skip Navigation

The Computer Journal 1986 29(4):368-372; doi:10.1093/comjnl/29.4.368
© 1986 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 Manolopoulos, Y.
Right arrow Articles by Hatzopoulos, M.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Sequential vs. Binary Batched Searching

Y. Manolopoulos1, J. G. Kollias2 * and M. Hatzopoulos3

1 Department of Electrical Engineering, University of Thessaloniki, Thessaloniki, Greece, 2 Department of Electrical Engineering, Division of Computer Science, National Technical University of Athens, 9 Heroon Polytechniov Avenue, 157 73 Zagraphov, Athens, Greece, 3 Department of Mathematics, University of Athens, Athens, Greece

This study considers an ordered array of N keys and estimates the required number of key comparisons to locate M requested keys when a binary search is performed to find each key. The problem is analysed for the cases where the M requests (a) are performed individually on a First Come First Served basis, and (b) are treated as a batch. For the second case a break point is established which indicates whether it is preferable to apply binary or sequential search for a batch of M keys.

Received September 1984.

* Department of Electrical Engineering, University of Thessaloniki, Thessaloniki, Greece

§ Department of Electrical Engineering, Division of Computer Science, National Technical University of Athens, 9 Heroon Polytechniov Avenue, 157 73 Zagraphov, Athens, Greece

Department of Mathematics, University of Athens, Greece

{ddagger} This work is part of KRINO, a project aiming at improving software technology in Greece.


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.