Skip to main content
SpringerLink
Log in

K-ary search tree revisited: improving construction and intersection efficiency

  • Letter
  • Published:
Frontiers of Computer Science Aims and scope Submit manuscript

4 Conclusion

We have explored the optimizations for improving the efficiency of k-ary search tree, including a recursive construction algorithm and early termination techniques applied to three traversal methods to accelerate the computation procedure. These optimizations are easy to implement and bring trifle loads on the space occupancy. By the experimental analysis on synthetic and realistic data, we have demonstrated both construction and intersection efficiency benefit a lot from our optimizations. Our methods exhibited a conspicuous improvement over the original ones.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Schlegel B, Gemulla R, Lehner W. K-ary search on modern processors. In: Proceedings of the 5th International Workshop on Data Management on New Hardware. 2009, 52–60

  2. Kim C, Chhugani J, Satish N, Sedlar E, Nguyen A D, Kaldewey T, Lee V W, Brandt S A, Dubey P. FAST: fast architecture sensitive tree search on modern CPUs and GPUs. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of data. 2010, 339–350

  3. Wang J, Lin C, He R, Chae M, Papakonstantinou Y, Swanson S. MILC: inverted list compression in memory. Proceedings of the VLDB Endowment, 2017, 10(8): 853–864

    Article  Google Scholar 

  4. Zhang J, Lu Y, Spampinato D G, Franchetti F. FESIA: A fast and SIMD-efficient set intersection approach on modern CPUs. In: Proceedings of the 36th IEEE International Conference on Data Engineering. 2020, 1465–1476

  5. Song X, Yang Y, Li X. SIMD-based multiple sets intersection with dual-scale search algorithm. In: Proceedings of the 2017 ACM Conference on Information and Knowledge Management. 2017, 2311–2314

Download references

Author information

Authors and Affiliations

  1. College of Advanced Interdisciplinary Studies, National University of Defense Technology, Changsha, 410000, China

    Xingshen Song, Jinsheng Deng & Fengcai Qiao

  2. Faculty of Computer Science and Engineering, Xi’an University of Technology, Xi’an, 710000, China

    Kun Jiang

Authors
  1. Xingshen Song
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jinsheng Deng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Fengcai Qiao
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Kun Jiang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xingshen Song.

Additional information

Supporting information

The supporting information is available online at joumal.hep.com.cn and link.springer.com.

Electronic Supplementary Material

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Song, X., Deng, J., Qiao, F. et al. K-ary search tree revisited: improving construction and intersection efficiency. Front. Comput. Sci. 16, 163616 (2022). https://doi.org/10.1007/s11704-022-0493-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11704-022-0493-2

Search

Navigation