{"id":"https://openalex.org/W2975588143","doi":"https://doi.org/10.1109/iccse.2019.8845438","title":"Locality-Sensitive Hashing Scheme Based on Heap Sort of Hash Bucket","display_name":"Locality-Sensitive Hashing Scheme Based on Heap Sort of Hash Bucket","publication_year":2019,"publication_date":"2019-08-01","ids":{"openalex":"https://openalex.org/W2975588143","doi":"https://doi.org/10.1109/iccse.2019.8845438","mag":"2975588143"},"language":"en","primary_location":{"id":"doi:10.1109/iccse.2019.8845438","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccse.2019.8845438","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 14th International Conference on Computer Science & Education (ICCSE)","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/A5101694743","display_name":"Bo Fang","orcid":"https://orcid.org/0000-0001-9909-1317"},"institutions":[{"id":"https://openalex.org/I204983213","display_name":"Harbin Institute of Technology","ror":"https://ror.org/01yqg2h08","country_code":"CN","type":"education","lineage":["https://openalex.org/I204983213"]},{"id":"https://openalex.org/I158809036","display_name":"Shenzhen Institute of Information Technology","ror":"https://ror.org/03wrf9427","country_code":"CN","type":"education","lineage":["https://openalex.org/I158809036"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Bo Fang","raw_affiliation_strings":["School of computer science and technology, Harbin Institute of Technology shenzhen, Shenzhen, China"],"affiliations":[{"raw_affiliation_string":"School of computer science and technology, Harbin Institute of Technology shenzhen, Shenzhen, China","institution_ids":["https://openalex.org/I158809036","https://openalex.org/I204983213"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007080915","display_name":"Zhongyun Hua","orcid":"https://orcid.org/0000-0002-3529-0541"},"institutions":[{"id":"https://openalex.org/I158809036","display_name":"Shenzhen Institute of Information Technology","ror":"https://ror.org/03wrf9427","country_code":"CN","type":"education","lineage":["https://openalex.org/I158809036"]},{"id":"https://openalex.org/I204983213","display_name":"Harbin Institute of Technology","ror":"https://ror.org/01yqg2h08","country_code":"CN","type":"education","lineage":["https://openalex.org/I204983213"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhongyun Hua","raw_affiliation_strings":["School of computer science and technology, Harbin Institute of Technology shenzhen, Shenzhen, China"],"affiliations":[{"raw_affiliation_string":"School of computer science and technology, Harbin Institute of Technology shenzhen, Shenzhen, China","institution_ids":["https://openalex.org/I158809036","https://openalex.org/I204983213"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006819425","display_name":"Hejiao Huang","orcid":"https://orcid.org/0000-0002-2030-957X"},"institutions":[{"id":"https://openalex.org/I204983213","display_name":"Harbin Institute of Technology","ror":"https://ror.org/01yqg2h08","country_code":"CN","type":"education","lineage":["https://openalex.org/I204983213"]},{"id":"https://openalex.org/I158809036","display_name":"Shenzhen Institute of Information Technology","ror":"https://ror.org/03wrf9427","country_code":"CN","type":"education","lineage":["https://openalex.org/I158809036"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hejiao Huang","raw_affiliation_strings":["School of computer science and technology, Harbin Institute of Technology shenzhen, Shenzhen, China"],"affiliations":[{"raw_affiliation_string":"School of computer science and technology, Harbin Institute of Technology shenzhen, Shenzhen, China","institution_ids":["https://openalex.org/I158809036","https://openalex.org/I204983213"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5101694743"],"corresponding_institution_ids":["https://openalex.org/I158809036","https://openalex.org/I204983213"],"apc_list":null,"apc_paid":null,"fwci":0.1012,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.44259153,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"5","last_page":"10"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9998000264167786,"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/T11106","display_name":"Data Management and Algorithms","score":0.9908999800682068,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11478","display_name":"Caching and Content Delivery","score":0.9853000044822693,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/locality-sensitive-hashing","display_name":"Locality-sensitive hashing","score":0.8305395245552063},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7509981393814087},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.7063865065574646},{"id":"https://openalex.org/keywords/dynamic-perfect-hashing","display_name":"Dynamic perfect hashing","score":0.7048117518424988},{"id":"https://openalex.org/keywords/hash-table","display_name":"Hash table","score":0.6875388026237488},{"id":"https://openalex.org/keywords/heap","display_name":"Heap (data structure)","score":0.6182358860969543},{"id":"https://openalex.org/keywords/double-hashing","display_name":"Double hashing","score":0.6175312995910645},{"id":"https://openalex.org/keywords/universal-hashing","display_name":"Universal hashing","score":0.5469777584075928},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4787037670612335},{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.4592260420322418},{"id":"https://openalex.org/keywords/hash-tree","display_name":"Hash tree","score":0.4448608160018921},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4438779652118683},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.44252899289131165},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4352497458457947},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.29856348037719727}],"concepts":[{"id":"https://openalex.org/C74270461","wikidata":"https://www.wikidata.org/wiki/Q1625299","display_name":"Locality-sensitive hashing","level":4,"score":0.8305395245552063},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7509981393814087},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.7063865065574646},{"id":"https://openalex.org/C122907437","wikidata":"https://www.wikidata.org/wiki/Q5318999","display_name":"Dynamic perfect hashing","level":5,"score":0.7048117518424988},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.6875388026237488},{"id":"https://openalex.org/C134757568","wikidata":"https://www.wikidata.org/wiki/Q274089","display_name":"Heap (data structure)","level":2,"score":0.6182358860969543},{"id":"https://openalex.org/C138111711","wikidata":"https://www.wikidata.org/wiki/Q478351","display_name":"Double hashing","level":4,"score":0.6175312995910645},{"id":"https://openalex.org/C116058348","wikidata":"https://www.wikidata.org/wiki/Q846912","display_name":"Universal hashing","level":5,"score":0.5469777584075928},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4787037670612335},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.4592260420322418},{"id":"https://openalex.org/C27353603","wikidata":"https://www.wikidata.org/wiki/Q16948622","display_name":"Hash tree","level":4,"score":0.4448608160018921},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4438779652118683},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.44252899289131165},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4352497458457947},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.29856348037719727},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iccse.2019.8845438","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccse.2019.8845438","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 14th International Conference on Computer Science & Education (ICCSE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1497953515","https://openalex.org/W1548307963","https://openalex.org/W2107427524","https://openalex.org/W2116013009","https://openalex.org/W2125671345","https://openalex.org/W2144265691","https://openalex.org/W2145725688","https://openalex.org/W2147717514","https://openalex.org/W2162006472","https://openalex.org/W2170037597","https://openalex.org/W2441967103","https://openalex.org/W4242599275","https://openalex.org/W6685012337"],"related_works":["https://openalex.org/W1870428314","https://openalex.org/W2000284985","https://openalex.org/W2008682098","https://openalex.org/W3030563642","https://openalex.org/W2293015666","https://openalex.org/W2158169729","https://openalex.org/W1741241131","https://openalex.org/W2899968640","https://openalex.org/W2921167217","https://openalex.org/W2975588143"],"abstract_inverted_index":{"Nearest":[0],"neighbor":[1,65,187],"search":[2,33],"(NNS)":[3],"is":[4,104,168,228],"one":[5],"of":[6,51,63,81,99,113,117,152,161,172,175,185,198,207,215,221],"the":[7,26,41,61,72,76,86,97,110,159,173,183,205],"current":[8],"popular":[9],"research":[10],"directions,":[11],"which":[12,84,120],"widely":[13],"used":[14],"in":[15,177,235,242],"machine":[16],"learning,":[17],"pattern":[18],"recognition,":[19],"image":[20],"detection":[21],"and":[22,163,218,238],"so":[23],"on.":[24],"In":[25],"low":[27],"dimension":[28,43],"data,":[29],"based":[30,92],"on":[31,75,93,126,149,194],"tree":[32],"method":[34],"can":[35,201],"get":[36],"good":[37],"results.":[38],"But":[39,71],"when":[40],"data":[42,118,179],"goes":[44],"up,":[45],"that":[46,105,225],"will":[47],"produce":[48],"a":[49,78,114,195,212],"curse":[50],"dimensional.":[52],"The":[53],"proposed":[54],"Locality-Sensitive":[55,145],"Hashing":[56,146],"algorithm":[57,73,156,227],"(LSH)":[58],"greatly":[59],"improves":[60,96],"efficiency":[62,174,184],"nearest":[64,186],"query":[66,122,236,243],"for":[67],"high":[68],"dimensional":[69],"data.":[70],"relies":[74],"building":[77],"large":[79,115,213],"number":[80,116,197,214],"hash":[82,199,216],"table,":[83,217],"makes":[85],"space":[87],"complexity":[88],"very":[89],"high.":[90],"C2LSH":[91,234],"dynamic":[94],"collision":[95,111],"disadvantage":[98,103],"LSH,":[100],"but":[101,136],"its":[102],"it":[106],"needs":[107,191],"to":[108,169,181,192,210],"detect":[109],"times":[112],"points":[119],"Increased":[121],"time.":[123,244],"Therefore,":[124],"Based":[125,148],"LSH":[127,162,208],"algorithm,":[128],"later":[129],"researchers":[130],"put":[131,143],"forward":[132,144],"many":[133],"improved":[134],"algorithms,":[135],"still":[137],"not":[138,202],"ideal.In":[139],"this":[140],"paper,":[141],"we":[142],"Scheme":[147],"Heap":[150],"Sort":[151],"Hash":[153],"Bucket":[154],"(HSLSH)":[155],"aiming":[157],"at":[158],"shortcomings":[160],"C2LSH.":[164,222],"Its":[165],"main":[166],"idea":[167],"take":[170],"advantage":[171],"heapsort":[176],"massive":[178],"sorting":[180],"improve":[182],"query.":[188],"It":[189],"only":[190,203],"rely":[193],"small":[196],"functions":[200],"overcome":[204],"shortcoming":[206],"need":[209],"build":[211],"avoids":[219],"defects":[220],"Experiments":[223],"show":[224],"our":[226],"more":[229],"than":[230,233],"20%":[231],"better":[232],"accuracy":[237],"40%":[239],"percent":[240],"lower":[241]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}