|
|
|
An efficient indexing structure for multi-dimensional range query |
Shanshan CHEN( ), Guiping ZHOU, Xingdi AN |
| School of Computer Science, Nanjing University of Posts and Telecommunications, Nanjing 210023, China |
|
|
|
|
|
|
Corresponding Author(s):
Shanshan CHEN
|
|
Just Accepted Date: 07 April 2020
Issue Date: 10 May 2021
|
|
| 1 |
A Labrinidis, H V Jagadish. Challenges and opportunities with big data. Proceedings of the VLDB Endowment, 2012, 5(12): 2032–2033
https://doi.org/10.14778/2367502.2367572
|
| 2 |
P Holanda, M Nerone, E C D Almeida, S Manegold. Cracking KD-tree: the first multidimensional adaptive indexing. In: Proceedings of the 7th International Conference on Data Science. 2018, 393–399
https://doi.org/10.5220/0006944203930399
|
| 3 |
T Zhu, H Q Hu, W Qian, H Zhou, A Y Zhou. Fault-tolerant precise data access on distributed log-structured merge-tree. Frontiers of Computer Science, 2019, 13(4): 760–777
https://doi.org/10.1007/s11704-018-7198-6
|
| 4 |
S Abudalfa, M Mikki. A dynamic linkage clustering using KD-tree. International Arab Journal of Information Technology, 2011, 10(3): 283–289
|
| 5 |
B Y Wang, Y T Hou, M Li, H T Wang, H Li. 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
https://doi.org/10.1145/2590296.2590305
|
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
| |
Shared |
|
|
|
|
| |
Discussed |
|
|
|
|
