{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T06:07:16Z","timestamp":1761718036411,"version":"build-2065373602"},"reference-count":4,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2007,3,22]],"date-time":"2007-03-22T00:00:00Z","timestamp":1174521600000},"content-version":"vor","delay-in-days":12743,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Am. Soc. Inf. Sci."],"published-print":{"date-parts":[[1972,5]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Files are frequently organized into records, and keys are associated with those records. A directory is a list of key\u2010address pairs, where each pair consists of a key and an address associated with that key. The addresses may be those of records in the file, or of intermediate data, such as inverted lists. A fundamental problem is searching a directory efficiently for known keys, in order to find all addresses associated with those keys. Several problems of finding keys in directories are considered. Methods of searching both ordered and unordered directories are analyzed; directories are classified as they organize unused space: compacted, distributed, or chained. Searching on ranges of key values, rather than exact key matching, is also considered. Finally, design tradeoffs among the classes of directory and searching strategies are developed.<\/jats:p>","DOI":"10.1002\/asi.4630230302","type":"journal-article","created":{"date-parts":[[2007,6,27]],"date-time":"2007-06-27T15:53:04Z","timestamp":1182959584000},"page":"143-149","source":"Crossref","is-referenced-by-count":2,"title":["Analysis of directory searching"],"prefix":"10.1002","volume":"23","author":[{"given":"Thomas C.","family":"Lowe","sequence":"first","affiliation":[]},{"given":"David C.","family":"Roberts","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2007,3,22]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/362663.362752"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/362851.362882"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/321479.321482"},{"key":"e_1_2_1_5_2","first-page":"131","volume-title":"Information Retrieval\u2014a Critical View","author":"Raver N.","year":"1967"}],"container-title":["Journal of the American Society for Information Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fasi.4630230302","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/asistdl.onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/asi.4630230302","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T12:35:41Z","timestamp":1759926941000},"score":1,"resource":{"primary":{"URL":"https:\/\/asistdl.onlinelibrary.wiley.com\/doi\/10.1002\/asi.4630230302"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1972,5]]},"references-count":4,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1972,5]]}},"alternative-id":["10.1002\/asi.4630230302"],"URL":"https:\/\/doi.org\/10.1002\/asi.4630230302","archive":["Portico"],"relation":{},"ISSN":["0002-8231","1097-4571"],"issn-type":[{"type":"print","value":"0002-8231"},{"type":"electronic","value":"1097-4571"}],"subject":[],"published":{"date-parts":[[1972,5]]}}}