{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T04:39:01Z","timestamp":1648528741794},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2016,12,21]],"date-time":"2016-12-21T00:00:00Z","timestamp":1482278400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1007\/s11280-016-0426-9","type":"journal-article","created":{"date-parts":[[2016,12,21]],"date-time":"2016-12-21T17:32:09Z","timestamp":1482341529000},"page":"1017-1045","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Tide-tree: A self-tuning indexing scheme for hybrid storage system"],"prefix":"10.1007","volume":"20","author":[{"given":"Sheng","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaolin","family":"Qin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhifeng","family":"Bao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bohan","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,12,21]]},"reference":[{"issue":"1","key":"426_CR1","doi-asserted-by":"crossref","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. Proceedings of the VLDB Endowment 2(1), 361\u2013372 (2009)","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"14","key":"426_CR2","doi-asserted-by":"crossref","first-page":"1881","DOI":"10.14778\/2733085.2733094","volume":"7","author":"M Athanassoulis","year":"2014","unstructured":"Athanassoulis, M., Ailamaki, A.: Bf-tree: approximate tree indexing. Proceedings of the VLDB Endowment 7(14), 1881\u20131892 (2014)","journal-title":"Proceedings of the VLDB Endowment"},{"key":"426_CR3","unstructured":"Boehm, M., Schlegel, B., Volk, P.B., Fischer, U., Habich, D., Lehner, W.: Efficient in-memory indexing with generalized prefix trees. In: BTW, vol. 180, pp 227\u2013246 (2011)"},{"key":"426_CR4","unstructured":"Chaudhuri, S., Weikum, G.: Rethinking database system architecture: Towards a self-tuning risc-style database system. In: VLDB, pp 1\u201310. Citeseer (2000)"},{"issue":"2","key":"426_CR5","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1145\/356770.356776","volume":"11","author":"D Comer","year":"1979","unstructured":"Comer, D.: Ubiquitous b-tree. ACM Comput. Surv. (CSUR) 11(2), 121\u2013137 (1979)","journal-title":"ACM Comput. Surv. (CSUR)"},{"issue":"8","key":"426_CR6","doi-asserted-by":"crossref","first-page":"494","DOI":"10.14778\/2002974.2002977","volume":"4","author":"S Das","year":"2011","unstructured":"Das, S., Nishimura, S., Agrawal, D., El Abbadi, A.: Albatross: lightweight elasticity in shared storage databases for the cloud using live data migration. Proceedings of the VLDB Endowment 4(8), 494\u2013505 (2011)","journal-title":"Proceedings of the VLDB Endowment"},{"key":"426_CR7","unstructured":"Dewitt, S.J.W.D.J.: A performance study of alternative object faulting and pointer swizzling strategies. In: Proceedings 18th Int. Conf. Very Large Data Bases, Vancouver, BC, Canada (1992)"},{"key":"426_CR8","doi-asserted-by":"crossref","unstructured":"Diaconu, C., Freedman, C., Ismert, E., Larson, P.A., Mittal, P., Stonecipher, R., Verma, N., Zwilling, M.: Hekaton: Sql server\u2019s memory-optimized oltp engine. In: Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, pp 1243\u20131254. ACM (2013)","DOI":"10.1145\/2463676.2463710"},{"issue":"9","key":"426_CR9","doi-asserted-by":"crossref","first-page":"2546","DOI":"10.1109\/TPDS.2015.2506573","volume":"27","author":"Z Fu","year":"2016","unstructured":"Fu, Z., Ren, K., Shu, J., Sun, X., Huang, F.: Enabling personalized search over encrypted outsourced data with efficiency improvement. IEEE Trans. Parallel Distrib. Syst. 27(9), 2546\u20132559 (2016)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"426_CR10","doi-asserted-by":"publisher","unstructured":"Fu, Z., Wu, X., Guan, C., Sun, X., Ren, K.: Towards efficient multi-keyword fuzzy search over encrypted outsourced data with accuracy improvement. IEEE Transactions on Information Forensics and Security, doi: 10.1109\/TIFS.2016.2596138 (2016)","DOI":"10.1109\/TIFS.2016.2596138"},{"key":"426_CR11","volume-title":"Database system implementation, vol. 654","author":"H Garcia-Molina","year":"2000","unstructured":"Garcia-Molina, H., Ullman, J.D., Widom, J.: Database system implementation, vol. 654. Prentice Hall Upper Saddle River, NJ (2000)"},{"issue":"4","key":"426_CR12","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1561\/1900000028","volume":"3","author":"G Graefe","year":"2011","unstructured":"Graefe, G.: Modern b-tree techniques. Foundations and Trends in Databases 3(4), 203\u2013402 (2011)","journal-title":"Foundations and Trends in Databases"},{"key":"426_CR13","doi-asserted-by":"crossref","unstructured":"Graefe, G., Kuno, H.: Self-selecting, self-tuning, incrementally optimized indexes. In: Proceedings of the 13th International Conference on Extending Database Technology, pp 371\u2013381. ACM (2010)","DOI":"10.1145\/1739041.1739087"},{"issue":"1","key":"426_CR14","doi-asserted-by":"crossref","first-page":"37","DOI":"10.14778\/2735461.2735465","volume":"8","author":"G Graefe","year":"2014","unstructured":"Graefe, G., Volos, H., Kimura, H., Kuno, H., Tucek, J., Lillibridge, M., Veitch, A.: In-memory performance for big data. Proceedings of the VLDB Endowment 8(1), 37\u201348 (2014)","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"6","key":"426_CR15","doi-asserted-by":"crossref","first-page":"502","DOI":"10.14778\/2168651.2168652","volume":"5","author":"F Halim","year":"2012","unstructured":"Halim, F., Idreos, S., Karras, P., Yap, R.H.: Stochastic database cracking: Towards robust adaptive indexing in main-memory column-stores. Proceedings of the VLDB Endowment 5(6), 502\u2013513 (2012)","journal-title":"Proceedings of the VLDB Endowment"},{"key":"426_CR16","unstructured":"Idreos, S., Kersten, M.L., Manegold, S., et al.: Database cracking. In: CIDR, vol. 3, pp 1\u20138 (2007)"},{"issue":"3","key":"426_CR17","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1007\/s10619-014-7157-7","volume":"33","author":"P Jin","year":"2015","unstructured":"Jin, P., Yang, P., Yue, L.: Optimizing b+-tree for hybrid storage systems. Distributed and Parallel Databases 33(3), 449\u2013475 (2015)","journal-title":"Distributed and Parallel Databases"},{"key":"426_CR18","doi-asserted-by":"crossref","unstructured":"J\u00f8rgensen, M.V., Rasmussen, R.B., \u0160altenis, S., Schj\u00f8nning, C.: Fb-tree: a b+-tree for flash-based ssds. In: Proceedings of the 15th Symposium on International Database Engineering & Applications, pp 34\u201342. ACM (2011)","DOI":"10.1145\/2076623.2076629"},{"issue":"3","key":"426_CR19","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1145\/2380776.2380788","volume":"41","author":"T Kissinger","year":"2012","unstructured":"Kissinger, T., Schlegel, B., Boehm, M., Habich, D., Lehner, W.: A high-throughput in-memory index, durable on flash-based ssd: insights into the winning solution of the sigmod programming contest 2011. ACM SIGMOD Record 41(3), 44\u201350 (2012)","journal-title":"ACM SIGMOD Record"},{"issue":"2","key":"426_CR20","first-page":"6","volume":"36","author":"T Lahiri","year":"2013","unstructured":"Lahiri, T., Neimat, M.A., Folkman, S.: Oracle timesten: An in-memory database for enterprise applications. IEEE Data Eng. Bull. 36(2), 6\u201313 (2013)","journal-title":"IEEE Data Eng. Bull."},{"issue":"9","key":"426_CR21","doi-asserted-by":"crossref","first-page":"901","DOI":"10.1016\/j.datak.2010.03.004","volume":"69","author":"HS Lee","year":"2010","unstructured":"Lee, H.S., Lee, D.H.: An efficient index buffer management scheme for implementing a b-tree on nand flash memory. Data Knowl. Eng. 69(9), 901\u2013916 (2010)","journal-title":"Data Knowl. Eng."},{"key":"426_CR22","doi-asserted-by":"crossref","unstructured":"Lehman, T.J., Carey, M.J.: A study of index structures for main memory database management systems. In: Proceedings VLDB (1986)","DOI":"10.1145\/16856.16878"},{"key":"426_CR23","doi-asserted-by":"crossref","unstructured":"Leis, V., Kemper, A., Neumann, T.: The adaptive radix tree: Artful indexing for main-memory databases. In: 2013 IEEE 29th International Conference on Data Engineering (ICDE), pp 38\u201349. IEEE (2013)","DOI":"10.1109\/ICDE.2013.6544812"},{"key":"426_CR24","doi-asserted-by":"crossref","unstructured":"Li, Y., He, B., Luo, Q., Yi, K.: Tree indexing on flash disks. In: 2009 IEEE 25th International Conference on Data Engineering, pp 1303\u20131306. IEEE (2009)","DOI":"10.1109\/ICDE.2009.226"},{"issue":"1-2","key":"426_CR25","doi-asserted-by":"crossref","first-page":"1195","DOI":"10.14778\/1920841.1920990","volume":"3","author":"Y Li","year":"2010","unstructured":"Li, Y., He, B., Yang, R.J., Luo, Q., Yi, K.: Tree indexing on solid state drives. Proceedings of the VLDB Endowment 3(1-2), 1195\u20131206 (2010)","journal-title":"Proceedings of the VLDB Endowment"},{"key":"426_CR26","doi-asserted-by":"crossref","unstructured":"Lin, Z., Kahng, M., Sabrin, K.M., Chau, D.H.P., Lee, H., Kang, U.: Mmap: Fast billion-scale graph computation on a pc via memory mapping. In: 2014 IEEE International Conference on Big Data (Big Data), pp 159\u2013164. IEEE (2014)","DOI":"10.1109\/BigData.2014.7004226"},{"issue":"4","key":"426_CR27","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/s11280-006-0221-0","volume":"9","author":"X Long","year":"2006","unstructured":"Long, X., Suel, T.: Three-level caching for efficient query processing in large web search engines. World Wide Web 9(4), 369\u2013395 (2006)","journal-title":"World Wide Web"},{"issue":"8","key":"426_CR28","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1145\/358161.358167","volume":"26","author":"JK Mullin","year":"1983","unstructured":"Mullin, J.K.: A second look at bloom filters. Commun. ACM 26(8), 570\u2013571 (1983)","journal-title":"Commun. ACM"},{"key":"426_CR29","doi-asserted-by":"crossref","unstructured":"Nath, S., Kansal, A.: Flashdb: dynamic self-tuning database for nand flash. In: Proceedings of the 6th international conference on Information processing in sensor networks, pp 410\u2013419. ACM (2007)","DOI":"10.1145\/1236360.1236412"},{"issue":"3","key":"426_CR30","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/s11280-014-0322-0","volume":"19","author":"P Peng","year":"2016","unstructured":"Peng, P., Zou, L., Chen, L., Lin, X., Zhao, D.: Answering subgraph queries over massive disk resident graphs. World Wide Web 19(3), 417\u2013448 (2016)","journal-title":"World Wide Web"},{"key":"426_CR31","doi-asserted-by":"crossref","unstructured":"Rao, J., Ross, K.A.: Making b+-trees cache conscious in main memory. In: ACM SIGMOD Record, vol. 29, pp 475\u2013486. ACM (2000)","DOI":"10.1145\/335191.335449"},{"key":"426_CR32","doi-asserted-by":"crossref","unstructured":"Shvachko, K., Kuang, H., Radia, S., Chansler, R.: The hadoop distributed file system. In: 2010 IEEE 26th symposium on mass storage systems and technologies (MSST), pp 1\u201310. IEEE (2010)","DOI":"10.1109\/MSST.2010.5496972"},{"issue":"2","key":"426_CR33","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/s11280-012-0163-7","volume":"16","author":"S Song","year":"2013","unstructured":"Song, S., Chen, L.: Indexing dataspaces with partitions. World wide web 16 (2), 141\u2013170 (2013)","journal-title":"World wide web"},{"key":"426_CR34","first-page":"005","volume":"2","author":"S WANG","year":"2015","unstructured":"WANG, S., QIN, X., SHEN, Y., LI, B., SHI, W.: Research on durable csb+-tree indexing technology. Journal of Frontiers of Computer Science and Technology 2, 005 (2015)","journal-title":"Journal of Frontiers of Computer Science and Technology"},{"issue":"3","key":"426_CR35","doi-asserted-by":"crossref","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)"},{"issue":"2","key":"426_CR36","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1109\/TPDS.2015.2401003","volume":"27","author":"Z Xia","year":"2016","unstructured":"Xia, Z., Wang, X., Sun, X., Wang, Q.: A secure and dynamic multi-keyword ranked search scheme over encrypted cloud data. IEEE Trans. Parallel Distrib. Syst. 27(2), 340\u2013352 (2016)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"1","key":"426_CR37","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10766-014-0340-7","volume":"44","author":"C Yang","year":"2016","unstructured":"Yang, C., Jin, P., Yue, L., Yang, P.: Efficient buffer management for tree indexes on solid state drives. Int. J. Parallel Prog. 44(1), 5\u201325 (2016)","journal-title":"Int. J. Parallel Prog."},{"key":"426_CR38","unstructured":"Zaharia, M., Chowdhury, M., Das, T., Dave, A., Ma, J., McCauley, M., Franklin, M.J., Shenker, S., Stoica, I.: Resilient distributed datasets: A fault-tolerant abstraction for in-memory cluster computing. In: Proceedings of the 9th USENIX conference on Networked Systems Design and Implementation, pp 2\u20132. USENIX Association (2012)"},{"key":"426_CR39","first-page":"10","volume":"10","author":"M Zaharia","year":"2010","unstructured":"Zaharia, M., Chowdhury, M., Franklin, M.J., Shenker, S., Stoica, I.: Spark: cluster computing with working sets. HotCloud 10, 10\u201310 (2010)","journal-title":"HotCloud"}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11280-016-0426-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-016-0426-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-016-0426-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,16]],"date-time":"2019-09-16T20:34:57Z","timestamp":1568666097000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11280-016-0426-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,21]]},"references-count":39,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["426"],"URL":"https:\/\/doi.org\/10.1007\/s11280-016-0426-9","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"value":"1386-145X","type":"print"},{"value":"1573-1413","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,12,21]]}}}