{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T03:31:24Z","timestamp":1781062284805,"version":"3.54.1"},"reference-count":48,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2015,7,20]],"date-time":"2015-07-20T00:00:00Z","timestamp":1437350400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ACM Trans. Spatial Algorithms Syst."],"published-print":{"date-parts":[[2015,11,5]]},"abstract":"<jats:p>Due to several important features, such as high performance, low power consumption, and shock resistance, NAND flash has become a very popular stable storage medium for embedded mobile devices, personal computers, and even enterprise servers. However, the peculiar characteristics of flash memory require redesigning the existing data storage and indexing techniques that were devised for magnetic hard disks.<\/jats:p>\n          <jats:p>In this article, we propose TRIFL, an efficient and generic TRajectory Index for FLash. TRIFL is designed around the key requirements of trajectory indexing and flash storage. TRIFL is generic in the sense that it is efficient for both simple flash storage devices such as SD cards and more powerful devices such as solid state drives. In addition, TRIFL is supplied with an online self-tuning algorithm that allows adapting the index structure to the workload and the technical specifications of the flash storage device to maximize the index performance. Moreover, TRIFL achieves good performance with relatively low memory requirements, which makes the index appropriate for many application scenarios. The experimental evaluation shows that TRIFL outperforms the representative indexing methods on magnetic disks and flash disks.<\/jats:p>","DOI":"10.1145\/2786758","type":"journal-article","created":{"date-parts":[[2016,5,21]],"date-time":"2016-05-21T22:27:38Z","timestamp":1463869658000},"page":"1-44","source":"Crossref","is-referenced-by-count":8,"title":["TRIFL"],"prefix":"10.1145","volume":"1","author":[{"given":"Dai Hai Ton","family":"That","sequence":"first","affiliation":[{"name":"University of Versailles Saint-Quentin, Versailles, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Iulian Sandu","family":"Popa","sequence":"additional","affiliation":[{"name":"University of Versailles Saint-Quentin and INRIA Paris-Rocquencourt, Versailles, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Karine","family":"Zeitouni","sequence":"additional","affiliation":[{"name":"University of Versailles Saint-Quentin, Versailles, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2015,7,20]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687669"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10707-004-5621-7"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10619-012-7119-x"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10707-007-0030-3"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1015231126594"},{"key":"e_1_2_1_6_1","volume-title":"CIDR","author":"Chakka V. P.","year":"2003","unstructured":"V. P. Chakka , Adam Everspaugh , and Jignesh M. Patel . 2003. Indexing large trajectory data sets with SETI . In CIDR 2003 . V. P. Chakka, Adam Everspaugh, and Jignesh M. Patel. 2003. Indexing large trajectory data sets with SETI. In CIDR 2003."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10707-013-0192-0"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2011.06.073"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2010.5447829"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2011.6069707"},{"key":"e_1_2_1_11_1","volume-title":"METIS\u2014Family of Multilevel Partitioning Algorithms. Retrieved","year":"2014","unstructured":"Glaros.dtc.umn.edu. 2014. METIS\u2014Family of Multilevel Partitioning Algorithms. Retrieved May 7, 2014 from http:\/\/glaros.dtc.umn.edu\/gkhome\/views\/metis. Glaros.dtc.umn.edu. 2014. METIS\u2014Family of Multilevel Partitioning Algorithms. Retrieved May 7, 2014 from http:\/\/glaros.dtc.umn.edu\/gkhome\/views\/metis."},{"key":"e_1_2_1_12_1","volume-title":"G\u00fcting and Markus Schneider","author":"Ralf","year":"2005","unstructured":"Ralf H. G\u00fcting and Markus Schneider . 2005 . Moving Objects Databases. Morgan Kaufmann . Ralf H. G\u00fcting and Markus Schneider. 2005. Moving Objects Databases. Morgan Kaufmann."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36071-8_2"},{"key":"e_1_2_1_14_1","first-page":"134","article-title":"High-concurrency locking in R-trees","volume":"1995","author":"Kornacker Marcel","year":"1995","unstructured":"Marcel Kornacker and Douglas Banks . 1995 . High-concurrency locking in R-trees . In VLDB 1995 , 134 -- 145 . Marcel Kornacker and Douglas Banks. 1995. High-concurrency locking in R-trees. In VLDB 1995, 134--145.","journal-title":"VLDB"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.956099"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2010.5560598"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247488"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/319628.319663"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920990"},{"key":"e_1_2_1_21_1","volume-title":"FD-Tree: A Tree Index on Solid State Drives. Retrieved","author":"Li Yinan","year":"2014","unstructured":"Yinan Li , Bingsheng He , Robin J. Yang , Qiong Luo , and Ke Yi. 2014. FD-Tree: A Tree Index on Solid State Drives. Retrieved May 7, 2014 from http:\/\/pages.cs.wisc.edu\/&sim;yinan\/fdtree.html. Yinan Li, Bingsheng He, Robin J. Yang, Qiong Luo, and Ke Yi. 2014. FD-Tree: A Tree Index on Solid State Drives. Retrieved May 7, 2014 from http:\/\/pages.cs.wisc.edu\/&sim;yinan\/fdtree.html."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1071246.1071256"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1210596.1210601"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/MDM.2007.46"},{"key":"e_1_2_1_25_1","first-page":"40","article-title":"Spatio-temporal access methods","volume":"26","author":"Mokbel Mohamed F.","year":"2003","unstructured":"Mohamed F. Mokbel , Thanaa M. Ghanem , and Walid G. Aref . 2003 . Spatio-temporal access methods . IEEE Data Engineering Bulletin 26 , 2 (2003), 40 -- 49 . Mohamed F. Mokbel, Thanaa M. Ghanem, and Walid G. Aref. 2003. Spatio-temporal access methods. IEEE Data Engineering Bulletin 26, 2 (2003), 40--49.","journal-title":"IEEE Data Engineering Bulletin"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/2960717.2960721"},{"key":"e_1_2_1_27_1","first-page":"46","article-title":"Spatio-temporal access methods: Part 2 (2003--2010)","volume":"33","author":"Nguyen-Dinh L-V.","year":"2010","unstructured":"L-V. Nguyen-Dinh , Walid G. Aref , and Mohamed. F. Mokbel . 2010 . Spatio-temporal access methods: Part 2 (2003--2010) . IEEE Data Engineering Bulletin 33 , 2 (2010), 46 -- 55 . L-V. Nguyen-Dinh, Walid G. Aref, and Mohamed. F. Mokbel. 2010. Spatio-temporal access methods: Part 2 (2003--2010). IEEE Data Engineering Bulletin 33, 2 (2010), 46--55.","journal-title":"IEEE Data Engineering Bulletin"},{"key":"e_1_2_1_28_1","volume-title":"Specifications. Retrieved","year":"2014","unstructured":"Ocz.com. 2014. OCZ , SSD OCZ Vertex 4 SATA 3 , Specifications. Retrieved May 7, 2014 from http:\/\/ocz.com\/consumer\/vertex-4-sata-3-ssd\/specifications. Ocz.com. 2014. OCZ, SSD OCZ Vertex 4 SATA 3, Specifications. Retrieved May 7, 2014 from http:\/\/ocz.com\/consumer\/vertex-4-sata-3-ssd\/specifications."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002360050048"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767898"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007639"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132863.1132870"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.14778\/2095686.2095688"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/335191.335427"},{"key":"e_1_2_1_35_1","volume-title":"ICDE","author":"Popa Iulian Sandu","year":"2010","unstructured":"Iulian Sandu Popa , Karine Zeitouni , Vincent Oria , Dominique Barth , and SandrineVial. 2010 . PARINET: A tunable access method for in-network trajectories . In ICDE 2010, 177--188. Iulian Sandu Popa, Karine Zeitouni, Vincent Oria, Dominique Barth, and SandrineVial. 2010. PARINET: A tunable access method for in-network trajectories. In ICDE 2010, 177--188."},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-011-0236-8"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.5555\/2035253.2035267"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10707-012-0164-9"},{"key":"e_1_2_1_39_1","volume-title":"Retrieved","author":"Schmid Patrick","year":"2014","unstructured":"Patrick Schmid and Achim Roos . 2014. SDXC\/ SDHC Memory Cards , Rounded Up and Benchmarked. Retrieved May 7, 2014 from http:\/\/tinyurl.com\/tom-sdxc. Patrick Schmid and Achim Roos. 2014. SDXC\/SDHC Memory Cards, Rounded Up and Benchmarked. Retrieved May 7, 2014 from http:\/\/tinyurl.com\/tom-sdxc."},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213862"},{"key":"e_1_2_1_41_1","first-page":"431","article-title":"MV3R-Tree: A spatio-temporal access method for timestamp and interval queries","volume":"2001","author":"Tao Yufei","year":"2001","unstructured":"Yufei Tao and Dimitris Papadias . 2001 . MV3R-Tree: A spatio-temporal access method for timestamp and interval queries . In VLDB 2001 , 431 -- 440 . Yufei Tao and Dimitris Papadias. 2001. MV3R-Tree: A spatio-temporal access method for timestamp and interval queries. In VLDB 2001, 431--440.","journal-title":"VLDB"},{"key":"e_1_2_1_42_1","volume-title":"VLDB","author":"Tao Yufei","year":"2003","unstructured":"Yufei Tao , Dimitris Papadias , and Jimeng Sun . 2003. The TPR&ast;-tree: An optimized spatio-temporal access method for predictive queries . In VLDB ( 2003 ), 790--801. Yufei Tao, Dimitris Papadias, and Jimeng Sun. 2003. The TPR&ast;-tree: An optimized spatio-temporal access method for predictive queries. In VLDB (2003), 790--801."},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1869983.1869993"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2070942.2070974"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36672-7_4"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/1275986.1275991"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516429"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526816"}],"container-title":["ACM Transactions on Spatial Algorithms and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2786758","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2786758","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:07:39Z","timestamp":1750223259000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2786758"}},"subtitle":["A Generic Trajectory Index for Flash Storage"],"short-title":[],"issued":{"date-parts":[[2015,7,20]]},"references-count":48,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,11,5]]}},"alternative-id":["10.1145\/2786758"],"URL":"https:\/\/doi.org\/10.1145\/2786758","relation":{},"ISSN":["2374-0353","2374-0361"],"issn-type":[{"value":"2374-0353","type":"print"},{"value":"2374-0361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,20]]}}}