Skip Navigation

The Computer Journal 1980 23(1):37-40; doi:10.1093/comjnl/23.1.37
© 1980 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 arrowRequest Permissions
Google Scholar
Right arrow Articles by Zvegintzov, N.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Partial-match retrieval in an index sequential directory

N. Zvegintzov *

RT 2 Box 222, Rupert, West Virginia, USA

This paper describes an algorithm which, given an index sequential directory of keys, and given a set of partially specified templates, retrieves all keys in the directory that match one or more templates. It gives algorithms for the common special case where the keys are fixed length strings in lexicographic order. It discusses the origins, applications, and properties of these algorithms.

Received March 1978.

* RT 2 Box 222, Rupert, West Virginia 25984, USA


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.