Acknowledgement
This work was supported by the Dongduk Women's University grant in 2020.
References
- B. Donnet, P. Raoult, T. Friedman, and M. Crovella, "Efficient Algorithms for Large-scale Topology Discovery," in Proc. of ACM SIGMETRICS, pp. 327-338, June. 2005. DOI: doi.org/10.1145/1071690.1064256
- Thi Nguyen, Zhen He, Rui Zhang, and Phillip Ward, "Boosting Moving Object Indexing through Velocity Partitioning," in Proc. of the VLDB Endowment, pp. 860-871, May 2012. DOI : doi.org/10.14778/2311906.2311913
- Rslan E., Hameed H.A., and Ezzat E., "Spatial R-tree Index based on Grid Division for Query Processing," International Journal of Database Management Systems, Vol. 9, No. 6, pp. 25-36, 2017. DOI : 10.5121/ijdms.2017.9602
- Hendawi A.M., Bao J., Mokbel M.F., and Ali M., "Predictive Tree: An Efficient Index for Predictive Queries on Road Networks," in Proc. of ACM ICDE, pp. 1215-1226, 2015. DOI: 10.1109/ICDE.2015.7113369
- Koide S., Tadokoro Y., Yoshimura T., and Xiao C., "Enhanced Indexing and Querying of Trajectories in Road Networks via String Algorithms," ACM Trans. Spatial Algorithms Systems, Vol. 4, No. 1, pp. 1-41, 2018. DOI : doi.org/10.1145/3200200
- Seong-Chae Lim, "An Indexing Scheme for Predicting Future-time Positions of Moving Objects with Frequently Varying Velocities," Journal of the Korea Society of Computer and Information, Vol.15 No. 5, pp. 23 - 31, 2012. DOI : doi.org/10.9708/jksci.2010.15.5.023
- Jianzhong Qi, Rui Zhang, Christian S. Jensen, Kotagiri Ramamohanarao, and Jiayuan HE, "Continuous Spatial Query Processing: A survey of Safe Region based Techniques," ACM Computer Surveys, Vol. 51, No. 3, pp. 1-39, May 2019. DOI : doi.org/10.1145/3193835
- Stephan Baumann, Giel de Nijs, Michael Strobel, and Kai-Uwe Sattler, "Flashing Databases: Expectations and Limitations," in Proc. of ACM DaMon, pp. 9-18, June, 2010.
- Tseng-Yi Chen, Yuan-Hao Chang, Yuan-Hung Kuan, Ming-Chang Yang, Yu-Ming Chang, and Pi-Cheng Hsiu, "Enhancing Flash Memory Reliability by Jointly Considering Write-back Pattern and Block Endurance," ACM Transactions on Design Automation of Electronic Systems, Vol. 23, No. 5, pp 1-24, September 2018. DOI : doi.org/10.1145/3229192
- Yongkun Wang, Kazuo Goda, and Masaru Kitsuregawa, "Evaluating Non-In-Place Update Techniques for Flash-Based Transaction Processing Systems," in Proc. of DEXA, pp. 777-791, 2009.
- Woon-Hak Kang, Sang-Won Lee, and Bongki Moon, "Flash-based Extended Cache for Higher Throughput and Faster Recovery," Journal of the VLDB Endowment, Vol. 5, No. 11, pp. 1615-1626, 2012. https://doi.org/10.14778/2350229.2350274
- John Colgrove, et at., "Purity: Building Fast, Highly-Available Enterprise Flash Storage from Commodity Components," in Proc. of SIGMOD, pp. 1683-1694, May 2015. DOI : doi.org/10.1145/2723372.2742798
- Laura M. Grupp, John D. Davis, and Steven Swanson, "The Bleak Future of NAND Flash Memory," in Proc. of the USENIX Conference on File and Storage, Feb. 2012.
- Sungchae Lim, "A New Flash-based B+-tree with Very Cheap Update Operations on Leaf Nodes," in Proc. of International Conference on Engineering Technologies and Big Data Analytics, pp. 45-49, January 2016. DOI : dx.doi.org/10.15242/IIE.E0116022
- Sungchae Lim , "F2B+-tree: A Flash-aware B+-tree Using the Bloom Filter," Asia-pacific Journal of Convergent Research Interchange, Vol.6, No.7, pp. 21-28, July 2020. DOI : 10.47116/apjcri.2020.07.03
- B. H. Bloom, "Space/time Trade-offs in Hash Coding with Allowable Errors," Communications of the ACM, Vol. 13, No. 7, pp. 422-426, 1970. https://doi.org/10.1145/362686.362692
- Benoit Donnet, Bruno Baynat, and Timur Friedman , "Retouched Bloom filters: Allowing Networked Applications to Trade off Selected False Positives against False Negatives," in Proc. of ACM CoNEXT, pp. 1-12, December 2006. DOI : doi.org/10.1145/1368436.1368454
- Deke Guo, Jie Wu, Honghui Chen, Ye Yuan, and Xueshan Luo, "The Dynamic Bloom Filters," IEEE Trans. on Knowledge and Data Engineering, Vol. 22, No. 3, pp. 120-133. January 2010. DOI : 10.1109/TKDE.2009.57