EXPRESSIONS FOR COMPLETELY AND PARTLY UNSUCCESSFUL BATCHED SEARCH OF SEQUENTIAL AND TREE-STRUCTURED FILES

MANOLOPOULOS, Y; KOLLIAS, JG

dc.contributor.author	MANOLOPOULOS, Y	en
dc.contributor.author	KOLLIAS, JG	en
dc.date.accessioned	2014-03-01T01:07:28Z
dc.date.available	2014-03-01T01:07:28Z
dc.date.issued	1989	en
dc.identifier.issn	0098-5589	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/10005
dc.subject	Indexing Terms	en
dc.subject	Performance Evaluation	en
dc.subject	Physical Database Design	en
dc.subject	Tree Structure	en
dc.subject.classification	Computer Science, Software Engineering	en
dc.subject.classification	Engineering, Electrical & Electronic	en
dc.title	EXPRESSIONS FOR COMPLETELY AND PARTLY UNSUCCESSFUL BATCHED SEARCH OF SEQUENTIAL AND TREE-STRUCTURED FILES	en
heal.type	journalArticle	en
heal.identifier.primary	10.1109/32.24732	en
heal.identifier.secondary	http://dx.doi.org/10.1109/32.24732	en
heal.language	English	en
heal.publicationDate	1989	en
heal.abstract	A number of previous studies derived expressions for batched searching of sequential and tree-structured files on the assumption that all the keys in the batch exist in the file, i.e., all the searches are successful. Formulas for batched searching of sequential and tree-structured files are derived, but the assumption made is that either all or part of the keys in	en
heal.publisher	IEEE COMPUTER SOC	en
heal.journalName	IEEE TRANSACTIONS ON SOFTWARE ENGINEERING	en
dc.identifier.doi	10.1109/32.24732	en
dc.identifier.isi	ISI:A1989U580800014	en
dc.identifier.volume	15	en
dc.identifier.issue	6	en
dc.identifier.spage	794	en
dc.identifier.epage	799	en