{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:34:20Z","timestamp":1743068060178,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319639628"},{"type":"electronic","value":"9783319639628"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-63962-8_168-1","type":"book-chapter","created":{"date-parts":[[2018,7,9]],"date-time":"2018-07-09T07:01:39Z","timestamp":1531119699000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Structures for Large Data Sets"],"prefix":"10.1007","author":[{"given":"Peiquan","family":"Jin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,7]]},"reference":[{"key":"168-1_CR1","unstructured":"Bender M, Kuszmaul B (2013) Data structures and algorithms for big databases. In: 7th extremely large databases conference, Workshop, and Tutorials (XLDB), Stanford University, California"},{"key":"168-1_CR2","unstructured":"Black P (2009) Hash table. In: Pieterse V, Black P (eds) Dictionary of algorithms and data structures. http:\/\/www.nist.gov\/dads\/HTML\/hashtab.html"},{"key":"168-1_CR3","unstructured":"Black P (2014) Skip list. In: Pieterse V, Black P (eds) Dictionary of algorithms and data structures. https:\/\/www.nist.gov\/dads\/HTML\/skiplist.html"},{"issue":"7","key":"168-1_CR4","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"B Bloom","year":"1970","unstructured":"Bloom B (1970) Space\/time trade-offs in hash coding with allowable errors. Commun ACM 13(7):422\u2013426","journal-title":"Commun ACM"},{"key":"168-1_CR5","doi-asserted-by":"crossref","unstructured":"Boldi P, Rosa M, Vigna S (2011) HyperANF: approximating the neighbourhood function of very large graphs on a budget. In: Srinivasan S et al (eds) Proceedings of the 20th international conference on World Wide Web, March 2011, Hyderabad\/India, p 625\u2013634","DOI":"10.1145\/1963405.1963493"},{"key":"168-1_CR6","first-page":"684","volume-title":"Lecture Notes in Computer Science","author":"Flavio Bonomi","year":"2006","unstructured":"Bonomi F, Mitzenmacher M, Panigrahy R, Singh S, Varghese G (2006) An improved construction for counting Bloom filters. In: Azar Y, Erlebach T (eds) Algorithms \u2013 ESA 2006, the 14th annual european symposium on algorithms, September 2006, LNCS 4168, Zurich, Switzerland, p 684\u2013695"},{"key":"168-1_CR7","unstructured":"Broder A, Charikar M, Frieze A, Mitzenmacher M (1998) Min-wise independent permutations. In: Vitter J (eds) Proceedings of the thirtieth annual ACM symposium on the theory of computing, May 1998, Dallas, Texas, p 327\u2013336"},{"key":"168-1_CR8","first-page":"108","volume-title":"Lecture Notes in Computer Science","author":"Kaimeng Chen","year":"2014","unstructured":"Chen K, Jin P, Yue L (2014) A novel page replacement algorithm for the hybrid memory architecture involving PCM and DRAM. In: Hsu C et al (eds) Proceedings of the 11th IFIP WG 10.3 international conference on network and parallel computing, September 2014, Ilan, Taiwan, p 108\u2013119"},{"issue":"2","key":"168-1_CR9","doi-asserted-by":"publisher","first-page":"1277","DOI":"10.14778\/1454159.1454167","volume":"1","author":"B Cooper","year":"2008","unstructured":"Cooper B, Ramakrishnan R, Srivastava U, Silberstein A, Bohannon P, Jacobsen H, Puz N, Weaver D, Yerneni R (2008) PNUTS: Yahoo!\u2019s hosted data serving platform. Proc VLDB Endowment 1(2):1277\u20131288","journal-title":"Proc VLDB Endowment"},{"key":"168-1_CR10","first-page":"253","volume-title":"Introduction to algorithms","author":"T Cormen","year":"2009","unstructured":"Cormen T, Leiserson C, Rivest R, Stein C (2009) Introduction to algorithms, 3rd edn. MIT Press, Boston, pp 253\u2013280","edition":"3"},{"key":"168-1_CR11","doi-asserted-by":"crossref","unstructured":"Das A, Datar M, Garg A, Rajaram S (2007) Google news personalization: scalable online collaborative filtering. In: Williamson C et al (eds) Proceedings of the 16th international conference on World Wide Web, May 2007, Banff, Alberta, p 271\u2013280","DOI":"10.1145\/1242572.1242610"},{"key":"168-1_CR12","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1016\/B978-012088469-8.50060-7","volume-title":"Proceedings 2004 VLDB Conference","author":"G GRAEFE","year":"2004","unstructured":"Graefe G (2004) Write-Optimized B-Trees. In: Nascimento M, \u00d6zsu M, Kossmann D, et al. (eds) Proceedings of the thirtieth international conference on very large data bases, Toronto, Canada, p 672\u2013683"},{"key":"168-1_CR13","doi-asserted-by":"crossref","unstructured":"Henzinger M (2006) Finding near-duplicate web pages: a large-scale evaluation of algorithms, In: Efthimiadis E et al (eds) Proceedings of the 29th annual international ACM SIGIR conference on research and development in information retrieval, August 2006, Seattle, Washington, p 284\u2013291","DOI":"10.1145\/1148170.1148222"},{"issue":"3","key":"168-1_CR14","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/s10619-014-7157-7","volume":"33","author":"P Jin","year":"2015","unstructured":"Jin P, Yang P, Yue L (2015) Optimizing B+-tree for hybrid storage systems. Distrib Parallel Databases 33(3):449\u2013475","journal-title":"Distrib Parallel Databases"},{"issue":"5","key":"168-1_CR15","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1007\/s00778-015-0406-1","volume":"25","author":"P Jin","year":"2016","unstructured":"Jin P, Yang C, Jensen C, Yang P, Yue L (2016) Read\/write-optimized tree indexing for solid-state drives. VLDB J 25(5):695\u2013717","journal-title":"VLDB J"},{"key":"168-1_CR16","doi-asserted-by":"crossref","unstructured":"Karger D, Lehman E, Leighton T, Panigrahy R, Levine M, Lewin D (1997) Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the world wide web. In: Leighton F et al (eds) Proceedings of the twenty-ninth Annual ACM symposium on the theory of computing, May 1997, El Paso, Texas, p 654\u2013663","DOI":"10.1145\/258533.258660"},{"key":"168-1_CR17","first-page":"513","volume-title":"The art of computer programming. 3: sorting and searching","author":"D Knuth","year":"1998","unstructured":"Knuth D (1998) The art of computer programming. 3: sorting and searching, 2nd edn. Addison-Wesley, New York, pp 513\u2013558","edition":"2"},{"key":"168-1_CR18","doi-asserted-by":"crossref","unstructured":"Li X, Da Z, Meng X (2008) A new dynamic hash index for flash-based storage. In Jia Y et al (eds) Proceedings of the ninth international conference on web-age information management, July 2008, Zhangjiajie, China, p 93\u201398","DOI":"10.1109\/WAIM.2008.53"},{"issue":"1","key":"168-1_CR19","doi-asserted-by":"publisher","first-page":"1195","DOI":"10.14778\/1920841.1920990","volume":"3","author":"Y Li","year":"2010","unstructured":"Li Y, He B, Yang J, Luo Q, Yi K (2010) Tree indexing on solid state drives. Proc VLDB Endowment 3(1):1195\u20131206","journal-title":"Proc VLDB Endowment"},{"key":"168-1_CR20","first-page":"357","volume-title":"Lecture Notes in Computer Science","author":"Lu Li","year":"2016","unstructured":"Li L, Jin P, Yang C, Wan S, Yue L (2016) XB+-tree: a novel index for PCM\/DRAM-based hybrid memory. In: Cheema M et al (eds) Databases theory and applications \u2013 proceedings of the 27th Australasian database conference, September 2016, LNCS 9877, Sydney, Australia, p 357\u2013368"},{"key":"168-1_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-39940-9","volume-title":"Encyclopedia of database systems","author":"L Liu","year":"2009","unstructured":"Liu L, \u00d6zsu M (2009) Encyclopedia of database systems. Springer, New York"},{"issue":"3","key":"168-1_CR22","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1145\/2805789.2805800","volume":"45","author":"B Maggs","year":"2015","unstructured":"Maggs B, Sitaraman R (2015) Algorithmic nuggets in content delivery. SIGCOMM Comput Commun Rev 45(3):52\u201366","journal-title":"SIGCOMM Comput Commun Rev"},{"issue":"4","key":"168-1_CR23","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s002360050048","volume":"33","author":"P O\u2019Neil","year":"1996","unstructured":"O\u2019Neil P, Cheng E, Gawlick D, O\u2019Neil E (1996) The log-structured merge-tree (LSM-tree). Acta Informatica 33(4):351\u2013385","journal-title":"Acta Informatica"},{"key":"168-1_CR24","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1186\/2194-3206-1-19","volume":"1","author":"E Pournaras","year":"2013","unstructured":"Pournaras E, Warnier M, Brazier F (2013) A generic and adaptive aggregation service for large-scale decentralized networks. Complex Adapt Syst Model 1:19","journal-title":"Complex Adapt Syst Model"},{"issue":"6","key":"168-1_CR25","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1145\/78973.78977","volume":"33","author":"W Pugh","year":"1990","unstructured":"Pugh W (1990) Skip lists: a probabilistic alternative to balanced trees. Commun ACM 33(6):668","journal-title":"Commun ACM"},{"issue":"18","key":"168-1_CR26","doi-asserted-by":"publisher","first-page":"3136","DOI":"10.1016\/j.ins.2009.05.007","volume":"179","author":"H Roh","year":"2009","unstructured":"Roh H, Kim W, Kim S, Park S (2009) A B-tree index extension to enhance response time and the life cycle of flash memory. Inf Sci 179(18):3136\u20133161","journal-title":"Inf Sci"},{"key":"168-1_CR27","doi-asserted-by":"crossref","unstructured":"Wang L, Wang H (2010) A new self-adaptive extendible hash index for flash-based DBMS. In Hao Y et al (eds) Proceedings of the 2010 IEEE international conference on information and automation, June 2010, Haerbin, China, p 2519\u20132524","DOI":"10.1109\/ICINFA.2010.5512045"},{"issue":"1","key":"168-1_CR28","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1109\/JPROC.2015.2487976","volume":"104","author":"J Wang","year":"2016","unstructured":"Wang J, Liu W, Kumar S, Chang S (2016) Learning to hash for indexing big data \u2013 a survey. Proc IEEE 104(1):34\u201357","journal-title":"Proc IEEE"},{"issue":"7","key":"168-1_CR29","doi-asserted-by":"publisher","first-page":"1716","DOI":"10.1587\/transfun.E92.A.1716","volume":"92","author":"C Yang","year":"2009","unstructured":"Yang C, Lee K, Kim M, Lee Y (2009) An efficient dynamic hash index structure for NAND flash memory. IEICE Trans Fundam Electron Commun Comput Sci 92(7):1716\u20131719","journal-title":"IEICE Trans Fundam Electron Commun Comput Sci"},{"key":"168-1_CR30","doi-asserted-by":"crossref","unstructured":"Yang C, Jin P, Yue L, Zhang D (2016) Self-adaptive linear hashing for solid state drives. In Hsu M et al (eds) Proceedings of the 32nd IEEE international conference on data engineering, May 2016, Helsinki, Finland, p 433\u2013444","DOI":"10.1109\/ICDE.2016.7498260"},{"key":"168-1_CR31","doi-asserted-by":"crossref","unstructured":"Yoo M, Kim B, Lee D (2012). Hybrid hash index for NAND flash memory-based storage systems. In: Lee S et al (eds) Proceedings of the 6th international conference on ubiquitous information management and communication, February 2012, Kuala Lumpur, Malaysia, p 55:1\u201355:5","DOI":"10.1145\/2184751.2184819"},{"key":"168-1_CR32","unstructured":"Zeinalipour-Yazti D, Lin S, Kalogeraki V, Gunopulos D, Najjar W (2005) MicroHash: an efficient index structure for flash-based sensor devices. In: Gibson G (eds) Proceedings of the FAST \u201805 conference on file and storage technologies, December 2005, San Francisco, California, p 1\u201314"}],"container-title":["Encyclopedia of Big Data Technologies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-63962-8_168-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T03:04:48Z","timestamp":1557457488000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-63962-8_168-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319639628","9783319639628"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-63962-8_168-1","relation":{},"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"4 May 2018, 00:00:00","order":1,"name":"received","label":"Received","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"8 May 2018, 00:00:00","order":2,"name":"accepted","label":"Accepted","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"7 June 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}