{"doi":"10.1145/2213836.2213898","title":"Locality-sensitive hashing scheme based on dynamic collision counting","abstract":null,"journal":"Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data","year":2012,"id":630554,"datarank":0.818937827121624,"base_score":5.459585514144159,"endowment":5.459585514144159,"self_citation_contribution":0.818937827121624,"citation_network_contribution":0.0,"self_endowment_contribution":0.818937827121624,"citer_contribution":0.0,"corpus_percentile":null,"corpus_rank":null,"citation_count":234,"citer_count":0,"citers_with_citation_signal":0,"citers_with_endowment":0,"datacite_reuse_total":0,"is_dataset":false,"is_dataset_confidence":null,"is_data_producer":false,"deposit_databanks":null,"is_oa":false,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":null,"fair_score":null,"fair_percentile":null,"algorithm_id":"datarank_citation_only_1hop_v6","ranking_scope":"data_only","authors":[{"id":670124,"name":"Jianlin Feng","orcid":null,"position":1,"is_corresponding":false},{"id":1633583,"name":"Qiong Fang","orcid":null,"position":2,"is_corresponding":false},{"id":1633584,"name":"Wilfred Ng","orcid":null,"position":3,"is_corresponding":false},{"id":1633581,"name":"Junhao Gan","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"resolved":true,"title":"Locality-sensitive hashing scheme based on dynamic collision counting","abstract":"Locality-Sensitive Hashing (LSH) and its variants are well-known methods for solving the c-approximate NN Search problem in high-dimensional space. Traditionally, several LSH functions are concatenated to form a \"static\" compound hash function for building a hash table. In this paper, we propose to use a base of m single LSH functions to construct \"dynamic\" compound hash functions, and define a new LSH scheme called Collision Counting LSH (C2LSH). If the number of LSH functions under which a data object o collides with a query object q is greater than a pre-specified collision threhold l, then o can be regarded as a good candidate of c-approximate NN of q. This is the basic idea of C2LSH.","is_dataset_classified":null,"base_score":5.459585514144159,"endowment":5.459585514144159,"datacite_reuse_total":0,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"19767382","pmcid":null,"openalex_id":"https://openalex.org/W2144265691","authors":[],"funders":[],"total_grants":0,"fwci":7.67,"citation_percentile":0.98082309,"influential_citations":0,"citation_trend":[{"year":2012,"count":1},{"year":2013,"count":5},{"year":2014,"count":13},{"year":2015,"count":15},{"year":2016,"count":15},{"year":2017,"count":19},{"year":2018,"count":21},{"year":2019,"count":16},{"year":2020,"count":29},{"year":2021,"count":22},{"year":2022,"count":8},{"year":2023,"count":17},{"year":2024,"count":16},{"year":2025,"count":25},{"year":2026,"count":12}],"oa_status":"closed","license":"https://www.acm.org/publications/policies/copyright_policy#Background","oa_locations":[{"url":"https://dl.acm.org/doi/10.1145/2213836.2213898","host_type":"publisher"},{"url":"https://dl.acm.org/doi/pdf/10.1145/2213836.2213898","host_type":"publisher"},{"url":"https://doi.org/10.1145/2213836.2213898","host_type":""},{"url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.367.4361","host_type":""},{"url":"http://repository.hkust.edu.hk/ir/Record/1783.1-51856","host_type":"repository"}],"fields_of_study":["Advanced Image and Video Retrieval Techniques","Algorithms and Data Compression","Data Management and Algorithms"],"mesh_terms":[],"keywords":["Hash function","Locality-sensitive hashing","Hash table","Computer science","Collision","Double hashing","Object (grammar)","Dynamic perfect hashing","K-independent hashing","Collision attack","Collision resistance","Theoretical computer science","Construct (python library)","Scheme (mathematics)","Function (biology)","Locality","Algorithm","Mathematics","Artificial intelligence"],"sdg_mappings":[{"sdg_number":0,"sdg_label":"Sustainable cities and communities"}],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-08-05T21:38:14.321495Z","pmid":null,"pmcid":null,"fwci":null,"citation_percentile":null,"influential_citations":0,"oa_status":null,"license":null,"views":0,"total_file_size_bytes":0,"version_count":0,"fair_f":null,"fair_a":null,"fair_i":null,"fair_r":null,"fair_zscore":null,"fair_rationale":null,"fair_model":null,"fair_agent_version":null,"fair_fulltext_source":null,"fair_has_llm":null,"fair_computed_at":null,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}