{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:32:01Z","timestamp":1750221121278,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":10,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,4]],"date-time":"2018-07-04T00:00:00Z","timestamp":1530662400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,7,4]]},"DOI":"10.1145\/3282308.3282314","type":"proceedings-article","created":{"date-parts":[[2019,1,9]],"date-time":"2019-01-09T18:42:31Z","timestamp":1547059351000},"page":"1-6","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Patterns for Indexing Large Datasets"],"prefix":"10.1145","author":[{"given":"Garima","family":"Gaur","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, Indian Institute of Technology, Kanpur, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sumit","family":"Kalra","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Indian Institute of Technology, Kanpur, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arnab","family":"Bhattacharya","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Indian Institute of Technology, Kanpur, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,7,4]]},"reference":[{"volume-title":"Organization and Maintenance of Large Ordered Indexes","author":"Bayer R.","key":"e_1_3_2_1_1_1","unstructured":"R. Bayer and E. McCreight . 2002. Organization and Maintenance of Large Ordered Indexes . Springer Berlin Heidelberg . R. Bayer and E. McCreight. 2002. Organization and Maintenance of Large Ordered Indexes. Springer Berlin Heidelberg."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276318"},{"volume-title":"The X-tree: An Index Structure for High-Dimensional Data. In Proceedings of the 22th International Conference on Very Large Data Bases (VLDB '96)","author":"Berchtold Stefan","key":"e_1_3_2_1_3_1","unstructured":"Stefan Berchtold , Daniel A. Keim , and Hans-Peter Kriegel . {n. d.}. The X-tree: An Index Structure for High-Dimensional Data. In Proceedings of the 22th International Conference on Very Large Data Bases (VLDB '96) . Stefan Berchtold, Daniel A. Keim, and Hans-Peter Kriegel. {n. d.}. The X-tree: An Index Structure for High-Dimensional Data. In Proceedings of the 22th International Conference on Very Large Data Bases (VLDB '96)."},{"key":"e_1_3_2_1_4_1","volume-title":"Fundamentals of Database Indexing and Searching","author":"Bhattacharya Arnab","unstructured":"Arnab Bhattacharya . 2014. Fundamentals of Database Indexing and Searching ( 1 st ed.). Chapman & Hall\/CRC. Arnab Bhattacharya. 2014. Fundamentals of Database Indexing and Searching (1st ed.). Chapman & Hall\/CRC.","edition":"1"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"G. H. Golub and C. Reinsch. 1971. Singular Value Decomposition and Least Squares Solutions. Springer Berlin Heidelberg.  G. H. Golub and C. Reinsch. 1971. Singular Value Decomposition and Least Squares Solutions. Springer Berlin Heidelberg.","DOI":"10.1007\/978-3-662-39778-7_10"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1071610.1071612"},{"volume-title":"d.}. Principal Component Analysis","author":"Jolliffe I.T.","key":"e_1_3_2_1_8_1","unstructured":"I.T. Jolliffe . {n. d.}. Principal Component Analysis . Springer Berlin Heidelberg . I.T.Jolliffe. {n. d.}. Principal Component Analysis. Springer Berlin Heidelberg."},{"key":"e_1_3_2_1_9_1","unstructured":"Beng Chin Ooi Kian-Lee Tan Cui Yu and Stephane Bressan. 2000. Indexing the Edges---a Simple and Yet Efficient Approach to High-dimensional Indexing (PODS '00).  Beng Chin Ooi Kian-Lee Tan Cui Yu and Stephane Bressan. 2000. Indexing the Edges---a Simple and Yet Efficient Approach to High-dimensional Indexing (PODS '00)."},{"key":"e_1_3_2_1_10_1","volume-title":"Langford","author":"Tenenbaum Joshua B.","year":"2000","unstructured":"Joshua B. Tenenbaum , Vin de Silva , and John C . Langford . 2000 . A Global Geometric Framework for Nonlinear Dimensionality Reduction . (2000). Joshua B. Tenenbaum, Vin de Silva, and John C. Langford. 2000. A Global Geometric Framework for Nonlinear Dimensionality Reduction. (2000)."}],"event":{"name":"EuroPLoP '18: 23rd European Conference on Pattern Languages of Programs","sponsor":["Hillside Europe Hillside Europe"],"location":"Irsee Germany","acronym":"EuroPLoP '18"},"container-title":["Proceedings of the 23rd European Conference on Pattern Languages of Programs"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3282308.3282314","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3282308.3282314","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:02:11Z","timestamp":1750208531000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3282308.3282314"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,4]]},"references-count":10,"alternative-id":["10.1145\/3282308.3282314","10.1145\/3282308"],"URL":"https:\/\/doi.org\/10.1145\/3282308.3282314","relation":{},"subject":[],"published":{"date-parts":[[2018,7,4]]},"assertion":[{"value":"2018-07-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}