{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T03:17:45Z","timestamp":1673320665592},"reference-count":36,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"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":["Information Systems"],"published-print":{"date-parts":[[1993,1]]},"DOI":"10.1016\/0306-4379(93)90041-x","type":"journal-article","created":{"date-parts":[[2003,8,7]],"date-time":"2003-08-07T21:31:39Z","timestamp":1060291899000},"page":"37-54","source":"Crossref","is-referenced-by-count":6,"title":["Optimal MMI file systems for orthogonal range retrieval"],"prefix":"10.1016","volume":"18","author":[{"given":"C.Y","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.C","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.C.T","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/0306-4379(93)90041-X_BIB1","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/320071.320074","article-title":"Optimal partial-match retrieval when fields are independently specified","volume":"4","author":"Aho","year":"1979","journal-title":"ACM Trans. Database Syst."},{"issue":"2","key":"10.1016\/0306-4379(93)90041-X_BIB2","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1145\/322123.322126","article-title":"Optimality properties of multiple key hashing functions","volume":"26","author":"Bolour","year":"1979","journal-title":"J. Ass. Comput. Mach."},{"key":"10.1016\/0306-4379(93)90041-X_BIB3","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0020-0255(84)90049-5","article-title":"Optimal information retrieval when queries are not random","volume":"34","author":"Chang","year":"1984","journal-title":"Inf. Sci."},{"key":"10.1016\/0306-4379(93)90041-X_BIB4","article-title":"Greedy file\u2014A new data organization concept for partial match retrieval","author":"Chou","year":"1989","journal-title":"Comput. J."},{"issue":"2","key":"10.1016\/0306-4379(93)90041-X_BIB5","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1109\/TSE.1985.232197","article-title":"On the file design problem for partial match retrieval","volume":"SE-11","author":"Du","year":"1985","journal-title":"IEEE Trans. Software Engng"},{"issue":"3","key":"10.1016\/0306-4379(93)90041-X_BIB6","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1145\/320083.320092","article-title":"Extendible hashing\u2014A fast access method for dynamic files","volume":"4","author":"Fagin","year":"1979","journal-title":"ACM Trans. Database Syst."},{"key":"10.1016\/0306-4379(93)90041-X_BIB7","series-title":"Proc. ACM SIGFIDET Workshop on Data Description, Access, and Control","first-page":"186","article-title":"Expandable open addressing hash table storage and retrieval","author":"Knott","year":"1971"},{"key":"10.1016\/0306-4379(93)90041-X_BIB8","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1007\/BF01931695","article-title":"Dynamic hashing","volume":"18","author":"Larson","year":"1978","journal-title":"BIT"},{"issue":"4","key":"10.1016\/0306-4379(93)90041-X_BIB9","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1145\/319758.319763","article-title":"Performance analysis of lienar hashing with partial expansions","volume":"7","author":"Larson","year":"1982","journal-title":"ACM Trans. Database Syst."},{"issue":"1","key":"10.1016\/0306-4379(93)90041-X_BIB10","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1145\/3148.3324","article-title":"Linear hashing with overflow-handling by linear probing","volume":"10","author":"Larson","year":"1985","journal-title":"ACM Trans. Database Syst."},{"issue":"3","key":"10.1016\/0306-4379(93)90041-X_BIB11","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1145\/44498.44500","article-title":"Linear hashing with separators\u2014A dynamic hashing scheme achieving one-access retrieval","volume":"13","author":"Larson","year":"1988","journal-title":"ACM Trans. Database Syst."},{"issue":"2","key":"10.1016\/0306-4379(93)90041-X_BIB12","first-page":"1","article-title":"Multi-key sorting","volume":"3","author":"Lee","year":"1979","journal-title":"Policy Analy. Inf. Syst."},{"issue":"2","key":"10.1016\/0306-4379(93)90041-X_BIB13","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1109\/TSE.1979.234172","article-title":"Common properties of some multi-attribute file systems","volume":"SE-5","author":"Lin","year":"1979","journal-title":"IEEE Trans. Software Engng"},{"key":"10.1016\/0306-4379(93)90041-X_BIB14","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0306-4379(77)90007-2","article-title":"Multi-dimensional clustering for data base organizations","volume":"2","author":"Liou","year":"1977","journal-title":"Information Systems"},{"key":"10.1016\/0306-4379(93)90041-X_BIB15","series-title":"Proc. 4th Int. Conf. on Very Large Data Bases","first-page":"517","article-title":"Virtual hashing: a dynamically changing hashing","author":"Litwin","year":"1978"},{"key":"10.1016\/0306-4379(93)90041-X_BIB16","series-title":"Proc. 6th Int. Conf. on Very Large Data Bases","first-page":"212","article-title":"Linear hashing: a new tool for file and table addressing","author":"Litwin","year":"1980"},{"key":"10.1016\/0306-4379(93)90041-X_BIB17","series-title":"Trie hashing. Research Report, MAP-I-014","author":"Litwin","year":"1981"},{"key":"10.1016\/0306-4379(93)90041-X_BIB18","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1007\/BF01944474","article-title":"Partial match retrieval for dynamic files","volume":"22","author":"Lloyd","year":"1982","journal-title":"BIT"},{"issue":"6","key":"10.1016\/0306-4379(93)90041-X_BIB19","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1109\/TSE.1982.236022","article-title":"Analysis of extendible hashing","volume":"SE-8","author":"Mendelson","year":"1982","journal-title":"IEEE Trans. Software Engng"},{"issue":"4","key":"10.1016\/0306-4379(93)90041-X_BIB20","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1145\/319996.320004","article-title":"On the complexity of designing optimal partial-match retrieval systems","volume":"8","author":"Moran","year":"1983","journal-title":"ACM Trans. Database Syst."},{"issue":"2","key":"10.1016\/0306-4379(93)90041-X_BIB21","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1145\/63500.63521","article-title":"File organization using composite perfect hashing","volume":"14","author":"Ramakrishna","year":"1989","journal-title":"ACM Trans. Database Syst."},{"issue":"4","key":"10.1016\/0306-4379(93)90041-X_BIB22","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1093\/comjnl\/25.4.478","article-title":"Dynamic hashing schemes","volume":"25","author":"Ramamohanarao","year":"1982","journal-title":"Comput. J."},{"issue":"4","key":"10.1016\/0306-4379(93)90041-X_BIB23","doi-asserted-by":"crossref","first-page":"552","DOI":"10.1145\/319996.320006","article-title":"Partial match retrieval using hashing and descriptors","volume":"8","author":"Ramamohanarao","year":"1983","journal-title":"ACM Trans. Database Syst."},{"issue":"3","key":"10.1016\/0306-4379(93)90041-X_BIB24","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1145\/1270.1285","article-title":"Recursive linear hashing","volume":"9","author":"Ramamohanarao","year":"1984","journal-title":"ACM Trans. Database Syst."},{"key":"10.1016\/0306-4379(93)90041-X_BIB25","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1007\/BF01935368","article-title":"Partial match retrieval using recursive linear hashing","volume":"25","author":"Ramamohanarao","year":"1985","journal-title":"BIT"},{"issue":"1","key":"10.1016\/0306-4379(93)90041-X_BIB26","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1137\/0205003","article-title":"Partial match retrieval algorithm","volume":"14","author":"Rivest","year":"1976","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/0306-4379(93)90041-X_BIB27","first-page":"63","article-title":"Attribute based file organization in paged memory environment","volume":"17","author":"Rothnie","year":"1974","journal-title":"Commun. Ass. Comput. Mach."},{"issue":"1","key":"10.1016\/0306-4379(93)90041-X_BIB28","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1145\/319540.319564","article-title":"New file organization based on dynamic hashing","volume":"6","author":"Scholl","year":"1981","journal-title":"ACM Trans. Database Syst."},{"key":"10.1016\/0306-4379(93)90041-X_BIB29","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF01934393","article-title":"The extendible cell method for closest point problems","volume":"22","author":"Tamminen","year":"1982","journal-title":"BIT"},{"issue":"5","key":"10.1016\/0306-4379(93)90041-X_BIB30","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0020-0190(82)90123-5","article-title":"Extendible hashing with overflow","volume":"15","author":"Tamminen","year":"1982","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"10.1016\/0306-4379(93)90041-X_BIB31","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0306-4379(85)90005-5","article-title":"On the complexity of some multi-attribute file design problem","volume":"10","author":"Tang","year":"1985","journal-title":"Information Systems"},{"issue":"8","key":"10.1016\/0306-4379(93)90041-X_BIB32","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1109\/TSE.1986.6312983","article-title":"Dynamic file structure for partial match retrieval based on overflow bucket sharing","volume":"SE-12","author":"Yuen","year":"1986","journal-title":"IEEE Trans. Software Engng"},{"key":"10.1016\/0306-4379(93)90041-X_BIB33","series-title":"Proc. 4th Int. Working Conf. on Statistical and Scientific Database Management","first-page":"139","article-title":"Orthogonal range retrieval using bucket address hashing","author":"Chang","year":"1988"},{"key":"10.1016\/0306-4379(93)90041-X_BIB34","series-title":"Optimization in Integers and Related Extremal Problems","author":"Saaty","year":"1970"},{"issue":"1","key":"10.1016\/0306-4379(93)90041-X_BIB35","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1109\/TSE.1984.5010203","article-title":"Performance analysis of Cartesian product files and random files","volume":"SE-10","author":"Chang","year":"1984","journal-title":"IEEE Trans. Software Engng"},{"key":"10.1016\/0306-4379(93)90041-X_BIB36","series-title":"Proc. of ACM-SIGMOD 1980 Conf.","first-page":"157","article-title":"Some properties of Cartesian product files","author":"Chang","year":"1980"}],"container-title":["Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030643799390041X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030643799390041X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T00:55:52Z","timestamp":1552611352000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030643799390041X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,1]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,1]]}},"alternative-id":["030643799390041X"],"URL":"https:\/\/doi.org\/10.1016\/0306-4379(93)90041-x","relation":{},"ISSN":["0306-4379"],"issn-type":[{"value":"0306-4379","type":"print"}],"subject":[],"published":{"date-parts":[[1993,1]]}}}