Search mechanism for data contents based on bloom filter and tree hybrid structure in system wide information management
Abstract The system wide information management (SWIM) system infrastructure layer uses information‐centric networking (ICN) to implement the cache routing and sharing of air traffic information data. The SWIM network searches and forwards routes on the basis of content names. The variable length, h...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2023-07-01
|
| Series: | IET Communications |
| Subjects: | |
| Online Access: | https://doi.org/10.1049/cmu2.12621 |
| _version_ | 1797788882918440960 |
|---|---|
| author | Lizhe Zhang Zhuoning Bai Bohua Cui Zhijun Wu |
| author_facet | Lizhe Zhang Zhuoning Bai Bohua Cui Zhijun Wu |
| author_sort | Lizhe Zhang |
| collection | DOAJ |
| description | Abstract The system wide information management (SWIM) system infrastructure layer uses information‐centric networking (ICN) to implement the cache routing and sharing of air traffic information data. The SWIM network searches and forwards routes on the basis of content names. The variable length, hierarchical name structure, and routing updates caused by the frequent publication and deletion of content make the implementation of fast name routing lookup algorithms a significant but arduous task. To address this problem, this study designed a name matching mechanism on the basis of the hybrid structure of the Bloom filter and the Tree. Compared with the traditional Bloom filter search scheme, this search mechanism reduces the quantity of Bloom filter insertion entries and reduces the possibility of hash collisions. Compared with the traditional Tree search scheme, the proposed mechanism can effectively solve the problem of numerous memory accesses caused by extremely long name prefixes, improving the query efficiency. In addition, the proposed composite structure is compared with several methods, such as DIPIT and NPT, by analyzing the effects of layering, global delay and search speed. The experimental results show that the proposed structure has a favourable performance in terms of storage overhead and search speed. |
| first_indexed | 2024-03-13T01:42:54Z |
| format | Article |
| id | doaj.art-85723234b1fd40fea5e440dd134bcf23 |
| institution | Directory Open Access Journal |
| issn | 1751-8628 1751-8636 |
| language | English |
| last_indexed | 2024-03-13T01:42:54Z |
| publishDate | 2023-07-01 |
| publisher | Wiley |
| record_format | Article |
| series | IET Communications |
| spelling | doaj.art-85723234b1fd40fea5e440dd134bcf232023-07-03T11:41:05ZengWileyIET Communications1751-86281751-86362023-07-0117111262127310.1049/cmu2.12621Search mechanism for data contents based on bloom filter and tree hybrid structure in system wide information managementLizhe Zhang0Zhuoning Bai1Bohua Cui2Zhijun Wu3Key Laboratory of Civil Aircraft Airworthiness Technology Civil Aviation University of China Tianjin ChinaSchool of Safety Science and Engineering Civil Aviation University of China Tianjin ChinaSchool of Safety Science and Engineering Civil Aviation University of China Tianjin ChinaSchool of Safety Science and Engineering Civil Aviation University of China Tianjin ChinaAbstract The system wide information management (SWIM) system infrastructure layer uses information‐centric networking (ICN) to implement the cache routing and sharing of air traffic information data. The SWIM network searches and forwards routes on the basis of content names. The variable length, hierarchical name structure, and routing updates caused by the frequent publication and deletion of content make the implementation of fast name routing lookup algorithms a significant but arduous task. To address this problem, this study designed a name matching mechanism on the basis of the hybrid structure of the Bloom filter and the Tree. Compared with the traditional Bloom filter search scheme, this search mechanism reduces the quantity of Bloom filter insertion entries and reduces the possibility of hash collisions. Compared with the traditional Tree search scheme, the proposed mechanism can effectively solve the problem of numerous memory accesses caused by extremely long name prefixes, improving the query efficiency. In addition, the proposed composite structure is compared with several methods, such as DIPIT and NPT, by analyzing the effects of layering, global delay and search speed. The experimental results show that the proposed structure has a favourable performance in terms of storage overhead and search speed.https://doi.org/10.1049/cmu2.12621bloom filtercontents find strategysearch treesystem wide information management (SWIM) |
| spellingShingle | Lizhe Zhang Zhuoning Bai Bohua Cui Zhijun Wu Search mechanism for data contents based on bloom filter and tree hybrid structure in system wide information management IET Communications bloom filter contents find strategy search tree system wide information management (SWIM) |
| title | Search mechanism for data contents based on bloom filter and tree hybrid structure in system wide information management |
| title_full | Search mechanism for data contents based on bloom filter and tree hybrid structure in system wide information management |
| title_fullStr | Search mechanism for data contents based on bloom filter and tree hybrid structure in system wide information management |
| title_full_unstemmed | Search mechanism for data contents based on bloom filter and tree hybrid structure in system wide information management |
| title_short | Search mechanism for data contents based on bloom filter and tree hybrid structure in system wide information management |
| title_sort | search mechanism for data contents based on bloom filter and tree hybrid structure in system wide information management |
| topic | bloom filter contents find strategy search tree system wide information management (SWIM) |
| url | https://doi.org/10.1049/cmu2.12621 |
| work_keys_str_mv | AT lizhezhang searchmechanismfordatacontentsbasedonbloomfilterandtreehybridstructureinsystemwideinformationmanagement AT zhuoningbai searchmechanismfordatacontentsbasedonbloomfilterandtreehybridstructureinsystemwideinformationmanagement AT bohuacui searchmechanismfordatacontentsbasedonbloomfilterandtreehybridstructureinsystemwideinformationmanagement AT zhijunwu searchmechanismfordatacontentsbasedonbloomfilterandtreehybridstructureinsystemwideinformationmanagement |