{"doi":"10.1109/cimca.2006.174","title":"Reduction of the Communication Traffic for Multi-word Searches in DHTs","abstract":null,"journal":"2006 International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (CIMCA'06)","year":2006,"id":637716,"datarank":0.0,"base_score":0.0,"endowment":0.0,"self_citation_contribution":0.0,"citation_network_contribution":0.0,"self_endowment_contribution":0.0,"citer_contribution":0.0,"corpus_percentile":null,"corpus_rank":null,"citation_count":0,"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":1655967,"name":"Kazutaka Matsuzaki","orcid":null,"position":1,"is_corresponding":false},{"id":152992,"name":"Shinichi Honiden","orcid":null,"position":2,"is_corresponding":false},{"id":1655966,"name":"Yuichi Sei","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"resolved":true,"title":"Reduction of the Communication Traffic for Multi-word Searches in DHTs","abstract":"In large-scale wireless networks, efficient file searching mechanisms are essential for users. Many studies have been done on a distributed hash tables (DHTs) which are one kind of peer-to-peer system. In DHT networks, we can certainly and effectively get the desired files if they exist. However, much communication traffic comes from multi-word searches. If we increase the storage redundancy, we can reduce the traffic. However, storage constrains of mobile devices make doing so impossible. In our previous work, we proposed a divided bloom filter to reduce the traffic in DHTs. However, the effect of divided bloom filters depends strongly on their parameters, and optimizing them is difficult. Hence, we have developed and tested the method to determine optimum parameters of divided bloom filters.","is_dataset_classified":null,"base_score":0.0,"endowment":0.0,"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/W2069197195","authors":[],"funders":[],"total_grants":0,"fwci":0.0,"citation_percentile":0.13976924,"influential_citations":0,"citation_trend":[],"oa_status":"closed","license":null,"oa_locations":[{"url":"http://xplorestaging.ieee.org/ielx5/4052642/4052643/04052662.pdf?arnumber=4052662","host_type":"publisher"},{"url":"https://doi.org/10.1109/cimca.2006.174","host_type":""}],"fields_of_study":["Peer-to-Peer Network Technologies","Caching and Content Delivery","Advanced Data Storage Technologies"],"mesh_terms":[],"keywords":["Bloom filter","Computer science","Hash table","Distributed hash table","Computer network","Redundancy (engineering)","Hash function","Peer-to-peer","Reduction (mathematics)","Wireless","Distributed computing","Computer security","Operating system"],"sdg_mappings":[],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-08-06T19:23:38.707185Z","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":[]}