{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T22:46:48Z","timestamp":1757630808224,"version":"3.44.0"},"reference-count":17,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1996,9,1]],"date-time":"1996-09-01T00:00:00Z","timestamp":841536000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1996,9,1]],"date-time":"1996-09-01T00:00:00Z","timestamp":841536000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/501100007107","name":"KAIST","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100007107","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Systems Architecture"],"published-print":{"date-parts":[[1996,9]]},"DOI":"10.1016\/1383-7621(96)80001-m","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T19:49:34Z","timestamp":1027626574000},"page":"144-162","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["A new indexing scheme supporting multi-attribute database applications: MAX"],"prefix":"10.1016","volume":"42","author":[{"given":"Byungwook","family":"Kim","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\/1383-7621(96)80001-M_bib1","series-title":"Proc. ACM SIGM0D Conf.","first-page":"322","article-title":"The R*-tree: An efficient and robust access method for points and rectangles","author":"Beckmann.","year":"1990"},{"key":"10.1016\/1383-7621(96)80001-M_bib2","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1109\/TSE.1979.234200","article-title":"Multidimensional binary search trees in database applications","volume":"4","author":"Bentley.","year":"1979","journal-title":"IEEE Trans. Software Engineering"},{"issue":"2","key":"10.1016\/1383-7621(96)80001-M_bib3","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 Comput. Surveys"},{"key":"10.1016\/1383-7621(96)80001-M_bib4","series-title":"ACM SIGMOD Conf.","first-page":"80","article-title":"A general solution of the n-dimensional B-tree problem","author":"Freeston.","year":"1995"},{"key":"10.1016\/1383-7621(96)80001-M_bib5","series-title":"Proc. IEEE Data Engineering Conf.","first-page":"598","article-title":"The design of the Cell Tree: An object-oriented index structure for geometric databases","author":"G\u00fcnther.","year":"1989"},{"key":"10.1016\/1383-7621(96)80001-M_bib6","series-title":"Proc. ACM SIGMOD Conf.","first-page":"47","article-title":"R-trees: A dynamic index structure for spatial searching","author":"Guttman.","year":"1984"},{"key":"10.1016\/1383-7621(96)80001-M_bib7","series-title":"Proc. ACM SIGMOD Conf.","first-page":"195","article-title":"Parallel R-trees","author":"Kamel.","year":"1992"},{"key":"10.1016\/1383-7621(96)80001-M_bib8","series-title":"Proc. VLDB Conf.","first-page":"500","article-title":"Hilbert R-tree: An improved R-tree using fractals","author":"Kamel.","year":"1994"},{"key":"10.1016\/1383-7621(96)80001-M_bib9","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0165-6074(93)90083-W","article-title":"A flexible indexing structure support- ing multi-attribute database applications: MAIN","volume":"39","author":"Kim.","year":"1993","journal-title":"J. Micro- processing and Microprogramming"},{"key":"10.1016\/1383-7621(96)80001-M_bib10","series-title":"Proc. ACM SIGMOD Conf.","first-page":"138","article-title":"Segment indexes: Dy- namic indexing techniques for multi-dimensional interval data","author":"Kolovson.","year":"1991"},{"issue":"4","key":"10.1016\/1383-7621(96)80001-M_bib11","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1007\/BF01231606","article-title":"The TV-tree: An index structure for high-dimensional data","volume":"3","author":"Lin","year":"1995","journal-title":"VLDB J."},{"issue":"1","key":"10.1016\/1383-7621(96)80001-M_bib12","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 Systems"},{"issue":"4","key":"10.1016\/1383-7621(96)80001-M_bib13","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/0020-0190(82)90027-8","article-title":"Multidimensional tries used for associative searching","volume":"14","author":"Orenstein.","year":"1982","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/1383-7621(96)80001-M_bib14","series-title":"Proc. ACM SIGMOD Conf.","first-page":"326","article-title":"Spatial query processing in an object-oriented database system","author":"Orenstein.","year":"1986"},{"key":"10.1016\/1383-7621(96)80001-M_bib15","series-title":"Proc. ACM SIGMOD Conf.","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\/1383-7621(96)80001-M_bib16","series-title":"Proc. VLDB Conf.","first-page":"590","article-title":"The Buddy-Tree: An efficient and robust access method for spatial data base systems","author":"Seeger.","year":"1990"},{"key":"10.1016\/1383-7621(96)80001-M_bib17","series-title":"Proc. VLDB Conf.","first-page":"507","article-title":"The R+-tree: A dynamic index for multi-dimensional objects","author":"Sellis.","year":"1987"}],"container-title":["Journal of Systems Architecture"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:138376219680001M?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:138376219680001M?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T19:23:11Z","timestamp":1757532191000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/138376219680001M"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,9]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,9]]}},"alternative-id":["138376219680001M"],"URL":"https:\/\/doi.org\/10.1016\/1383-7621(96)80001-m","relation":{},"ISSN":["1383-7621"],"issn-type":[{"type":"print","value":"1383-7621"}],"subject":[],"published":{"date-parts":[[1996,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A new indexing scheme supporting multi-attribute database applications: MAX","name":"articletitle","label":"Article Title"},{"value":"Journal of Systems Architecture","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/1383-7621(96)80001-M","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1996 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}