Batched interpolation search

Manolopoulos, YP; Kollias, J(G; Burton, FW

dc.contributor.author	Manolopoulos, YP	en
dc.contributor.author	Kollias, J(G	en
dc.contributor.author	Burton, FW	en
dc.date.accessioned	2014-03-01T01:06:47Z
dc.date.available	2014-03-01T01:06:47Z
dc.date.issued	1987	en
dc.identifier.issn	0010-4620	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/9610
dc.subject.classification	Computer Science, Hardware & Architecture	en
dc.subject.classification	Computer Science, Information Systems	en
dc.subject.classification	Computer Science, Software Engineering	en
dc.title	Batched interpolation search	en
heal.type	journalArticle	en
heal.identifier.primary	10.1093/comjnl/30.6.565	en
heal.identifier.secondary	http://dx.doi.org/10.1093/comjnl/30.6.565	en
heal.language	English	en
heal.publicationDate	1987	en
heal.abstract	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. © 1987 The British Computer Society.	en
heal.publisher	CAMBRIDGE UNIV PRESS	en
heal.journalName	Computer Journal	en
dc.identifier.doi	10.1093/comjnl/30.6.565	en
dc.identifier.isi	ISI:A1987L316600013	en
dc.identifier.volume	30	en
dc.identifier.issue	6	en
dc.identifier.spage	565	en
dc.identifier.epage	568	en