{"id":"https://openalex.org/W4414199184","doi":"https://doi.org/10.1109/dac63849.2025.11132788","title":"GraphAccel: An In-Storage Accelerator for Efficient Graph-Based Vector Similarity Search Using Page Packing and Speculative Search Optimization","display_name":"GraphAccel: An In-Storage Accelerator for Efficient Graph-Based Vector Similarity Search Using Page Packing and Speculative Search Optimization","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W4414199184","doi":"https://doi.org/10.1109/dac63849.2025.11132788"},"language":"en","primary_location":{"id":"doi:10.1109/dac63849.2025.11132788","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dac63849.2025.11132788","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 62nd ACM/IEEE Design Automation Conference (DAC)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5001343991","display_name":"Yonghwi Kwon","orcid":"https://orcid.org/0000-0001-5902-7900"},"institutions":[{"id":"https://openalex.org/I848706","display_name":"Sungkyunkwan University","ror":"https://ror.org/04q78tk20","country_code":"KR","type":"education","lineage":["https://openalex.org/I848706"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Yoonyoung Kwon","raw_affiliation_strings":["Sungkyunkwan University,Suwon,Korea"],"affiliations":[{"raw_affiliation_string":"Sungkyunkwan University,Suwon,Korea","institution_ids":["https://openalex.org/I848706"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5119620396","display_name":"Yunjong Boo","orcid":null},"institutions":[{"id":"https://openalex.org/I848706","display_name":"Sungkyunkwan University","ror":"https://ror.org/04q78tk20","country_code":"KR","type":"education","lineage":["https://openalex.org/I848706"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Yunjong Boo","raw_affiliation_strings":["Sungkyunkwan University,Suwon,Korea"],"affiliations":[{"raw_affiliation_string":"Sungkyunkwan University,Suwon,Korea","institution_ids":["https://openalex.org/I848706"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061945152","display_name":"Hyungmin Cho","orcid":"https://orcid.org/0000-0001-8705-7066"},"institutions":[{"id":"https://openalex.org/I848706","display_name":"Sungkyunkwan University","ror":"https://ror.org/04q78tk20","country_code":"KR","type":"education","lineage":["https://openalex.org/I848706"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Hyungmin Cho","raw_affiliation_strings":["Sungkyunkwan University,Suwon,Korea"],"affiliations":[{"raw_affiliation_string":"Sungkyunkwan University,Suwon,Korea","institution_ids":["https://openalex.org/I848706"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5001343991"],"corresponding_institution_ids":["https://openalex.org/I848706"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.3590043,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12016","display_name":"Web Data Mining and Analysis","score":0.9729999899864197,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12016","display_name":"Web Data Mining and Analysis","score":0.9729999899864197,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.964900016784668,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9623000025749207,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.6446999907493591},{"id":"https://openalex.org/keywords/similarity","display_name":"Similarity (geometry)","score":0.5131999850273132},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.4507000148296356},{"id":"https://openalex.org/keywords/support-vector-machine","display_name":"Support vector machine","score":0.38839998841285706},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3693999946117401},{"id":"https://openalex.org/keywords/bit-array","display_name":"Bit array","score":0.36550000309944153}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7064999938011169},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.6446999907493591},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.5131999850273132},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4507000148296356},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.41609999537467957},{"id":"https://openalex.org/C12267149","wikidata":"https://www.wikidata.org/wiki/Q282453","display_name":"Support vector machine","level":2,"score":0.38839998841285706},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3693999946117401},{"id":"https://openalex.org/C150807984","wikidata":"https://www.wikidata.org/wiki/Q1992074","display_name":"Bit array","level":3,"score":0.36550000309944153},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.35910001397132874},{"id":"https://openalex.org/C97854310","wikidata":"https://www.wikidata.org/wiki/Q19541","display_name":"Search engine","level":2,"score":0.35199999809265137},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.34380000829696655},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.336899995803833},{"id":"https://openalex.org/C33925742","wikidata":"https://www.wikidata.org/wiki/Q361698","display_name":"Page","level":2,"score":0.32089999318122864},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.29820001125335693},{"id":"https://openalex.org/C143271835","wikidata":"https://www.wikidata.org/wiki/Q254515","display_name":"Similitude","level":2,"score":0.2802000045776367},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.25529998540878296}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/dac63849.2025.11132788","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dac63849.2025.11132788","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 62nd ACM/IEEE Design Automation Conference (DAC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320671","display_name":"National Research Foundation","ror":"https://ror.org/05s0g1g46"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1544971428","https://openalex.org/W1978112828","https://openalex.org/W2062118960","https://openalex.org/W2124509324","https://openalex.org/W2132234208","https://openalex.org/W2468923260","https://openalex.org/W2891983271","https://openalex.org/W2949251802","https://openalex.org/W2952866723","https://openalex.org/W2963265099","https://openalex.org/W2963469388","https://openalex.org/W2963804743","https://openalex.org/W3136507013","https://openalex.org/W3155143326","https://openalex.org/W3205970722","https://openalex.org/W4214821564","https://openalex.org/W4293024115","https://openalex.org/W4386763970","https://openalex.org/W4394999019"],"related_works":[],"abstract_inverted_index":{"Graph-based":[0],"search":[1,20,64,87],"for":[2,40],"approximate":[3],"vector":[4,19,43],"similarity":[5,44],"is":[6],"essential":[7],"in":[8],"AI":[9],"applications,":[10],"such":[11],"as":[12],"retrieval-augmented":[13],"generation.":[14],"To":[15],"support":[16],"large-scale":[17],"searches,":[18],"graphs":[21],"are":[22],"often":[23],"stored":[24],"on":[25],"storage":[26],"devices":[27],"like":[28],"SSDs.":[29],"In":[30],"this":[31],"paper,":[32],"we":[33],"introduce":[34],"GraphAccel,":[35],"an":[36,49],"in-storage":[37],"accelerator":[38],"optimized":[39,50],"efficient":[41],"graph-based":[42],"search.":[45],"Our":[46],"architecture":[47],"incorporates":[48],"page":[51,57],"packing":[52],"mechanism":[53],"to":[54],"reduce":[55],"SSD":[56,71],"accesses":[58],"per":[59],"query,":[60],"alongside":[61],"a":[62],"speculative":[63],"scheme":[65],"that":[66],"maximizes":[67],"utilization":[68],"of":[69],"idle":[70],"chips":[72],"and":[73,91],"channels.":[74],"Through":[75],"these":[76],"optimizations,":[77],"GraphAccel":[78],"achieves":[79],"notable":[80],"performance":[81],"improvements":[82],"over":[83],"existing":[84],"SSD-based":[85],"graph":[86],"solutions,":[88],"including":[89],"DiskANN":[90],"DiskANN++.":[92]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-10T00:00:00"}