{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:00:28Z","timestamp":1750309228954,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T00:00:00Z","timestamp":1737331200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62402311"],"award-info":[{"award-number":["62402311"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,1,20]]},"DOI":"10.1145\/3658617.3697565","type":"proceedings-article","created":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T14:32:21Z","timestamp":1741098741000},"page":"594-600","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Exploiting Differential-Based Data Encoding for Enhanced Query Efficiency"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8769-293X","authenticated-orcid":false,"given":"Fangxin","family":"Liu","sequence":"first","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-2157-4927","authenticated-orcid":false,"given":"Zongwu","family":"Wang","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-4482-9760","authenticated-orcid":false,"given":"Peng","family":"Xu","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8086-6802","authenticated-orcid":false,"given":"Shiyuan","family":"Huang","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7353-8798","authenticated-orcid":false,"given":"Li","family":"Jiang","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,3,4]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Youtube-8m: A large-scale video classification benchmark. arXiv","author":"Abu-El-Haija Sami","year":"2016","unstructured":"Sami Abu-El-Haija, Nisarg Kothari, Joonseok Lee, Paul Natsev, George Toderici, Balakrishnan Varadarajan, and Sudheendra Vijayanarasimhan. 2016. Youtube-8m: A large-scale video classification benchmark. arXiv (2016)."},{"key":"e_1_3_2_1_2_1","unstructured":"Yanzhe An et al. 2022. {TVStore}: Automatically Bounding Time Series Storage via {Time-Varying} Compression. In FAST."},{"key":"e_1_3_2_1_3_1","volume-title":"42nd International Conference on Very Large Data Bases","volume":"9","author":"Andr\u00e9 Fabien","year":"2016","unstructured":"Fabien Andr\u00e9, Anne-Marie Kermarrec, and Nicolas Le Scouarnec. 2016. Cache locality is not enough: High-performance nearest neighbor search with product quantization fast scan. In 42nd International Conference on Very Large Data Bases, Vol. 9. 12."},{"key":"e_1_3_2_1_4_1","volume-title":"Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. 2055--2063","author":"Babenko Artem","year":"2016","unstructured":"Artem Babenko and Victor Lempitsky. 2016. Efficient indexing of billion-scale datasets of deep descriptors. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. 2055--2063."},{"key":"e_1_3_2_1_5_1","unstructured":"Tom Brown et al. 2020. Language models are few-shot learners. NIPS (2020)."},{"key":"e_1_3_2_1_6_1","volume-title":"Mark EJ Newman, and Cristopher Moore","author":"Clauset Aaron","year":"2004","unstructured":"Aaron Clauset, Mark EJ Newman, and Cristopher Moore. 2004. Finding community structure in very large networks. Physical review E 70, 6 (2004), 066111."},{"key":"e_1_3_2_1_7_1","unstructured":"Yann Collet et al. 2013. Lz4: Extremely fast compression algorithm. google.com (2013)."},{"key":"e_1_3_2_1_8_1","volume-title":"Bert: Pre-training of deep bidirectional transformers for language understanding. arXiv","author":"Devlin Jacob","year":"2018","unstructured":"Jacob Devlin, Ming-Wei Chang, Kenton Lee, and Kristina Toutanova. 2018. Bert: Pre-training of deep bidirectional transformers for language understanding. arXiv (2018)."},{"key":"e_1_3_2_1_9_1","volume-title":"Return of the lernaean hydra: Experimental evaluation of data series approximate similarity search. arXiv preprint arXiv:2006.11459","author":"Echihabi Karima","year":"2020","unstructured":"Karima Echihabi, Kostas Zoumpatianos, Themis Palpanas, and Houda Benbrahim. 2020. Return of the lernaean hydra: Experimental evaluation of data series approximate similarity search. arXiv preprint arXiv:2006.11459 (2020)."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Udit Gupta et al. 2020. The architectural implications of facebook's dnn-based personalized recommendation. In HPCA. IEEE 488--501.","DOI":"10.1109\/HPCA47549.2020.00047"},{"key":"e_1_3_2_1_11_1","volume-title":"Learning the k in k-means. Advances in neural information processing systems 16","author":"Hamerly Greg","year":"2003","unstructured":"Greg Hamerly and Charles Elkan. 2003. Learning the k in k-means. Advances in neural information processing systems 16 (2003)."},{"key":"e_1_3_2_1_12_1","first-page":"626","article-title":"Data compression using run length encoding and statistical encoding","volume":"4","author":"Hauck Edward L","year":"1986","unstructured":"Edward L Hauck. 1986. Data compression using run length encoding and statistical encoding. US Patent 4,626,829.","journal-title":"US Patent"},{"key":"e_1_3_2_1_13_1","volume-title":"Product quantization for nearest neighbor search","author":"Jegou Herve","year":"2010","unstructured":"Herve Jegou, Matthijs Douze, and Cordelia Schmid. 2010. Product quantization for nearest neighbor search. IEEE transactions on pattern analysis and machine intelligence 33, 1 (2010), 117--128."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.2203"},{"key":"e_1_3_2_1_15_1","unstructured":"Tsung-Yi Lin Piotr Doll\u00e1r Ross Girshick Kaiming He Bharath Hariharan and Serge Belongie. 2017. Feature pyramid networks for object detection. In CVPR."},{"key":"e_1_3_2_1_16_1","unstructured":"Yingfan Liu Hong Cheng and Jiangtao Cui. 2017. PQBF: i\/o-efficient approximate nearest neighbor search by product quantization. In CIKM."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056489"},{"key":"e_1_3_2_1_18_1","unstructured":"LZMA SDK. [Online]. https:\/\/www.7-zip.org\/sdk.html."},{"key":"e_1_3_2_1_19_1","volume-title":"Pqtable: Fast exact asymmetric distance neighbor search for product quantization using hash tables. In ICCV.","author":"Matsui Yusuke","year":"2015","unstructured":"Yusuke Matsui, Toshihiko Yamasaki, and Kiyoharu Aizawa. 2015. Pqtable: Fast exact asymmetric distance neighbor search for product quantization using hash tables. In ICCV."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Julian McAuley Christopher Targett Qinfeng Shi and Anton Van Den Hengel. 2015. Image-based recommendations on styles and substitutes. In SIGIR.","DOI":"10.1145\/2766462.2767755"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"Christian Szegedy et al. 2017. Inception-v4 inception-resnet and the impact of residual connections on learning. In AAAI.","DOI":"10.1609\/aaai.v31i1.11231"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Jizhe Wang et al. 2018. Billion-scale commodity embedding for e-commerce recommendation in alibaba. In SIGKDD.","DOI":"10.1145\/3219819.3219869"},{"key":"e_1_3_2_1_23_1","volume-title":"Semi-supervised hashing for large-scale search. TPMAI","author":"Wang Jun","year":"2012","unstructured":"Jun Wang, Sanjiv Kumar, and Shih-Fu Chang. 2012. Semi-supervised hashing for large-scale search. TPMAI (2012)."},{"key":"e_1_3_2_1_24_1","volume-title":"DeltaPQ: lossless product quantization code compression for high dimensional similarity search. VLDB","author":"Wang Runhui","year":"2020","unstructured":"Runhui Wang and Dong Deng. 2020. DeltaPQ: lossless product quantization code compression for high dimensional similarity search. VLDB (2020)."},{"key":"e_1_3_2_1_25_1","volume-title":"PPQ-trajectory: spatiotemporal quantization for querying in large trajectory repositories. arXiv","author":"Wang Shuang","year":"2020","unstructured":"Shuang Wang and Hakan Ferhatosmanoglu. 2020. PPQ-trajectory: spatiotemporal quantization for querying in large trajectory repositories. arXiv (2020)."}],"event":{"name":"ASPDAC '25: 30th Asia and South Pacific Design Automation Conference","sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEICE","IPSJ","IEEE CAS","IEEE CEDA"],"location":"Tokyo Japan","acronym":"ASPDAC '25"},"container-title":["Proceedings of the 30th Asia and South Pacific Design Automation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3658617.3697565","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3658617.3697565","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T23:44:19Z","timestamp":1750290259000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3658617.3697565"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,20]]},"references-count":25,"alternative-id":["10.1145\/3658617.3697565","10.1145\/3658617"],"URL":"https:\/\/doi.org\/10.1145\/3658617.3697565","relation":{},"subject":[],"published":{"date-parts":[[2025,1,20]]},"assertion":[{"value":"2025-03-04","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}