Author:
Jin Peiquan,Xie Xike,Wang Na,Yue Lihua
Funder
National Science Foundation of China
Subject
Artificial Intelligence,Computer Science Applications,General Engineering
Reference36 articles.
1. Lazy-adaptive tree: An optimized index structure for flash devices;Agrawal;Proceedings of VLDB Endowment,2009
2. Beckmann, N., Kriegel, H., Schneider, R., & Seeger, B. (1990). The R∗-tree: An efficient and robust access method for points and rectangles. In Proceedings of the 1990 ACM SIGMOD international conference on management of data (pp. 322–331). New York, NY, USA.
3. Bouganim, L., Jónsson, B., & Bonnet, P. (2009), uFLIP: Understanding flash IO patterns. In Proceedings of the 4th biennial conference on innovative data systems research, Asilomar (pp. 1–12).
4. LR-tree: A logarithmic decomposable spatial index method;Bozanis;The Computer Journal,2003
5. An index management using CHC-cluster for flash memory databases;Byun;Journal of Systems and Software,2009
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献