{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T02:13:18Z","timestamp":1768443198139,"version":"3.49.0"},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2000,2,1]],"date-time":"2000-02-01T00:00:00Z","timestamp":949363200000},"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 &amp; Knowledge Engineering"],"published-print":{"date-parts":[[2000,2]]},"DOI":"10.1016\/s0169-023x(99)00031-2","type":"journal-article","created":{"date-parts":[[2003,3,25]],"date-time":"2003-03-25T22:25:53Z","timestamp":1048631153000},"page":"115-130","source":"Crossref","is-referenced-by-count":10,"title":["Efficient indexing of high-dimensional data through dimensionality reduction"],"prefix":"10.1016","volume":"32","author":[{"given":"Cheng Hian","family":"Goh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Agnes","family":"Lim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Beng Chin","family":"Ooi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kian-Lee","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0169-023X(99)00031-2_BIB1","doi-asserted-by":"crossref","unstructured":"N. Beckmann, H.-P. Kriegel, R. Schneider, B. Seeger, The R*-tree: an efficient and robust access method for points and rectangles, in: Proceedings of the ACM SIGMOD International Conference on Management of Data, Atlantic City, NJ, 1990, pp. 322\u2013331","DOI":"10.1145\/93597.98741"},{"key":"10.1016\/S0169-023X(99)00031-2_BIB2","unstructured":"S. Berchtold, D.A. Keim, H.-P. Kriegel, The X-tree: an index structure for high-dimensional data, in: Proceedings of the VLDB, 1996"},{"key":"10.1016\/S0169-023X(99)00031-2_BIB3","series-title":"Indexing Techniques for Advanced Database Systems","author":"Bertino","year":"1997"},{"key":"10.1016\/S0169-023X(99)00031-2_BIB4","unstructured":"C.Y. Chan, B.C. Ooi, H. Lu, Extensible buffer management of indexes, in: Proceedings of the VLDB, 1992, pp. 444\u2013454"},{"key":"10.1016\/S0169-023X(99)00031-2_BIB5","doi-asserted-by":"crossref","unstructured":"C. Faloutsos, Multiattribute hashing using gray codes, in: Proceedings of the ACM SIGMOD International Conference on Management of Data, May 1986, pp. 227\u2013238","DOI":"10.1145\/16894.16877"},{"key":"10.1016\/S0169-023X(99)00031-2_BIB6","series-title":"Searching Multimedia Databases by Content","author":"Faloutsos","year":"1996"},{"key":"10.1016\/S0169-023X(99)00031-2_BIB7","doi-asserted-by":"crossref","unstructured":"C. Faloutsos, K.-I. Lin, Fastmap: a fast algorithm for indexing data-mining and visualization of traditional and multimedia datasets, in: Proceedings of the ACM SIGMOD International Conference on Managementof Data, May 1995, pp. 163\u2013174","DOI":"10.1145\/223784.223812"},{"key":"10.1016\/S0169-023X(99)00031-2_BIB8","doi-asserted-by":"crossref","unstructured":"C. Faloutsos, S. Roseman, Fractals for secondary key retrieval, in: Proceedings of the PODS, March 1989, pp. 247\u2013252","DOI":"10.1145\/73721.73746"},{"key":"10.1016\/S0169-023X(99)00031-2_BIB9","doi-asserted-by":"crossref","unstructured":"A. Guttman, R-trees: A dynamic index structure for spatial searching, in: Proceedings of the ACM SIGMOD International Conference on Management of Data, Boston, MA, 1984, pp. 47\u201357","DOI":"10.1145\/602259.602266"},{"key":"10.1016\/S0169-023X(99)00031-2_BIB10","doi-asserted-by":"crossref","unstructured":"H.V. Jagadish, Linear clustering of objects with multiple attributes, in: Proceedings of the ACM SIGMOD International Conference on Management of Data, May 1990, pp. 332\u2013342","DOI":"10.1145\/93597.98742"},{"key":"10.1016\/S0169-023X(99)00031-2_BIB11","doi-asserted-by":"crossref","unstructured":"K.-I. Lin, H.V. Jagadish, C. Faloutsos, The TV-tree: an index structure for high-dimensional data, The VLDB Journal 3,4 October 1994, pp. 517\u2013542","DOI":"10.1007\/BF01231606"},{"key":"10.1016\/S0169-023X(99)00031-2_BIB12","doi-asserted-by":"crossref","unstructured":"D. Lomet, A review of recent work on multi-attribute access method, ACM SIGMOD Record 21, 3 September 1992, pp. 56\u201363","DOI":"10.1145\/140979.141006"},{"key":"10.1016\/S0169-023X(99)00031-2_BIB13","unstructured":"B. Moon, H.V. Jagadish, C. Faloutsos, J.H. Saltz, Analysis of the Clustering Properties of Hilbert Space-Filling Curve, Technical Report, Maryland 1996"},{"key":"10.1016\/S0169-023X(99)00031-2_BIB14","doi-asserted-by":"crossref","unstructured":"J. Orenstein, Spatial query processing in an object-oriented database system, in: Proceedings of the ACM SIGMOD International Conference on Management of Data, May 1986, pp. 326\u2013336","DOI":"10.1145\/16894.16886"},{"key":"10.1016\/S0169-023X(99)00031-2_BIB15","doi-asserted-by":"crossref","unstructured":"N. Roussopoulos, Y. Kotidis, M. Roussopoulos, Cubetree: organization of and bulk incremental updates on the data cubes, in: Proceedings of the ACM SIGMOD International Conference on Management of Data, Tuscon Arizona, 1997, pp. 89\u201399","DOI":"10.1145\/253260.253276"},{"key":"10.1016\/S0169-023X(99)00031-2_BIB16","unstructured":"T. Sellis, N. Roussopoulos, C. Faloutsos, The R+-tree: a dynamic index for multi-dimensional objects, in: Proceedings of the VLDB, Brighton, UK, 1987, pp. 507\u2013518"}],"container-title":["Data &amp; Knowledge Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0169023X99000312?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0169023X99000312?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T11:53:45Z","timestamp":1556366025000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0169023X99000312"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,2]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,2]]}},"alternative-id":["S0169023X99000312"],"URL":"https:\/\/doi.org\/10.1016\/s0169-023x(99)00031-2","relation":{},"ISSN":["0169-023X"],"issn-type":[{"value":"0169-023X","type":"print"}],"subject":[],"published":{"date-parts":[[2000,2]]}}}