{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:39:49Z","timestamp":1742999989887,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319228518"},{"type":"electronic","value":"9783319228525"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-22852-5_24","type":"book-chapter","created":{"date-parts":[[2015,8,10]],"date-time":"2015-08-10T12:07:46Z","timestamp":1439208466000},"page":"285-294","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Grid-File: Towards to a Flash Efficient Multi-dimensional Index"],"prefix":"10.1007","author":[{"given":"Athanasios","family":"Fevgas","sequence":"first","affiliation":[]},{"given":"Panayiotis","family":"Bozanis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,11]]},"reference":[{"unstructured":"Bouganim, L., J\u00f3nsson, B., Bonnet, P.: uFLIP: understanding flash IO patterns (2009). arXiv preprint arXiv:0909.1780","key":"24_CR1"},{"doi-asserted-by":"crossref","unstructured":"Wu, C.H., Chang, L.P., Kuo, T.W.: An efficient R-tree implementation over flash-memory storage systems. In: Proceedings of the 11th ACM International Symposium on Advances in Geographic Information Systems, GIS 2003, pp. 17\u201324. ACM, New York (2003)","key":"24_CR2","DOI":"10.1145\/956676.956679"},{"issue":"3","key":"24_CR3","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/1275986.1275991","volume":"6","author":"CH Wu","year":"2007","unstructured":"Wu, C.H., Kuo, T.W., Chang, L.P.: An efficient B-tree layer implementation for flash-memory storage systems. ACM Trans. Embed. Comput. Syst. (TECS) 6(3), 19 (2007)","journal-title":"ACM Trans. Embed. Comput. Syst. (TECS)"},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-642-29023-7_7","volume-title":"Database Systems for Advanced Applications","author":"M Pawlik","year":"2012","unstructured":"Pawlik, M., Macyna, W.: Implementation of the aggregated R-tree over flash memory. In: Yu, H., Yu, G., Hsu, W., Moon, Y.-S., Unland, R., Yoo, J. (eds.) DASFAA Workshops 2012. LNCS, vol. 7240, pp. 65\u201372. Springer, Heidelberg (2012)"},{"issue":"1","key":"24_CR5","first-page":"85","volume":"30","author":"H Roh","year":"2014","unstructured":"Roh, H., Kim, S., Lee, D., Park, S.: As B-tree: a study of an efficient B+-tree for SSDs. J. Inf. Sci. Eng. 30(1), 85\u2013106 (2014)","journal-title":"J. Inf. Sci. Eng."},{"issue":"1","key":"24_CR6","doi-asserted-by":"publisher","first-page":"361","DOI":"10.14778\/1687627.1687669","volume":"2","author":"D Agrawal","year":"2009","unstructured":"Agrawal, D., Ganesan, D., Sitaraman, R., Diao, Y., Singh, S.: Lazy-adaptive tree: an optimized index structure for flash devices. Proc. VLDB Endow. 2(1), 361\u2013372 (2009)","journal-title":"Proc. VLDB Endow."},{"issue":"4","key":"24_CR7","doi-asserted-by":"publisher","first-page":"286","DOI":"10.14778\/2095686.2095688","volume":"5","author":"H Roh","year":"2011","unstructured":"Roh, H., Park, S., Kim, S., Shin, M., Lee, S.W.: B+-tree index optimization by exploiting internal parallelism of flash-based solid state drives. Proc. VLDB Endow. 5(4), 286\u2013297 (2011)","journal-title":"Proc. VLDB Endow."},{"key":"24_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-34679-8_1","volume-title":"Data and Knowledge Engineering","author":"N Wang","year":"2012","unstructured":"Wang, N., Jin, P., Wan, S., Zhang, Y., Yue, L.: OR-tree: an optimized spatial tree index for flash-memory storage systems. In: Xiang, Y., Pathan, M., Tao, X., Wang, H. (eds.) ICDKE 2012. LNCS, vol. 7696, pp. 1\u201314. Springer, Heidelberg (2012)"},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"4676","DOI":"10.1016\/j.eswa.2015.01.011","volume":"42","author":"P Jin","year":"2015","unstructured":"Jin, P., Xie, X., Wang, N., Yue, L.: Optimizing R-tree for flash memory. Expert Syst. Appl. 42, 4676\u20134686 (2015)","journal-title":"Expert Syst. Appl."},{"key":"24_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-642-20244-5_20","volume-title":"Database Systems for Adanced Applications","author":"Y Lv","year":"2011","unstructured":"Lv, Y., Li, J., Cui, B., Chen, X.: Log-compact R-tree: an efficient spatial index for SSD. In: Xu, J., Yu, G., Zhou, S., Unland, R. (eds.) DASFAA Workshops 2011. LNCS, vol. 6637, pp. 202\u2013213. Springer, Heidelberg (2011)"},{"issue":"3","key":"24_CR11","doi-asserted-by":"publisher","first-page":"1055","DOI":"10.1007\/s11227-011-0679-0","volume":"64","author":"G Li","year":"2013","unstructured":"Li, G., Zhao, P., Yuan, L., Gao, S.: Efficient implementation of a multi-dimensional index structure over flash memory storage systems. J. Supercomput. 64(3), 1055\u20131074 (2013)","journal-title":"J. Supercomput."},{"unstructured":"Athanassoulis, M., Ailamaki, A.: BF-tree: approximate tree indexing. In: Proceedings of the 40th International Conference on Very Large Databases. Number EPFL-CONF-201942 (2014)","key":"24_CR12"},{"doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: a dynamic index structure for spatial searching, vol. 14. ACM (1984)","key":"24_CR13","DOI":"10.1145\/971697.602266"},{"issue":"1","key":"24_CR14","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1145\/348.318586","volume":"9","author":"J Nievergelt","year":"1984","unstructured":"Nievergelt, J., Hinterberger, H., Sevcik, K.C.: The grid file: an adaptable, symmetric multikey file structure. ACM Trans. Database Syst. (TODS) 9(1), 38\u201371 (1984)","journal-title":"ACM Trans. Database Syst. (TODS)"},{"key":"24_CR15","doi-asserted-by":"crossref","first-page":"1279","DOI":"10.1007\/978-0-387-39940-9_187","volume-title":"Encyclopedia of Database Systems","author":"AN Papadopoulos","year":"2009","unstructured":"Papadopoulos, A.N., Manolopoulos, Y., Theodoridis, Y., Tsotras, V.: Grid file (and family). In: Liu, L., \u00d6zsu, M.T. (eds.) Encyclopedia of Database Systems, pp. 1279\u20131282. Springer, New York (2009)"},{"issue":"12","key":"24_CR16","doi-asserted-by":"publisher","first-page":"1230","DOI":"10.14778\/2536274.2536283","volume":"6","author":"A Eldawy","year":"2013","unstructured":"Eldawy, A., Mokbel, M.F.: A demonstration of spatialhadoop: an efficient mapreduce framework for spatial data. Proc. VLDB Endow. 6(12), 1230\u20131233 (2013)","journal-title":"Proc. VLDB Endow."},{"doi-asserted-by":"crossref","unstructured":"Liu, Y., Hu, S., Rabl, T., Liu, W., Jacobsen, H.A., Wu, K., Chen, J.: DGFindex for smart grid: enhancing hive with a cost-effective multidimensional range index (2014). arXiv preprint arXiv:1404.5686","key":"24_CR17","DOI":"10.14778\/2733004.2733021"},{"issue":"4","key":"24_CR18","doi-asserted-by":"publisher","first-page":"1294","DOI":"10.1016\/j.eswa.2013.08.027","volume":"41","author":"K Park","year":"2014","unstructured":"Park, K.: Location-based grid-index for spatial query processing. Expert Syst. Appl. 41(4), 1294\u20131300 (2014)","journal-title":"Expert Syst. Appl."},{"doi-asserted-by":"crossref","unstructured":"Robinson, J.T.: The KDB-tree: a search structure for large multidimensional dynamic indexes. In: Proceedings of the 1981 ACM SIGMOD INTERNATIONAL CONFERENCE on Management of DATA, pp. 10\u201318. ACM (1981)","key":"24_CR19","DOI":"10.1145\/582318.582321"},{"key":"24_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-642-22922-0_10","volume-title":"Advances in Spatial and Temporal Databases","author":"M Sarwat","year":"2011","unstructured":"Sarwat, M., Mokbel, M.F., Zhou, X., Nath, S.: FAST: a generic framework for flash-aware spatial trees. In: Pfoser, D., Tao, Y., Mouratidis, K., Nascimento, M.A., Mokbel, M., Shekhar, S., Huang, Y. (eds.) SSTD 2011. LNCS, vol. 6849, pp. 149\u2013167. Springer, Heidelberg (2011)"},{"key":"24_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/978-3-642-22922-0_28","volume-title":"Advances in Spatial and Temporal Databases","author":"I Koltsidas","year":"2011","unstructured":"Koltsidas, I., Viglas, S.D.: Spatial Data management over flash memory. In: Pfoser, D., Tao, Y., Mouratidis, K., Nascimento, M.A., Mokbel, M., Shekhar, S., Huang, Y. (eds.) SSTD 2011. LNCS, vol. 6849, pp. 449\u2013453. Springer, Heidelberg (2011)"},{"doi-asserted-by":"crossref","unstructured":"Park, S.y., Jung, D., Kang, J.u., Kim, J.s., Lee, J.: CFLRU: a replacement algorithm for flash memory. In: Proceedings of the 2006 International Conference on Compilers, Architecture and Synthesis for Embedded Systems, pp. 234\u2013241. ACM (2006)","key":"24_CR22","DOI":"10.1145\/1176760.1176789"},{"key":"24_CR23","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.datak.2011.09.007","volume":"72","author":"P Jin","year":"2012","unstructured":"Jin, P., Ou, Y., Harder, T., Li, Z.: AD-LRU: an efficient buffer replacement algorithm for flash-based databases. Data Knowl. Eng. 72, 83\u2013102 (2012)","journal-title":"Data Knowl. Eng."},{"issue":"4","key":"24_CR24","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1007\/BF01936137","volume":"25","author":"K Hinrichs","year":"1985","unstructured":"Hinrichs, K.: Implementation of the grid file: design concepts and experience. BIT Numer. Math. 25(4), 569\u2013592 (1985)","journal-title":"BIT Numer. Math."},{"doi-asserted-by":"crossref","unstructured":"Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B.: The R*-tree: an efficient and robust access method for points and rectangles, vol. 19. ACM (1990)","key":"24_CR25","DOI":"10.1145\/93597.98741"},{"unstructured":"Hadjieleftheriou, M.: libspatialindex 1.8.5 (2015). http:\/\/libspatialindex.github.io\/. Accessed 20 Feb 2015","key":"24_CR26"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-22852-5_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T06:40:10Z","timestamp":1676961610000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-22852-5_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319228518","9783319228525"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-22852-5_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"11 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}