Author:
Feng Xiaoyue,Jiao Tianzhe,Guo Chaopeng,Jie Song
Publisher
Springer Nature Switzerland
Reference15 articles.
1. Mol, R.D., Barranco, C.D., Tré, G.D.: Indexing possibilistic numerical data using interval B+-trees. Fuzzy Sets Syst. 413, 138–154 (2020)
2. Zhang, W., Yan, Z., Lin, Y., et al.: A high throughput B+tree for SIMD architectures. IEEE Trans. Parallel and Distrib. Syst. 31(3), 707–720 (2019)
3. Ziegler, T., Vani, S.T., Binnig, C., et al.: Designing distributed tree-based index structures for fast RDMA-capable networks. In: Proceedings of the 2019 International Conference on Management of Data, pp. 741–758 (2019)
4. Huang, B., Yuxing, P.: An efficient distributed B-tree index method in cloud computing. Open Cybern. Syst. J. 8(1), 302–308 (2014)
5. Aguilera, M.K., Golab, W., Shah, M.A.: A practical scalable distributed B-tree. Proc. VLDB Endowment 1(1), 598–609 (2008)