Proceedings of the 2015 International Conference on Computer Science and Intelligent Communication

A High-Performance Key-Value Query Solution Based on Hash Dictionary and Trie Tree

Authors
Zhijia Yan, Zhonghan Sun, Yidong Zheng, Jiajun Bu, Wei Wang
Corresponding Author
Zhijia Yan
Available Online July 2015.
DOI
https://doi.org/10.2991/csic-15.2015.41How to use a DOI?
Keywords
Key-value query, Hash, Tire tree
Abstract

With the development of Internet, tens of billions query were submitted every day. However, the old response mechanism of query which client submits query to server then server fetches data from database and sends data to client can't meet the requirements any more. We know the time of client to server request can't be cut down. To accelerate query speed, we have to avoid the costing time method that fetches data from database. Key-Value Store is popular today, but it has problems in Points barrels strategy and memory usage. In this paper, we propose a High-Performance Key-Value Query Solution which is based on hash dictionary and trie tree. Instead of fetching data from database, we construct a Key-Value dictionary in the memory to accelerate the whole query time. We use epoll of Linux to finish the asynchronous communication of client and server. For the dictionary, we design two different dictionaries like Hash dictionary, sorted dictionary based on trie tree. Hash dictionary uses Points barrels strategy and Minimal Perfect Hash Function. Sorted dictionary is based on trie tree. To illustrate performance of our solution, we test and record the performance of memory usage and query per second. It turns out that hash dictionary has more effective search time and sorted dictionary can hold more data.

Copyright
© 2015, the Authors. Published by Atlantis Press.
Open Access
This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

Volume Title
Proceedings of the 2015 International Conference on Computer Science and Intelligent Communication
Series
Advances in Computer Science Research
Publication Date
July 2015
ISBN
978-94-62520-84-4
ISSN
2352-538X
DOI
https://doi.org/10.2991/csic-15.2015.41How to use a DOI?
Copyright
© 2015, the Authors. Published by Atlantis Press.
Open Access
This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Cite this article

TY  - CONF
AU  - Zhijia Yan
AU  - Zhonghan Sun
AU  - Yidong Zheng
AU  - Jiajun Bu
AU  - Wei Wang
PY  - 2015/07
DA  - 2015/07
TI  - A High-Performance Key-Value Query Solution Based on Hash Dictionary and Trie Tree
BT  - Proceedings of the 2015 International Conference on Computer Science and Intelligent Communication
PB  - Atlantis Press
SP  - 171
EP  - 174
SN  - 2352-538X
UR  - https://doi.org/10.2991/csic-15.2015.41
DO  - https://doi.org/10.2991/csic-15.2015.41
ID  - Yan2015/07
ER  -