An efficient indexing structure for multi-dimensional range query

Shanshan CHEN; Guiping ZHOU; Xingdi AN

doi:10.1007/s11704-020-9264-0

Front. Comput. Sci. ›› 2021, Vol. 15 ›› Issue (4) : 154612 DOI: 10.1007/s11704-020-9264-0

LETTER

An efficient indexing structure for multi-dimensional range query

Author information +

History +

PDF (313KB)

Cite this article

Download citation ▾

Shanshan CHEN, Guiping ZHOU, Xingdi AN. An efficient indexing structure for multi-dimensional range query. Front. Comput. Sci., 2021, 15(4): 154612 DOI:10.1007/s11704-020-9264-0

登录浏览全文

4963

注册一个新账户忘记密码

References

Publishing order | Descend order by publishing year | Descend order by cited within

[1]	Labrinidis A, Jagadish H V. Challenges and opportunities with big data. Proceedings of the VLDB Endowment, 2012, 5(12): 2032–2033

[2]	Holanda P, Nerone M, Almeida E C D, Manegold S. Cracking KD-tree: the first multidimensional adaptive indexing. In: Proceedings of the 7th International Conference on Data Science. 2018, 393–399

[3]	Zhu T, Hu H Q, Qian W, Zhou H, Zhou A Y. Fault-tolerant precise data access on distributed log-structured merge-tree. Frontiers of Computer Science, 2019, 13(4): 760–777

[4]	Abudalfa S, Mikki M. A dynamic linkage clustering using KD-tree. International Arab Journal of Information Technology, 2011, 10(3): 283–289

[5]	Wang B Y, Hou Y T, Li M, Wang H T, Li H. Maple: scalable multidimensional range search over encrypted cloud data with tree-based index. In: Proceedings of the 9th ACM Symposium on Information, Computer and Communications Security. 2014, 111–122