{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,5]],"date-time":"2024-05-05T02:36:17Z","timestamp":1714876577648},"reference-count":33,"publisher":"Elsevier","isbn-type":[{"value":"9780080408064","type":"print"}],"license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1016\/b978-0-08-040806-4.50038-1","type":"book-chapter","created":{"date-parts":[[2014,7,1]],"date-time":"2014-07-01T13:15:21Z","timestamp":1404220521000},"page":"513-532","source":"Crossref","is-referenced-by-count":0,"title":["ENHANCING DATA RETRIEVAL USING ARTIFICIALLY SYNTHESIZED QUERIES"],"prefix":"10.1016","author":[{"given":"B.J.","family":"Oommen","sequence":"first","affiliation":[]},{"given":"D.T.H.","family":"Ng","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/B978-0-08-040806-4.50038-1_bib1","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1145\/322092.322094","article-title":"Self-organizing binary search trees","volume":"25","author":"Allen","year":"1978","journal-title":"J.ACM"},{"key":"10.1016\/B978-0-08-040806-4.50038-1_bib2","unstructured":"Arnow, D.M. and A.M. Tenebaum (1982), An Investigation of the Move-Ahead-k Rules, Congressus Numerantium, Proc. of the Thirteenth Southeastern Conference on Combinatorics, Graph Theory and Computing, Florida, 47\u201365."},{"key":"10.1016\/B978-0-08-040806-4.50038-1_bib3","unstructured":"Bayer, P. J. (1975), Improved bounds on the costs of optimal and balanced binary search trees, MAC Technical Memo-69."},{"key":"10.1016\/B978-0-08-040806-4.50038-1_bib4","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1137\/0208007","article-title":"Heuristics That Dynamically Organize Data Structures","volume":"8","author":"Bitner","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/B978-0-08-040806-4.50038-1_bib5","doi-asserted-by":"crossref","first-page":"697","DOI":"10.2307\/3212792","article-title":"On a Model for Storage and Search","volume":"10","author":"Burville","year":"1973","journal-title":"J. Appl. Probability"},{"key":"10.1016\/B978-0-08-040806-4.50038-1_bib6","doi-asserted-by":"crossref","unstructured":"Cheetham, R.P., B.J. Oommen and D.T.H. Ng (1988), On Using Conditional Rotation Operations to Adaptively Structure Binary Search Trees, Proceeding of the 1988 International Conference on Database Theory, Bruges, Belgium, 161\u2013175.","DOI":"10.1007\/3-540-50171-1_10"},{"key":"10.1016\/B978-0-08-040806-4.50038-1_bib7","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1137\/0210046","article-title":"Exegesis of self-organizing linear search","volume":"10","author":"Gonnet","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/B978-0-08-040806-4.50038-1_bib8","unstructured":"Hammer, M., and B. Niamir (1979), A Heuristic Approach to Attribute Partitioning, Proc. of the ACM SIGMOD Conference, 93\u2013101."},{"key":"10.1016\/B978-0-08-040806-4.50038-1_bib9","series-title":"Inequalities","author":"Hardy","year":"1983"},{"key":"10.1016\/B978-0-08-040806-4.50038-1_bib10","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1137\/0205050","article-title":"An Account of Self-Organizing Systems","volume":"5","author":"Hendricks","year":"1976","journal-title":"SIAM J. Computing"},{"key":"10.1016\/B978-0-08-040806-4.50038-1_bib11","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1145\/5505.5507","article-title":"Self-Organizing Linear Search","volume":"17","author":"Hester","year":"1985","journal-title":"ACM Computing Surveys"},{"key":"10.1016\/B978-0-08-040806-4.50038-1_bib12","doi-asserted-by":"crossref","first-page":"1004","DOI":"10.2307\/3213210","article-title":"Optimal List Order Under Partial Memory Constraints","volume":"17","author":"Kan","year":"1980","journal-title":"J. App. Probability"},{"key":"10.1016\/B978-0-08-040806-4.50038-1_bib13","series-title":"A First Course in Stochastic Processes","author":"Karlin","year":"1975"},{"key":"10.1016\/B978-0-08-040806-4.50038-1_bib14","series-title":"The Art of Computer Programming 3, Sorting and Searching","author":"Knuth","year":"1973"},{"key":"10.1016\/B978-0-08-040806-4.50038-1_bib15","series-title":"Learning Algorithms Theory and Applications","author":"Lakshmivarahan","year":"1981"},{"key":"10.1016\/B978-0-08-040806-4.50038-1_bib16","unstructured":"Ma, D.C.Y. (1986), Object Partitioning by using Learning Automata, M.C.S. Thesis, School of Computer Science, Carleton University, Ottawa, Canada."},{"key":"10.1016\/B978-0-08-040806-4.50038-1_bib17","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1287\/opre.13.4.609","article-title":"On Serial Files with Relocatable Records","volume":"12","author":"McCabe","year":"1965","journal-title":"Operations Research"},{"key":"10.1016\/B978-0-08-040806-4.50038-1_bib18","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/BF00264563","article-title":"Nearly optimal binary search trees","volume":"5","author":"Mehlhorn","year":"1975","journal-title":"Acta Informatica"},{"key":"10.1016\/B978-0-08-040806-4.50038-1_bib19","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1109\/TSMC.1974.5408453","article-title":"Learning Automata \u2013 A Survey","volume":"Vol.SMC-4","author":"Narendra","year":"1974","journal-title":"IEEE Trans. Syst. Man and Cybern."},{"issue":"No. 4","key":"10.1016\/B978-0-08-040806-4.50038-1_bib20","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1137\/0216047","article-title":"List Organizing Strategies using Stochastic Move-to-Front and Stochastic Move-to-Rear Operations","volume":"16","author":"Oommen","year":"1987","journal-title":"SIAM Journal of Computing"},{"key":"10.1016\/B978-0-08-040806-4.50038-1_bib21","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0304-3975(90)90136-6","article-title":"Deterministic Optimal and Expedient Move-to-Rear List Organizing Strategies","volume":"74","author":"Oommen","year":"1990","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/B978-0-08-040806-4.50038-1_bib22","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/12.75146","article-title":"Deterministic Learning Automata Solutions to the Equi-Partitioning Problem","volume":"37","author":"Oommen","year":"1988","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/B978-0-08-040806-4.50038-1_bib23","article-title":"Stochastic Automata Solutions to the Object Partitioning Problem","author":"Oommen","year":"1991","journal-title":"The Computer Journal."},{"key":"10.1016\/B978-0-08-040806-4.50038-1_bib24","article-title":"On Transparently Modifying Users'","author":"Oommen","year":"1988","journal-title":"Query Distributions"},{"key":"10.1016\/B978-0-08-040806-4.50038-1_bib25","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/359997.360000","article-title":"On Self Organizing Sequential Search Heuristics","volume":"19","author":"Rivest","year":"1976","journal-title":"Comm. ACM"},{"key":"10.1016\/B978-0-08-040806-4.50038-1_bib26","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1145\/3828.3835","article-title":"Self-adjusting binary search trees","volume":"32","author":"Sleator","year":"1985","journal-title":"JACM"},{"key":"10.1016\/B978-0-08-040806-4.50038-1_bib27","first-page":"27","article-title":"A Clustering Algorithm for Hierarchical Structures","author":"Schkolnick","year":"1977","journal-title":"ACM Trans. on Database Systems"},{"key":"10.1016\/B978-0-08-040806-4.50038-1_bib28","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1137\/0211046","article-title":"Two Spectra of Self-Organizing Sequential Search Algorithms","volume":"11","author":"Tenenbaum","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/B978-0-08-040806-4.50038-1_bib29","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1108\/eb026637","article-title":"A Theoretical Basis for the Use of Co-occurrence Data in Information Retrieval","author":"Van Rijsbergen","year":"1977","journal-title":"J. Documentation"},{"key":"10.1016\/B978-0-08-040806-4.50038-1_bib30","series-title":"Graph Theory and Computing","article-title":"A top-down algorithm for constructing nearly optimal lexicographical trees","author":"Walker","year":"1972"},{"key":"10.1016\/B978-0-08-040806-4.50038-1_bib31","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1145\/321921.321930","article-title":"Precision Weighting - An Effective Automatic Indexing Method","author":"Yu","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/B978-0-08-040806-4.50038-1_bib32","unstructured":"Yu, C.T., M.K. Siu, K. Lam and F. Tai (1981), Adaptive Clustering Schemes : General Framework, Proc. of the IEEE COMPSAC Conference, 81\u201389."},{"key":"10.1016\/B978-0-08-040806-4.50038-1_bib33","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1145\/3857.3861","article-title":"Adaptive Record Clustering","author":"Yu","year":"1985","journal-title":"ACM Trans. on Database Systems"}],"container-title":["Computer Science and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9780080408064500381?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9780080408064500381?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,8,12]],"date-time":"2019-08-12T04:36:08Z","timestamp":1565584568000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/B9780080408064500381"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9780080408064"],"references-count":33,"URL":"https:\/\/doi.org\/10.1016\/b978-0-08-040806-4.50038-1","relation":{},"subject":[],"published":{"date-parts":[[1992]]}}}