{"id":"https://openalex.org/W7155568651","doi":"https://doi.org/10.48550/arxiv.2604.21645","title":"Large-Scale Data Parallelization of Product Quantization and Inverted Indexing Using Dask","display_name":"Large-Scale Data Parallelization of Product Quantization and Inverted Indexing Using Dask","publication_year":2026,"publication_date":"2026-04-23","ids":{"openalex":"https://openalex.org/W7155568651","doi":"https://doi.org/10.48550/arxiv.2604.21645"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.21645","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.21645","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.21645","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032169179","display_name":"Ashley N Abraham","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Abraham, Ashley N.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5134519782","display_name":"Andrew Strelzoff","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Strelzoff, Andrew","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033441389","display_name":"Haley Dozier","orcid":"https://orcid.org/0000-0001-9053-7933"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dozier, Haley R.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085423118","display_name":"Althea C. Henslee","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Henslee, Althea C.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5134556629","display_name":"Mark A. Chappell","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chappell, Mark A.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.24570000171661377,"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"}},"topics":[{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.24570000171661377,"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/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.12200000137090683,"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"}},{"id":"https://openalex.org/T12535","display_name":"Machine Learning and Data Classification","score":0.11500000208616257,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/search-engine-indexing","display_name":"Search engine indexing","score":0.718500018119812},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.6606000065803528},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.6478000283241272},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.46239998936653137},{"id":"https://openalex.org/keywords/quantization","display_name":"Quantization (signal processing)","score":0.43050000071525574},{"id":"https://openalex.org/keywords/python","display_name":"Python (programming language)","score":0.4302000105381012},{"id":"https://openalex.org/keywords/inverted-index","display_name":"Inverted index","score":0.3970000147819519},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.3720000088214874}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7469000220298767},{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.718500018119812},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.6606000065803528},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.6478000283241272},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.46239998936653137},{"id":"https://openalex.org/C28855332","wikidata":"https://www.wikidata.org/wiki/Q198099","display_name":"Quantization (signal processing)","level":2,"score":0.43050000071525574},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.4302999973297119},{"id":"https://openalex.org/C519991488","wikidata":"https://www.wikidata.org/wiki/Q28865","display_name":"Python (programming language)","level":2,"score":0.4302000105381012},{"id":"https://openalex.org/C130590232","wikidata":"https://www.wikidata.org/wiki/Q1671754","display_name":"Inverted index","level":3,"score":0.3970000147819519},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3937999904155731},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38119998574256897},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3720000088214874},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.33820000290870667},{"id":"https://openalex.org/C143271835","wikidata":"https://www.wikidata.org/wiki/Q254515","display_name":"Similitude","level":2,"score":0.32120001316070557},{"id":"https://openalex.org/C193143536","wikidata":"https://www.wikidata.org/wiki/Q5227360","display_name":"Data stream clustering","level":5,"score":0.32089999318122864},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.3172000050544739},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3131999969482422},{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.30379998683929443},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.29840001463890076},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.29589998722076416},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.29580000042915344},{"id":"https://openalex.org/C32900221","wikidata":"https://www.wikidata.org/wiki/Q181365","display_name":"Dot product","level":2,"score":0.2727000117301941},{"id":"https://openalex.org/C17212007","wikidata":"https://www.wikidata.org/wiki/Q5511111","display_name":"Fuzzy clustering","level":3,"score":0.2709999978542328},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.2547999918460846},{"id":"https://openalex.org/C75684735","wikidata":"https://www.wikidata.org/wiki/Q858810","display_name":"Big data","level":2,"score":0.2500999867916107}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.21645","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.21645","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.21645","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.21645","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Large-scale":[0],"Nearest":[1,35],"Neighbor":[2,36],"(NN)":[3],"search,":[4,51],"though":[5],"widely":[6],"utilized":[7],"in":[8,20,42,83,104],"the":[9,16,30,48,100,113,117,124],"similarity":[10,50],"search":[11,38],"field,":[12],"remains":[13],"challenged":[14],"by":[15],"computational":[17,31,81,121],"limitations":[18],"inherent":[19],"processing":[21],"large":[22,101],"scale":[23,102],"data.":[24,130],"In":[25],"an":[26,57],"effort":[27],"to":[28,96,123],"decrease":[29],"expense":[32],"needed,":[33],"Approximate":[34],"(ANN)":[37],"is":[39,62],"often":[40],"used":[41],"applications":[43],"that":[44],"do":[45],"not":[46],"require":[47],"exact":[49],"but":[52],"instead":[53],"can":[54],"rely":[55],"on":[56,92],"approximation.":[58],"Product":[59],"Quantization":[60],"(PQ)":[61],"a":[63,79,93],"memory-efficient":[64],"ANN":[65],"effective":[66],"for":[67],"clustering":[68],"all":[69],"sizes":[70],"of":[71],"datasets.":[72],"Clustering":[73],"large-scale,":[74],"high":[75],"dimensional":[76],"data":[77,103],"requires":[78],"heavy":[80],"expense,":[82],"both":[84],"memory-cost":[85],"and":[86,98,110,119],"execution":[87],"time.":[88],"This":[89],"work":[90],"focuses":[91],"unique":[94],"way":[95],"divide":[97],"conquer":[99],"Python":[105],"using":[106,128],"PQ,":[107],"Inverted":[108],"Indexing":[109],"Dask,":[111],"combining":[112],"results":[114],"without":[115],"compromising":[116],"accuracy":[118],"reducing":[120],"requirements":[122],"level":[125],"required":[126],"when":[127],"medium-scale":[129]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-04-25T00:00:00"}