{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:10:54Z","timestamp":1725664254708},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540603139"},{"type":"electronic","value":"9783540449133"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60313-1_152","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T18:16:27Z","timestamp":1330280187000},"page":"311-326","source":"Crossref","is-referenced-by-count":0,"title":["Optimized binary search and text retrieval"],"prefix":"10.1007","author":[{"given":"Eduardo Fernandes","family":"Barbosa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gonzalo","family":"Navarro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ricardo","family":"Baeza-Yates","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chris","family":"Perleberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nivio","family":"Ziviani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"A. Aggarwal, B. Alpern, K. Chandra and M. Snir. \u201cA Model for Hierarchical Memory\u201d, Proc. of the 19th Annual ACM Symp. of the Theory of Computing, New York, 1987, 305\u2013314.","DOI":"10.1145\/28395.28428"},{"key":"23_CR2","first-page":"11","volume-title":"Hierarchies of indices for text searching","author":"R. Baeza-Yates","year":"1994","unstructured":"R. Baeza-Yates, E.F. Barbosa and N. Ziviani. Hierarchies of indices for text searching. In Proceedings RIAO'94 Intelligent Multimedia Information Retrieval Systems and Management, pages 11\u201313. Rockefeller University, New York, Oct. 1994."},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"E. F. Barbosa and N. Ziviani. Data structures and access methods for read-only optical disks. In R. Baeza-Yates and U. Manber, editors, Computer Science: Research and Applications, pages 189\u2013207. Plenum Publishing Corp., 1992.","DOI":"10.1007\/978-1-4615-3422-8_18"},{"key":"23_CR4","unstructured":"G. H. Gonnet and R. Baeza-Yates. Handbook of Algorithms and Data Structures. Addison-Wesley, 1991."},{"key":"23_CR5","volume-title":"PAT 3.1: An Efficient Text Searching System. User's Manual","author":"G. H. Gonnet","year":"1987","unstructured":"G. H. Gonnet. PAT 3.1: An Efficient Text Searching System. User's Manual. Center for the New Oxford English Dictionary. University of Waterloo, Waterloo, Canada, 1987."},{"key":"23_CR6","unstructured":"J. L. Hennesy and D. A. Patterson. Computer Architecture. A Quantitative Approach. Morgan Kaufmann Publishers, Inc., 1990."},{"issue":"6","key":"23_CR7","doi-asserted-by":"publisher","first-page":"1203","DOI":"10.1137\/0217076","volume":"17","author":"W. J. Knight","year":"1988","unstructured":"W. J. Knight. Search in an Ordered Array having Variable Probe Cost. SIAM J. of Computing 17 (6), Dec. 1988, 1203\u20131214.","journal-title":"SIAM J. of Computing"},{"key":"23_CR8","volume-title":"The Art of Computer Programming: Sorting and Searching, volume 3","author":"D.E. Knuth","year":"1973","unstructured":"D.E. Knuth. The Art of Computer Programming: Sorting and Searching, volume 3. Addison-Wesley, Reading, Massachusetts, 1973."},{"key":"23_CR9","unstructured":"U. Manber and G. Myers. Suffix Arrays: A new method for on-line string searches. ACM-SIAM Symposium on Discrete Algorithms, pages 319\u2013327, Jan. 1990."},{"issue":"4","key":"23_CR10","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1145\/321479.321481","volume":"15","author":"D. R. Morrison","year":"1968","unstructured":"D. R. Morrison. PATRICIA \u2014 Practical Algorithm To Retrieve Information Coded in Alphanumeric. Journal of the ACM, 15(4):514\u2013534, 1968.","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA '95"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60313-1_152.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:37:05Z","timestamp":1619573825000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60313-1_152"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540603139","9783540449133"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-60313-1_152","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}