{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T13:47:30Z","timestamp":1766065650784,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2005,6,14]],"date-time":"2005-06-14T00:00:00Z","timestamp":1118707200000},"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":[[2005,6,14]]},"DOI":"10.1145\/1066157.1066240","type":"proceedings-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T08:31:47Z","timestamp":1123057907000},"page":"730-741","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":96,"title":["Towards effective indexing for very large video sequence database"],"prefix":"10.1145","author":[{"given":"Heng Tao","family":"Shen","sequence":"first","affiliation":[{"name":"The University of Queensland, Brisbane, Australia"}]},{"given":"Beng Chin","family":"Ooi","sequence":"additional","affiliation":[{"name":"National University of Singapore, Kent Ridge, Singapore"}]},{"given":"Xiaofang","family":"Zhou","sequence":"additional","affiliation":[{"name":"The University of Queensland, Brisbane, Australia"}]}],"member":"320","published-online":{"date-parts":[[2005,6,14]]},"reference":[{"unstructured":"http:\/\/www.virtualdub.org\/.  http:\/\/www.virtualdub.org\/.","key":"e_1_3_2_1_1_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1145\/276304.276318"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1145\/502807.502809"},{"key":"e_1_3_2_1_4_1","first-page":"89","volume-title":"VLDB","author":"Chakrabarti K.","year":"2000","unstructured":"K. Chakrabarti and S. Mehrotra . Local dimensionality reduction: A new approach to indexing high dimensional spaces . In VLDB , pages 89 -- 100 , 2000 . K. Chakrabarti and S. Mehrotra. Local dimensionality reduction: A new approach to indexing high dimensional spaces. In VLDB, pages 89--100, 2000."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1109\/76.809161"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1109\/TCSVT.2002.808080"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1109\/ICIP.2000.900897"},{"key":"e_1_3_2_1_9_1","volume-title":"Problem of hyperspace. In http: \/\/maths-express.ifrance.com\/mathsexpress\/articles\/voir\/hyperchevre.htm","author":"Jacquelin J.","year":"2004","unstructured":"J. Jacquelin . Problem of hyperspace. In http: \/\/maths-express.ifrance.com\/mathsexpress\/articles\/voir\/hyperchevre.htm , 2004 . J. Jacquelin. Problem of hyperspace. In http: \/\/maths-express.ifrance.com\/mathsexpress\/articles\/voir\/hyperchevre.htm, 2004."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.5555\/1316689.1316756"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1109\/ICDE.2003.1260784"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1145\/502585.502588"},{"key":"e_1_3_2_1_13_1","first-page":"188","volume-title":"Multimodal pattern matching for audio-visual query and retrieval","author":"Naphade M. R.","year":"2001","unstructured":"M. R. Naphade , R. Wang , and T. S. Huang . Multimodal pattern matching for audio-visual query and retrieval . In SPIE , pages 188 -- 195 , 2001 . M. R. Naphade, R. Wang, and T. S. Huang. Multimodal pattern matching for audio-visual query and retrieval. In SPIE, pages 188--195, 2001."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1109\/ICCV.2001.937653"},{"key":"e_1_3_2_1_15_1","first-page":"166","volume-title":"VLDB","author":"Yu C.","year":"2001","unstructured":"C. Yu , B. Ooi , K. Tan , and H. V. Jagadish . Indexing the distance: An efficient method to KNN processing . In VLDB , pages 166 -- 174 , 2001 . C. Yu, B. Ooi, K. Tan, and H. V. Jagadish. Indexing the distance: An efficient method to KNN processing. In VLDB, pages 166--174, 2001."}],"event":{"sponsor":["SIGMOD ACM Special Interest Group on Management of Data","ACM Association for Computing Machinery"],"acronym":"SIGMOD\/PODS05","name":"SIGMOD\/PODS05: International Conference on Management of Data and Symposium on Principles Database and Systems","location":"Baltimore Maryland"},"container-title":["Proceedings of the 2005 ACM SIGMOD international conference on Management of data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1066157.1066240","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1066157.1066240","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:08:19Z","timestamp":1750262899000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1066157.1066240"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,6,14]]},"references-count":14,"alternative-id":["10.1145\/1066157.1066240","10.1145\/1066157"],"URL":"https:\/\/doi.org\/10.1145\/1066157.1066240","relation":{},"subject":[],"published":{"date-parts":[[2005,6,14]]},"assertion":[{"value":"2005-06-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}