{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T14:41:51Z","timestamp":1648996911661},"reference-count":42,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1990,9,1]],"date-time":"1990-09-01T00:00:00Z","timestamp":652147200000},"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":["Data & Knowledge Engineering"],"published-print":{"date-parts":[[1990,9]]},"DOI":"10.1016\/0169-023x(90)90001-t","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T17:15:20Z","timestamp":1047662120000},"page":"183-206","source":"Crossref","is-referenced-by-count":0,"title":["Heuristics and multi-dimensional physical database design: An experimental KBS"],"prefix":"10.1016","volume":"5","author":[{"given":"Z.","family":"Fu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.A.","family":"Long","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0169-023X(90)90001-T_BIB1","first-page":"117","article-title":"Knowledge-Based Speech Pattern Recognition","author":"Allerhand","year":"1987"},{"key":"10.1016\/0169-023X(90)90001-T_BIB2","series-title":"Proc. Third Internat. Conf. Data Engineering","first-page":"150","article-title":"Expert systems based configuration of VSAM files","author":"Allgeyer","year":"1987"},{"key":"10.1016\/0169-023X(90)90001-T_BIB3","series-title":"Expert systems based configuration of VSAM files","author":"Allgeyer","year":"1986"},{"key":"10.1016\/0169-023X(90)90001-T_BIB4","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1007\/BF01934457","article-title":"Interpolation-based index maintenance","volume":"23","author":"Burkhard","year":"1983","journal-title":"BIT"},{"key":"10.1016\/0169-023X(90)90001-T_BIB5","series-title":"Cybernetic Systems: Recognition, Leaning, Self-Organisation","first-page":"121","article-title":"Shape recognition using Hough transform","author":"Cantoni","year":"1984"},{"key":"10.1016\/0169-023X(90)90001-T_BIB6","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1109\/64.21896","article-title":"Explaining control stategies in problem solving","author":"Chandrasekaran","year":"1989","journal-title":"IEEE Expert"},{"key":"10.1016\/0169-023X(90)90001-T_BIB7","series-title":"The Matching Law","author":"Davison","year":"1988"},{"issue":"2","key":"10.1016\/0169-023X(90)90001-T_BIB8","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1145\/46157.330532","article-title":"Dynamic hashing schemes","volume":"20","author":"Enbody","year":"1988","journal-title":"ACM Computing Surveys"},{"key":"10.1016\/0169-023X(90)90001-T_BIB9","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1145\/16856.16877","article-title":"Multiattribute hashing using Gray codes","author":"Falousos","year":"1986","journal-title":"ACM SIGMOD Record"},{"key":"10.1016\/0169-023X(90)90001-T_BIB10","series-title":"Techniques for 3-D Machine Perception","first-page":"13","article-title":"The presentation, recognition, and partitioning of 3-D shapes from range data","author":"Faugeras","year":"1986"},{"issue":"3","key":"10.1016\/0169-023X(90)90001-T_BIB11","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1145\/38714.38743","article-title":"The BANG file: A new kind of grid file","volume":"16","author":"Freeston","year":"1987","journal-title":"ACM SIGMOD Record"},{"key":"10.1016\/0169-023X(90)90001-T_BIB12","article-title":"Data structures for knowledge bases: Multi-dimensional file organisations","author":"Freeston","year":"1922","journal-title":"Technical report TR-KB-13"},{"key":"10.1016\/0169-023X(90)90001-T_BIB13","series-title":"PROLOG and Databases","first-page":"188","article-title":"Grid files for efficient PROLOG clause accesses","author":"Freeston","year":"1988"},{"key":"10.1016\/0169-023X(90)90001-T_BIB14","series-title":"7th Internat. Conf. Pattern Recognition","first-page":"1077","article-title":"On the order of examining datapoints in SSD template matching","author":"Gold","year":"1984"},{"key":"10.1016\/0169-023X(90)90001-T_BIB15","series-title":"Proc. ACM SIGMOD Internat. Conf. Management of Data","first-page":"47","article-title":"R-trees: A dynamic index structure for spatial searching","author":"Guttman","year":"1984"},{"key":"10.1016\/0169-023X(90)90001-T_BIB16","series-title":"14th Internat. Conf. Data Engineering","first-page":"572","article-title":"Globally order preserving multidimensional linear hashing","author":"Hutflesz","year":"1988"},{"issue":"3","key":"10.1016\/0169-023X(90)90001-T_BIB17","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1145\/971701.50222","article-title":"Twin grid files: Space optimisation access schemes","volume":"17","author":"Hutflesz","year":"1988","journal-title":"ACM SIGMOD Internat. Conf. Management of Data"},{"key":"10.1016\/0169-023X(90)90001-T_BIB18","series-title":"Seventh Internat. Conf. Pattern Recognition","first-page":"1131","article-title":"Matching an imprecise object description with models in a knowledge base","author":"Khan","year":"1984"},{"key":"10.1016\/0169-023X(90)90001-T_BIB19","series-title":"14th Internat. Conf. Data Engineering","first-page":"369","article-title":"PLOT-hashing: A grid file without directory","author":"Kriegel","year":"1988"},{"key":"10.1016\/0169-023X(90)90001-T_BIB20","unstructured":"H.-P. Kriegel and B. Seeger, Multidimensional quantile hashing is very efficient for nonuniform distribution, to appear in Inform. Sci."},{"key":"10.1016\/0169-023X(90)90001-T_BIB21","series-title":"Proc. Third Internat. Conf. Data Engineering","first-page":"10","article-title":"Multidimensional quantile hashing is very efficient for nonuniform distribution","author":"Kriegel","year":"1987"},{"key":"10.1016\/0169-023X(90)90001-T_BIB22","series-title":"Proc. Internat. Conf. Database Theory","first-page":"203","article-title":"Multidimensional order preserving linear hashing with partial expansion","author":"Kriegel","year":"1986"},{"issue":"3","key":"10.1016\/0169-023X(90)90001-T_BIB23","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. TODS"},{"key":"10.1016\/0169-023X(90)90001-T_BIB24","series-title":"Proc. Fifth Nat. Conf. A.I.","first-page":"215","article-title":"Using decision theory to justify heuristics","author":"Langlotz","year":"1986"},{"issue":"2","key":"10.1016\/0169-023X(90)90001-T_BIB25","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1007\/BF01931695","article-title":"Dynamic hashing","volume":"18","author":"Larson","year":"1978","journal-title":"Bit"},{"key":"10.1016\/0169-023X(90)90001-T_BIB26","article-title":"The hB-tree: A robust multi-attribute indexing method","author":"Lomet","year":"1987"},{"issue":"3","key":"10.1016\/0169-023X(90)90001-T_BIB27","doi-asserted-by":"crossref","DOI":"10.1145\/62061.62063","article-title":"Statistical prolife estimation in database system","volume":"20","author":"Mannino","year":"1988","journal-title":"ACM Computing Surveys"},{"issue":"1","key":"10.1016\/0169-023X(90)90001-T_BIB28","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1145\/348.318586","article-title":"The grid file: An adaptable symmetric multi-key file structure","volume":"9","author":"Nievergelt","year":"1984","journal-title":"ACM Trans. TODS"},{"key":"10.1016\/0169-023X(90)90001-T_BIB29","unstructured":"J.A. Orenstein, PROBE spatial data modeling and query processing in an image database application, Technical report, AITD reference No. 155, 38 pp."},{"key":"10.1016\/0169-023X(90)90001-T_BIB30","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1145\/16856.16886","article-title":"Spatial query processing in an object-oriented database system","author":"Orenstein","year":"1986","journal-title":"ACM SIGMOD Record"},{"key":"10.1016\/0169-023X(90)90001-T_BIB31","series-title":"Proc. 3rd ACM SIGACT-SIGMOD Symp. Principles of Database Systems","first-page":"181","article-title":"A class of data structures for associative searching","author":"Orenstein","year":"1984"},{"key":"10.1016\/0169-023X(90)90001-T_BIB32","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1145\/971699.318918","article-title":"A multidimensional digital hashing scheme for files with composite keys","author":"Otoo","year":"1985","journal-title":"ACM SIGMOD Record"},{"key":"10.1016\/0169-023X(90)90001-T_BIB33","series-title":"Proc. 10th Internat. Conf. VLDBs","first-page":"493","article-title":"A mapping function for the directory of a multidimensional extendible hashing","author":"Otoo","year":"1984"},{"key":"10.1016\/0169-023X(90)90001-T_BIB34","series-title":"14th Internat. Conf. Data Engineering","first-page":"580","article-title":"Linearising the directory growth in order preserving extendible hashing","author":"Otoo","year":"1988"},{"key":"10.1016\/0169-023X(90)90001-T_BIB35","series-title":"14th Internat. Conf. Data Engineering","first-page":"362","article-title":"An exact probability model for finite hash table","author":"Ramakrishna","year":"1988"},{"key":"10.1016\/0169-023X(90)90001-T_BIB36","first-page":"335","article-title":"Analysis of grid file algorithms","author":"Regnier","year":"1984","journal-title":"BIT"},{"key":"10.1016\/0169-023X(90)90001-T_BIB37","series-title":"14th Internat. Conf. Data Engineering","first-page":"377","article-title":"Tree hashing analysis","author":"Regnier","year":"1988"},{"key":"10.1016\/0169-023X(90)90001-T_BIB38","series-title":"Proc. ACM SIGMOD Internat. Conf. Management of Data","first-page":"10","article-title":"The k-d-B tree: A search structure for large multidimensional dynamic indexes","author":"Robinson","year":"1981"},{"issue":"4","key":"10.1016\/0169-023X(90)90001-T_BIB39","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1145\/50020.50021","article-title":"Hierarchical representations of collections of small rectangles","volume":"20","author":"Samet","year":"1988","journal-title":"ACM Computer Surveys"},{"key":"10.1016\/0169-023X(90)90001-T_BIB40","series-title":"Proc. 13th VLDB Conf.","first-page":"507","article-title":"The R+-tree: A dynamic index for multi-dimensional object","author":"Sellis","year":"1987"},{"key":"10.1016\/0169-023X(90)90001-T_BIB41","series-title":"Proc. Third Internat. Conf. Data Engineering","first-page":"2","article-title":"Linear hashing with priority splitting","author":"Ruchte","year":"1987"},{"key":"10.1016\/0169-023X(90)90001-T_BIB42","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"}],"container-title":["Data & Knowledge Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0169023X9090001T?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0169023X9090001T?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T15:27:26Z","timestamp":1553614046000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0169023X9090001T"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,9]]},"references-count":42,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1990,9]]}},"alternative-id":["0169023X9090001T"],"URL":"https:\/\/doi.org\/10.1016\/0169-023x(90)90001-t","relation":{},"ISSN":["0169-023X"],"issn-type":[{"value":"0169-023X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,9]]}}}