Skip Navigation

The Computer Journal 1987 30(6):565-568; doi:10.1093/comjnl/30.6.565
© 1987 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 Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Manolopoulos, Y. P.
Right arrow Articles by Burton, F. W.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Batched Interpolation Search

Y. P. Manolopoulos{dagger} {dagger}, J. (Y.) G. Kollias *{ddagger} and F. Warren Burton§

{dagger} University of Thessaloniki, Department of Electrical Engineering, Division of Electronics and Computers, 54006 Thessaloniki, Greece
{ddagger} National Technical University of Athens, Department of Electrical Engineering, Division of Computer Science, 15773 Athens, Greece
§ University of Colorado at Denver, Department of Electrical Engineering and Computer Science, Denver, Colorado 80202, U.S.A.

Received 1 December 1985; In a previous study an ordered array of N keys was considered and the problem of locating a batch of M requested keys was investigated by assuming both batched sequential and batched binary searching. This paper introduces the idea of batched interpolation search, and two variations of the method are presented. Comparisons with the two previously defined methods are also made.

{dagger} This material is based upon work supported by the National Science Foundation under Grant no. ECS-8312748. Now at: Department of Computer Science, University of Utah, Salt Lake City, Utah 84112, U.S.A.

* To whom correspondence should be addressed.


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.