{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T16:40:06Z","timestamp":1786120806753,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":90,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,8,8]],"date-time":"2026-08-08T00:00:00Z","timestamp":1786147200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"NSF (National Science Foundation)","award":["2348919"],"award-info":[{"award-number":["2348919"]}]},{"name":"ANRF","award":["ANRF\/ECRG\/2024\/004976\/ENS"],"award-info":[{"award-number":["ANRF\/ECRG\/2024\/004976\/ENS"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,8,9]]},"DOI":"10.1145\/3770855.3817969","type":"proceedings-article","created":{"date-parts":[[2026,8,6]],"date-time":"2026-08-06T17:15:37Z","timestamp":1786036537000},"page":"791-802","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Random-Access Ranked Retrieval and Similarity Search"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-1687-8012","authenticated-orcid":false,"given":"Mohsen","family":"Dehghankar","sequence":"first","affiliation":[{"name":"University of Illinois Chicago, Chicago, Illinois, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5251-6186","authenticated-orcid":false,"given":"Abolfazl","family":"Asudeh","sequence":"additional","affiliation":[{"name":"University of Illinois Chicago, Chicago, Illinois, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4705-0123","authenticated-orcid":false,"given":"Raghav","family":"Mittal","sequence":"additional","affiliation":[{"name":"University of Texas at Arlington, Arlington, Texas, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9166-2365","authenticated-orcid":false,"given":"Suraj","family":"Shetiya","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology, Bombay, Mumbai, Maharastra, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4627-9065","authenticated-orcid":false,"given":"Gautam","family":"Das","sequence":"additional","affiliation":[{"name":"University of Texas at Arlington, Arlington, Texas, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,8,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1201\/9781420035315.ch36"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100260"},{"key":"e_1_3_2_1_3_1","volume-title":"Fairsight: Visual analytics for fairness in decision making","author":"Ahn Yongsu","year":"2019","unstructured":"Yongsu Ahn and Yu-Ru Lin. 2019. Fairsight: Visual analytics for fairness in decision making. IEEE transactions on visualization and computer graphics, Vol. 26, 1 (2019), 1086-1095."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327494"},{"key":"e_1_3_2_1_5_1","volume-title":"A gentle introduction to conformal prediction and distribution-free uncertainty quantification. arXiv preprint arXiv:2107.07511","author":"Angelopoulos Anastasios N","year":"2021","unstructured":"Anastasios N Angelopoulos and Stephen Bates. 2021. A gentle introduction to conformal prediction and distribution-free uncertainty quantification. arXiv preprint arXiv:2107.07511 (2021)."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Martin Aum\u00fcller Erik Bernhardsson and Alexander Faithfull. 2018. ANN-Benchmarks: A Benchmarking Tool for Approximate Nearest Neighbor Algorithms. arXiv:1807.05614 [cs.IR] https:\/\/arxiv.org\/abs\/1807.05614","DOI":"10.1007\/978-3-319-68474-1_3"},{"key":"e_1_3_2_1_7_1","unstructured":"Alex Auvolat et al. 2015. Clustering is efficient for approximate maximum inner product search. arXiv preprint arXiv:1507.05910 (2015)."},{"key":"e_1_3_2_1_8_1","volume-title":"Proceedings of the 8th ACM Conference on Recommender systems. 257-264","author":"Yoram","unstructured":"Yoram Bachrach et al., 2014. Speeding up the xbox recommender system using a euclidean transformation for inner-product spaces. In Proceedings of the 8th ACM Conference on Recommender systems. 257-264."},{"key":"e_1_3_2_1_9_1","unstructured":"R Ricardo Baeza-Yates et al. 1999. Modern information retrieval. ACM Press."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1051\/ita:2007046"},{"key":"e_1_3_2_1_11_1","volume-title":"On a Notion of Outliers Based on Ratios of Order Statistics. arXiv preprint arXiv:2207.13068","author":"Balcio\u011flu Ahmet Zahid","year":"2022","unstructured":"Ahmet Zahid Balcio\u011flu and O\u011fuz G\u00fcrerk. 2022. On a Notion of Outliers Based on Ratios of Order Statistics. arXiv preprint arXiv:2207.13068 (2022)."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3749116.3749133"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(73)80033-9"},{"key":"e_1_3_2_1_15_1","volume-title":"The anatomy of a large-scale hypertextual web search engine. Computer networks and ISDN systems","author":"Brin Sergey","year":"1998","unstructured":"Sergey Brin and Lawrence Page. 1998. The anatomy of a large-scale hypertextual web search engine. Computer networks and ISDN systems, Vol. 30, 1-7 (1998), 107-117."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3707448"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/792550.792552"},{"key":"e_1_3_2_1_18_1","first-page":"369","article-title":"Evaluating top-k queries over Web-accessible databases","author":"Bruno N.","year":"2002","unstructured":"N. Bruno, L. Gravano, and A. Marian. 2002. Evaluating top-k queries over Web-accessible databases. In IEEE ICDE. 369-380.","journal-title":"IEEE ICDE."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3578517"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/335191.335433"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-1989-1001852-0"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/507108"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840440"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01934990"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.14778\/3611540.3611613"},{"key":"e_1_3_2_1_26_1","volume-title":"Introduction to algorithms","author":"Cormen Thomas H","unstructured":"Thomas H Cormen, Charles E Leiserson, Ronald L Rivest, and Clifford Stein. 2022. Introduction to algorithms. MIT press."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3452021.3458323"},{"key":"e_1_3_2_1_28_1","unstructured":"W Bruce Croft Donald Metzler Trevor Strohman et al. 2010. Search engines: Information retrieval in practice. Vol. 520. Addison-Wesley Reading."},{"key":"e_1_3_2_1_29_1","first-page":"789","article-title":"Top-k Algorithms and Applications","author":"Das Gautam","year":"2009","unstructured":"Gautam Das. 2009. Top-k Algorithms and Applications. In DASFAA. 789-792.","journal-title":"DASFAA."},{"key":"e_1_3_2_1_30_1","unstructured":"Gautam Das Dimitrios Gunopulos Nick Koudas and Dimitris Tsirogiannis. 2006. Answering top-k queries using views. In VLDB. 451\u2013462."},{"key":"e_1_3_2_1_31_1","volume-title":"Mirrokni","author":"Datar Mayur","year":"2004","unstructured":"Mayur Datar, Nicole Immorlica, Piotr Indyk, and Vahab S. Mirrokni. 2004. Locality-sensitive hashing scheme based on p-stable distributions. In SCG. 253\u2013262."},{"key":"e_1_3_2_1_32_1","volume-title":"HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search. CoRR, abs\/2505.17368","author":"Dehghankar Mohsen","year":"2025","unstructured":"Mohsen Dehghankar and Abolfazl Asudeh. 2025. HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search. CoRR, abs\/2505.17368 (2025)."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","unstructured":"Mohsen Dehghankar Abolfazl Asudeh Raghav Mittal Suraj Shetiya and Gautam Das. 2025. Random-Access Ranked Retrieval and Similarity Search. https:\/\/doi.org\/10.48550\/arXiv.2508.01108 arXiv:2508.01108 [cs.DS] Accepted at KDD'26.","DOI":"10.48550\/arXiv.2508.01108"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-52921-7_66"},{"key":"e_1_3_2_1_35_1","unstructured":"Matthijs Douze Alexandr Guzhva Chengqi Deng Jeff Johnson Gergely Szilvasy Pierre-Emmanuel Mazar\u00e9 Maria Lomeli Lucas Hosseini and Herv\u00e9 J\u00e9gou. 2024. The Faiss library. (2024). arXiv:2401.08281 [cs.LG]"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/28905"},{"key":"e_1_3_2_1_37_1","volume-title":"Direct access for answers to conjunctive queries with aggregation. arXiv preprint arXiv:2303.05327","author":"Eldar Idan","year":"2023","unstructured":"Idan Eldar, Nofar Carmeli, and Benny Kimelfeld. 2023. Direct access for answers to conjunctive queries with aggregation. arXiv preprint arXiv:2303.05327 (2023)."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"crossref","unstructured":"Ronald Fagin Amnon Lotem and Moni Naor. 2001. Optimal aggregation algorithms for middleware. In ACM PODS. 102\u2013113.","DOI":"10.1145\/375551.375567"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.14778\/3303753.3303754"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.14778\/3551793.3551822"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/376284.375670"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/971697.602266"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"crossref","unstructured":"Sariel Har-Peled. 2011. Geometric approximation algorithms. Number 173. American Mathematical Soc.","DOI":"10.1090\/surv\/173"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/10515.10522"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-003-0099-8"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/1391729.1391730"},{"key":"e_1_3_2_1_47_1","volume-title":"Comput. Surveys","volume":"40","author":"Ihab","year":"2008","unstructured":"Ihab F. Ilyas et al., 2008b. A survey of top-k query processing techniques in relational database systems. Comput. Surveys, Vol. 40, 4, Article 11 (2008)."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"crossref","unstructured":"Piotr Indyk and Rajeev Motwani. 1998. Approximate nearest neighbors: towards removing the curse of dimensionality. In ACM STOC. 604\u2013613.","DOI":"10.1145\/276698.276876"},{"key":"e_1_3_2_1_49_1","volume-title":"Khandker Mushfiqul Islam, and Chidambaram Crushev","author":"Jafari Omid","year":"2021","unstructured":"Omid Jafari, Preeti Maurya, Parth Nagarkar, Khandker Mushfiqul Islam, and Chidambaram Crushev. 2021. A survey on locality sensitive hashing algorithms and their applications. arXiv preprint arXiv:2102.08942 (2021)."},{"key":"e_1_3_2_1_50_1","volume-title":"Ravishankar Krishnawamy, and Rohan Kadekodi.","author":"Subramanya Suhas Jayaram","year":"2019","unstructured":"Suhas Jayaram Subramanya, Fnu Devvrit, Harsha Vardhan Simhadri, Ravishankar Krishnawamy, and Rohan Kadekodi. 2019. DiskANN: Fast Accurate Billion-point Nearest Neighbor Search on a Single Node. In NeurIPS, Vol. 32."},{"key":"e_1_3_2_1_51_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, Vol. 33, 1 (2010), 117-128."},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2019.2921572"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"key":"e_1_3_2_1_54_1","first-page":"71","article-title":"Optimal quantile approximation in streams. In 2016 ieee 57th annual symposium on foundations of computer science (focs)","author":"Karnin Zohar","year":"2016","unstructured":"Zohar Karnin, Kevin Lang, and Edo Liberty. 2016. Optimal quantile approximation in streams. In 2016 ieee 57th annual symposium on foundations of computer science (focs). IEEE, 71-78.","journal-title":"IEEE"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"crossref","unstructured":"Thomas Kluyver et al. 2016. Jupyter Notebooks-a publishing format for reproducible computational workflows. In Positioning and power in academic publishing: Players agents and agendas. IOS press 87-90.","DOI":"10.3233\/978-1-61499-649-1-87"},{"key":"e_1_3_2_1_56_1","unstructured":"Stefano Leone. 2022. FIFA 23 Player Dataset. https:\/\/www.kaggle.com\/datasets\/stefanoleone992\/fifa-23-complete-player-dataset. Accessed: 2025-07-31."},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871481"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1109\/SocialCom.2010.23"},{"key":"e_1_3_2_1_59_1","volume-title":"European Conference on Computer Vision. Springer, 258-275","author":"Liu Zhonghang","year":"2024","unstructured":"Zhonghang Liu, Panzhong Lu, Guoyang Xie, Zhichao Lu, and Wen-Yan Lin. 2024. Rethinking unsupervised outlier detection via multiple thresholding. In European Conference on Computer Vision. Springer, 258-275."},{"key":"e_1_3_2_1_60_1","volume-title":"Zhe Wang, Moses Charikar, and Kai Li.","author":"Lv Qin","year":"2007","unstructured":"Qin Lv, William Josephson, Zhe Wang, Moses Charikar, and Kai Li. 2007. Multi-probe LSH: efficient indexing for high-dimensional similarity search. In VLDB. 950\u2013961."},{"key":"e_1_3_2_1_61_1","first-page":"94871","article-title":"Spreadsheetbench: Towards challenging real world spreadsheet manipulation","volume":"37","author":"Zeyao Ma","year":"2024","unstructured":"Zeyao Ma et al., 2024. Spreadsheetbench: Towards challenging real world spreadsheet manipulation. Advances in Neural Information Processing Systems, Vol. 37 (2024), 94871-94908.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2013.10.006"},{"key":"e_1_3_2_1_63_1","volume-title":"Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs","author":"Malkov Yu A","year":"2018","unstructured":"Yu A Malkov and Dmitry A Yashunin. 2018. Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs. IEEE transactions on pattern analysis and machine intelligence, Vol. 42, 4 (2018), 824-836."},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/109648.109649"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1016\/0925-7721(92)90006-E"},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/3626772.3657864"},{"key":"e_1_3_2_1_67_1","unstructured":"Ananay Mital. 2020. US Used Cars Dataset. https:\/\/www.kaggle.com\/datasets\/ananaymital\/us-used-cars-dataset. Accessed: 2025-07-31."},{"key":"e_1_3_2_1_68_1","unstructured":"Stephen M Omohundro. 1989. Five balltree construction algorithms. (1989)."},{"key":"e_1_3_2_1_69_1","volume-title":"Pagination And Its Efficient Methods For RESTful Web Services. In 2021 IEEE 3rd Ukraine Conference on Electrical and Computer Engineering (UKRCON). IEEE, 567-571","author":"Orlivskyi Serhii","year":"2021","unstructured":"Serhii Orlivskyi, Bohdan Deomin, and Olga Averianova. 2021. Pagination And Its Efficient Methods For RESTful Web Services. In 2021 IEEE 3rd Ukraine Conference on Electrical and Computer Engineering (UKRCON). IEEE, 567-571."},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-024-00864-x"},{"key":"e_1_3_2_1_71_1","first-page":"1532","article-title":"GloVe","author":"Pennington Jeffrey","year":"2014","unstructured":"Jeffrey Pennington, Richard Socher, and Christopher D. Manning. 2014. GloVe: Global Vectors for Word Representation. In Empirical Methods in Natural Language Processing (EMNLP). 1532-1543. http:\/\/www.aclweb.org\/anthology\/D14-1162","journal-title":"Global Vectors for Word Representation. In Empirical Methods in Natural Language Processing (EMNLP)."},{"key":"e_1_3_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.5555\/4333"},{"key":"e_1_3_2_1_73_1","volume-title":"Proceedings of the 2020 ACM SIGMOD. 1589-1599","author":"Sajjadur","unstructured":"Sajjadur Rahman et al., 2020. Benchmarking spreadsheet systems. In Proceedings of the 2020 ACM SIGMOD. 1589-1599."},{"key":"e_1_3_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.62273\/VAHK7880"},{"key":"e_1_3_2_1_75_1","doi-asserted-by":"crossref","unstructured":"Francesco Ricci et al. 2021. Recommender systems: Techniques applications and challenges. Recommender systems handbook (2021) 1-35.","DOI":"10.1007\/978-1-0716-2197-4_1"},{"key":"e_1_3_2_1_76_1","article-title":"A tutorial on conformal prediction","volume":"9","author":"Shafer Glenn","year":"2008","unstructured":"Glenn Shafer and Vladimir Vovk. 2008. A tutorial on conformal prediction. Journal of Machine Learning Research, Vol. 9, 3 (2008).","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.14778\/3565838.3565855"},{"key":"e_1_3_2_1_78_1","volume-title":"Advances in neural information processing systems","author":"Shrivastava Anshumali","year":"2014","unstructured":"Anshumali Shrivastava and Ping Li. 2014. Asymmetric LSH (ALSH) for sublinear time maximum inner product search (MIPS). Advances in neural information processing systems, Vol. 27 (2014)."},{"key":"e_1_3_2_1_79_1","doi-asserted-by":"publisher","DOI":"10.1145\/1031495.1031524"},{"key":"e_1_3_2_1_80_1","unstructured":"Parsharam Reddy Sudda. 2024. Optimizing PHP API calls with pagination and caching. (2024)."},{"key":"e_1_3_2_1_81_1","doi-asserted-by":"crossref","unstructured":"Martin Theobald Gerhard Weikum and Ralf Schenkel. 2004. Top-k query evaluation with probabilistic guarantees. In VLDB. 648\u2013659.","DOI":"10.1016\/B978-012088469-8.50058-9"},{"key":"e_1_3_2_1_82_1","doi-asserted-by":"publisher","DOI":"10.1016\/0031-3203(80)90066-7"},{"key":"e_1_3_2_1_83_1","doi-asserted-by":"publisher","DOI":"10.1145\/3703922.3703924"},{"key":"e_1_3_2_1_84_1","unstructured":"Bureau of Transportation Statistics U.S. Department of Transportation. n.d.. Flight Delays and Cancellations. https:\/\/www.kaggle.com\/datasets\/usdot\/flight-delays?select=flights.csv. Accessed: 2025-10-04."},{"key":"e_1_3_2_1_85_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21852-6_3"},{"key":"e_1_3_2_1_86_1","volume-title":"A comprehensive survey and experimental comparison of graph-based approximate nearest neighbor search. arXiv preprint arXiv:2101.12631","author":"Wang Mengzhao","year":"2021","unstructured":"Mengzhao Wang, Xiaoliang Xu, Qiang Yue, and Yuxiang Wang. 2021. A comprehensive survey and experimental comparison of graph-based approximate nearest neighbor search. arXiv preprint arXiv:2101.12631 (2021)."},{"key":"e_1_3_2_1_87_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0038202"},{"key":"e_1_3_2_1_88_1","unstructured":"Han Xiao Kashif Rasul and Roland Vollgraf. 2017. Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithms. arXiv:cs.LG\/1708.07747 [cs.LG]"},{"key":"e_1_3_2_1_89_1","volume-title":"Proceedings of the Workshop on Human-In-the-Loop Data Analytics. 1-3.","author":"Jinjin","unstructured":"Jinjin Zhao et al., 2023. Data Makes Better Data Scientists. In Proceedings of the Workshop on Human-In-the-Loop Data Analytics. 1-3."},{"key":"e_1_3_2_1_90_1","volume-title":"Approximation-First Timeseries Monitoring Query At Scale. arXiv preprint arXiv:2505.10560","author":"Zhu Zeying","year":"2025","unstructured":"Zeying Zhu, Jonathan Chamberlain, Kenny Wu, David Starobinski, and Zaoxing Liu. 2025. Approximation-First Timeseries Monitoring Query At Scale. arXiv preprint arXiv:2505.10560 (2025)."}],"event":{"name":"KDD '26: The 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Jeju Island Republic of Korea","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2"],"original-title":[],"deposited":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T01:13:09Z","timestamp":1786065189000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3770855.3817969"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8,8]]},"references-count":90,"alternative-id":["10.1145\/3770855.3817969","10.1145\/3770855"],"URL":"https:\/\/doi.org\/10.1145\/3770855.3817969","relation":{},"subject":[],"published":{"date-parts":[[2026,8,8]]},"assertion":[{"value":"2026-08-08","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}