{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T12:38:17Z","timestamp":1648989497600},"reference-count":24,"publisher":"Elsevier BV","issue":"9","license":[{"start":{"date-parts":[[1994,11,1]],"date-time":"1994-11-01T00:00:00Z","timestamp":783648000000},"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":["Microprocessing and Microprogramming"],"published-print":{"date-parts":[[1994,11]]},"DOI":"10.1016\/0165-6074(94)90091-4","type":"journal-article","created":{"date-parts":[[2003,8,8]],"date-time":"2003-08-08T04:56:10Z","timestamp":1060318570000},"page":"627-650","source":"Crossref","is-referenced-by-count":2,"title":["Design and evaluation of access method for multi-dimensional objects in spatial databases"],"prefix":"10.1016","volume":"40","author":[{"given":"Byungyeon","family":"Hwang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Songchun","family":"Moon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0165-6074(94)90091-4_BIB1","series-title":"Proc. 2nd Int. Symp. Large Spatial Databases","first-page":"423","article-title":"Exploiting extensible DBMS in integrated geographic information systems","author":"Haas","year":"1991"},{"key":"10.1016\/0165-6074(94)90091-4_BIB2","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/361002.361007","article-title":"Multidimensional binary search trees used for associative searching","volume":"18","author":"Bentley","year":"1975","journal-title":"Commun. ACM"},{"key":"10.1016\/0165-6074(94)90091-4_BIB3","series-title":"Proc. ACM SIGMOD","first-page":"10","article-title":"The K-D-B Tree: A search structure for large multidimensional dynamic indexes","author":"Robinson","year":"1981"},{"key":"10.1016\/0165-6074(94)90091-4_BIB4","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/0020-0190(82)90027-8","article-title":"Multidimensional trees used for associative searching","volume":"14","author":"Orenstein","year":"1982","journal-title":"Informat. Processing Letters"},{"key":"10.1016\/0165-6074(94)90091-4_BIB5","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1145\/348.318586","article-title":"The Grid File: An adaptable, symmetric multikey file structure","volume":"9","author":"Nievergelt","year":"1984","journal-title":"ACM Trans. Database Syst."},{"key":"10.1016\/0165-6074(94)90091-4_BIB6","series-title":"Proc. ACM SIGMOD","first-page":"260","article-title":"The BANG file: A new kind of grid file","author":"Freeston","year":"1987"},{"key":"10.1016\/0165-6074(94)90091-4_BIB7","series-title":"Proc. 4th Int. Conf. on Data Engineering","first-page":"369","article-title":"PLOP-hashing: A grid file without directory","author":"Kriegel","year":"1988"},{"key":"10.1016\/0165-6074(94)90091-4_BIB8","series-title":"Proc. 16th Int. Conf. Very Large Databases","first-page":"590","article-title":"The buddy tree: An efficient and robust access method for spatial databases","author":"Seeger","year":"1990"},{"key":"10.1016\/0165-6074(94)90091-4_BIB9","series-title":"Proc. 4th Int. Conf. Data Engineering","first-page":"496","article-title":"Spatial searching in geometric databases","author":"Six","year":"1988"},{"key":"10.1016\/0165-6074(94)90091-4_BIB10","series-title":"Proc. ACM SIGMOD","first-page":"47","article-title":"R-trees: A dynamic index structure for spatial searching","author":"Guttman","year":"1984"},{"key":"10.1016\/0165-6074(94)90091-4_BIB11","series-title":"Proc. 13th Int. Conf. Very Large Databases","first-page":"507","article-title":"The R+-tree: A dynamic index for multidimensional objects","author":"Sellis","year":"1987"},{"key":"10.1016\/0165-6074(94)90091-4_BIB12","series-title":"Proc. 14th Int. Conf. Very Large Databases","first-page":"360","article-title":"Techniques for design and implementation of efficient spatial access methods","author":"Seeger","year":"1988"},{"key":"10.1016\/0165-6074(94)90091-4_BIB13","series-title":"Proc. 1st Int. Symp. Large Spatial Databases","first-page":"29","article-title":"The Fieldtree: A data structure for geographic information systems","author":"Frank","year":"1989"},{"key":"10.1016\/0165-6074(94)90091-4_BIB14","series-title":"Proc. ACM SIGMOD","first-page":"322","article-title":"The R\u2217-tree: An efficient and robust access method for points and rectangles","author":"Beckmann","year":"1990"},{"key":"10.1016\/0165-6074(94)90091-4_BIB15","series-title":"Proc. 2nd Int. Symp. Large Spatial Databases","first-page":"184","article-title":"Grow and post index trees: Role, techniques and future potential","author":"Lomet","year":"1991"},{"key":"10.1016\/0165-6074(94)90091-4_BIB16","series-title":"Proc. ACM SIGMOD","first-page":"326","article-title":"Spatial query processing in an object-oriented database system","author":"Orenstein","year":"1986"},{"key":"10.1016\/0165-6074(94)90091-4_BIB17","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1145\/356770.356776","article-title":"The ubiquitous B-tree","volume":"11","author":"Comer","year":"1979","journal-title":"ACM Computing Surveys"},{"key":"10.1016\/0165-6074(94)90091-4_BIB18","series-title":"Introduction to Probability and Statistics","author":"Mendenhall","year":"1987"},{"key":"10.1016\/0165-6074(94)90091-4_BIB19","series-title":"Proc. ACM SIGMOD","first-page":"426","article-title":"Analysis of object oriented spatial access methods","author":"Faloutsos","year":"1987"},{"key":"10.1016\/0165-6074(94)90091-4_BIB20","article-title":"The Grid file: A data structure to support proximity queries on spatial objects","author":"Hinrichs","year":"1983"},{"key":"10.1016\/0165-6074(94)90091-4_BIB21","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1145\/356924.356930","article-title":"The Quadtree and related hierarchical data structures","volume":"16","author":"Samet","year":"1984","journal-title":"ACM Computing Surveys"},{"key":"10.1016\/0165-6074(94)90091-4_BIB22","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0165-6074(94)90091-4_BIB23","first-page":"399","article-title":"Implementation of relational database management system IM","volume":"18","author":"Moon","year":"1991","journal-title":"J. Korean Informat. Sci. Soc."},{"key":"10.1016\/0165-6074(94)90091-4_BIB24","article-title":"Extended storage manager for large complex objects in multimedia databases","author":"Hwang","year":"1991"}],"container-title":["Microprocessing and Microprogramming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0165607494900914?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0165607494900914?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T01:53:55Z","timestamp":1552614835000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0165607494900914"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,11]]},"references-count":24,"journal-issue":{"issue":"9","published-print":{"date-parts":[[1994,11]]}},"alternative-id":["0165607494900914"],"URL":"https:\/\/doi.org\/10.1016\/0165-6074(94)90091-4","relation":{},"ISSN":["0165-6074"],"issn-type":[{"value":"0165-6074","type":"print"}],"subject":[],"published":{"date-parts":[[1994,11]]}}}