{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T20:18:59Z","timestamp":1778271539795,"version":"3.51.4"},"publisher-location":"Singapore","reference-count":26,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819203628","type":"print"},{"value":"9789819203635","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-981-92-0363-5_40","type":"book-chapter","created":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T19:49:04Z","timestamp":1778269744000},"page":"656-672","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Giant: An I\/O-Optimized Graph-Based Index for\u00a0High-dimensional Vector Search via\u00a0Page Group Expansion"],"prefix":"10.1007","author":[{"given":"Jiawei","family":"Du","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinlei","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chengxiao","family":"Gong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianxi","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,9]]},"reference":[{"key":"40_CR1","unstructured":"Baranchuk, D., Babenko, A.: Benchmarks for billion-scale similarity search. Webpage (2021). Retrieved March 16, 2023"},{"key":"40_CR2","doi-asserted-by":"crossref","unstructured":"Baranchuk, D., Babenko, A., Malkov, Y.: Revisiting the inverted indices for billion-scale approximate nearest neighbors. In: Proceedings of the European Conference on Computer Vision (ECCV), pp. 202\u2013216 (2018)","DOI":"10.1007\/978-3-030-01258-8_13"},{"key":"40_CR3","first-page":"5199","volume":"34","author":"Q Chen","year":"2021","unstructured":"Chen, Q., Zhao, B., Wang, H., Li, M., Liu, C., Li, Z., Yang, M., Wang, J.: Spann: highly-efficient billion-scale approximate nearest neighborhood search. Adv. Neural. Inf. Process. Syst. 34, 5199\u20135212 (2021)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"40_CR4","doi-asserted-by":"crossref","unstructured":"Dong, W., Moses, C., Li, K.: Efficient k-nearest neighbor graph construction for generic similarity measures. In: Proceedings of the 20th International Conference on World Wide Web, pp. 577\u2013586 (2011)","DOI":"10.1145\/1963405.1963487"},{"issue":"8","key":"40_CR5","first-page":"4139","volume":"44","author":"C Fu","year":"2021","unstructured":"Fu, C., Wang, C., Cai, D.: High dimensional similarity search with satellite system graph: efficiency, scalability, and unindexed query compatibility. IEEE Trans. Pattern Anal. Mach. Intell. 44(8), 4139\u20134150 (2021)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"40_CR6","unstructured":"Fu, C., Xiang, C., Wang, C., Cai, D.: Fast approximate nearest neighbor search with the navigating spreading-out graph. arXiv preprint arXiv:1707.00143 (2017)"},{"issue":"3","key":"40_CR7","first-page":"1","volume":"3","author":"J Gao","year":"2025","unstructured":"Gao, J., Gou, Y., Xu, Y., Yang, Y., Long, C., Wong, R.C.W.: Practical and asymptotically optimal quantization of high-dimensional vectors in Euclidean space for approximate nearest neighbor search. Proc. ACM Manage. Data 3(3), 1\u201326 (2025)","journal-title":"Proc. ACM Manage. Data"},{"issue":"3","key":"40_CR8","first-page":"1","volume":"2","author":"J Gao","year":"2024","unstructured":"Gao, J., Long, C.: RABITQ: quantizing high-dimensional vectors with a theoretical error bound for approximate nearest neighbor search. Proc. ACM Manage. Data 2(3), 1\u201327 (2024)","journal-title":"Proc. ACM Manage. Data"},{"key":"40_CR9","unstructured":"Guo, H., Lu, Y.: Achieving $$\\{$$Low-Latency$$\\}$$$$\\{$$Graph-Based$$\\}$$ vector search via aligning $$\\{$$Best-First$$\\}$$ search algorithm with $$\\{$$SSD$$\\}$$. In: 19th USENIX Symposium on Operating Systems Design and Implementation (OSDI 25), pp. 171\u2013186 (2025)"},{"issue":"9","key":"40_CR10","doi-asserted-by":"publisher","first-page":"2198","DOI":"10.14778\/3665844.3665851","volume":"17","author":"H Hu","year":"2024","unstructured":"Hu, H., Qiu, J., Wang, H., Liang, B., Zou, S.: DIDS: double indices and double summarizations for fast similarity search. Proc. VLDB Endow. 17(9), 2198\u20132211 (2024)","journal-title":"Proc. VLDB Endow."},{"issue":"1","key":"40_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.14778\/2850469.2850470","volume":"9","author":"Q Huang","year":"2015","unstructured":"Huang, Q., Feng, J., Zhang, Y., Fang, Q., Ng, W.: Query-aware locality-sensitive hashing for approximate nearest neighbor search. Proc. VLDB Endow. 9(1), 1\u201312 (2015)","journal-title":"Proc. VLDB Endow."},{"key":"40_CR12","unstructured":"Jang, J., Choi, H., Bae, H., Lee, S., Kwon, M., Jung, M.: $$\\{$$CXL-ANNS$$\\}$$:$$\\{$$Software-Hardware$$\\}$$ collaborative memory disaggregation and computation for $$\\{$$Billion-Scale$$\\}$$ approximate nearest neighbor search. In: 2023 USENIX Annual Technical Conference (USENIX ATC 23), pp. 585\u2013600 (2023)"},{"key":"40_CR13","unstructured":"Jayaram\u00a0Subramanya, S., Devvrit, F., Simhadri, H.V., Krishnawamy, R., Kadekodi, R.: DISKANN: fast accurate billion-point nearest neighbor search on a single node. In: Advances in Neural Information Processing Systems, vol. 32 (2019)"},{"issue":"10","key":"40_CR14","doi-asserted-by":"publisher","first-page":"2525","DOI":"10.14778\/3603581.3603592","volume":"16","author":"K Lampropoulos","year":"2023","unstructured":"Lampropoulos, K., Zardbani, F., Mamoulis, N., Karras, P.: Adaptive indexing in high-dimensional metric spaces. Proc. VLDB Endow. 16(10), 2525\u20132537 (2023)","journal-title":"Proc. VLDB Endow."},{"issue":"9","key":"40_CR15","doi-asserted-by":"publisher","first-page":"745","DOI":"10.14778\/2732939.2732947","volume":"7","author":"Y Liu","year":"2014","unstructured":"Liu, Y., Cui, J., Huang, Z., Li, H., Shen, H.T.: SK-LSH: an efficient index structure for approximate nearest neighbor search. Proc. VLDB Endow. 7(9), 745\u2013756 (2014)","journal-title":"Proc. VLDB Endow."},{"key":"40_CR16","first-page":"33403","volume":"36","author":"Z Lu","year":"2023","unstructured":"Lu, Z., Chen, J., Lian, D., Zhang, Z., Ge, Y., Chen, E.: Knowledge distillation for high dimensional search index. Adv. Neural. Inf. Process. Syst. 36, 33403\u201333419 (2023)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"issue":"4","key":"40_CR17","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1109\/TPAMI.2018.2889473","volume":"42","author":"YA Malkov","year":"2018","unstructured":"Malkov, Y.A., Yashunin, D.A.: Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs. IEEE Trans. Pattern Anal. Mach. Intell. 42(4), 824\u2013836 (2018)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"40_CR18","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.is.2013.10.006","volume":"45","author":"Y Malkov","year":"2014","unstructured":"Malkov, Y., Ponomarenko, A., Logvinov, A., Krylov, V.: Approximate nearest neighbor algorithm based on navigable small world graphs. Inf. Syst. 45, 61\u201368 (2014)","journal-title":"Inf. Syst."},{"issue":"11","key":"40_CR19","doi-asserted-by":"publisher","first-page":"2227","DOI":"10.1109\/TPAMI.2014.2321376","volume":"36","author":"M Muja","year":"2014","unstructured":"Muja, M., Lowe, D.G.: Scalable nearest neighbor algorithms for high dimensional data. IEEE Trans. Pattern Anal. Mach. Intell. 36(11), 2227\u20132240 (2014)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"40_CR20","unstructured":"Priem, J., Piwowar, H., Orr, R.: OpenAlex: a fully-open index of scholarly works, authors, venues, institutions, and concepts. arXiv preprint arXiv:2205.01833 (2022)"},{"key":"40_CR21","unstructured":"Schuhmann, C., et al.: LAION-400M: open dataset of clip-filtered 400 million image-text pairs. arXiv preprint arXiv:2111.02114 (2021)"},{"key":"40_CR22","unstructured":"Tian, B., Liu, H., Duan, Z., Liao, X., Jin, H., Zhang, Y.: Scalable billion-point approximate nearest neighbor search using SmartSSDs (2024). https:\/\/www.usenix.org\/conference\/atc24\/presentation\/tian"},{"key":"40_CR23","unstructured":"Tian, B., et al.: Towards high-throughput and low-latency billion-scale vector search via CPU\/GPU collaborative filtering and re-ranking, pp. 171\u2013185 (2025). https:\/\/www.usenix.org\/conference\/fast25\/presentation\/tian-bing, gSCC: 0000000"},{"key":"40_CR24","doi-asserted-by":"crossref","unstructured":"Tian, Y., Zhao, X., Zhou, X.: DB-LSH 2.0: locality-sensitive hashing with query-based dynamic bucketing. IEEE Trans. Knowl. Data Eng. 36(3), 1000\u20131015 (2023)","DOI":"10.1109\/TKDE.2023.3295831"},{"key":"40_CR25","unstructured":"Wang, L., Yang, N., Huang, X., Yang, L., Majumder, R., Wei, F.: Multilingual E5 text embeddings: a technical report. arXiv preprint arXiv:2402.05672 (2024)"},{"issue":"1","key":"40_CR26","first-page":"1","volume":"2","author":"M Wang","year":"2024","unstructured":"Wang, M., et al.: Starling: an I\/O-efficient disk-resident graph index framework for high-dimensional vector similarity search on data segment. Proc. ACM Manage. Data 2(1), 1\u201327 (2024)","journal-title":"Proc. ACM Manage. Data"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-92-0363-5_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T19:49:10Z","timestamp":1778269750000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-92-0363-5_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819203628","9789819203635"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-981-92-0363-5_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"9 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"DASFAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database Systems for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jeju","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Korea (Republic of)","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 April 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 April 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dasfaa2026.github.io\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}