The Dynamic Multi-stack Storage Structure

DOI

10.2991/iceat-16.2017.42How to use a DOI?

Keywords

Multi-stack, Dynamic Expansion, Dynamic Recovery

Abstract

The multi-stack has been designed based on sequence storage in reference [1]. But there have two problems: 1.Usually allocate the storage space to the multi-stack in advance, but when one of the stacks has too much data elements, Then the push stack operation will cause the space insufficient, appear "overflow" phenomenon. 2. If one of the stacks to store the data element is too little, it will cause the waste of space. Here based on the above two problems, we design a dynamic multi-stack storage structure, and realizes the basic algorithms of it for the first time.

Copyright

© 2017, 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)

TY  - CONF
AU  - Zhiguo Ren
AU  - Wenjiao Da
PY  - 2016/05
DA  - 2016/05
TI  - The Dynamic Multi-stack Storage Structure
BT  - Proceedings of the 2016 International Conference on Engineering and Advanced Technology
PB  - Atlantis Press
SP  - 204
EP  - 208
SN  - 2352-5401
UR  - https://doi.org/10.2991/iceat-16.2017.42
DO  - 10.2991/iceat-16.2017.42
ID  - Ren2016/05
ER  -