{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T22:05:48Z","timestamp":1766268348966},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642336508"},{"type":"electronic","value":"9783642336515"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33651-5_1","type":"book-chapter","created":{"date-parts":[[2012,11,13]],"date-time":"2012-11-13T04:25:32Z","timestamp":1352780732000},"page":"1-15","source":"Crossref","is-referenced-by-count":28,"title":["CBTree: A Practical Concurrent Self-Adjusting Search Tree"],"prefix":"10.1007","author":[{"given":"Yehuda","family":"Afek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haim","family":"Kaplan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Boris","family":"Korenfeld","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adam","family":"Morrison","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert E.","family":"Tarjan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1145\/1298306.1298310","volume-title":"Proceedings of the 7th ACM SIGCOMM Conference on Internet Measurement, IMC 2007","author":"P. Gill","year":"2007","unstructured":"Gill, P., Arlitt, M., Li, Z., Mahanti, A.: YouTube traffic characterization: a view from the edge. In: Proceedings of the 7th ACM SIGCOMM Conference on Internet Measurement, IMC 2007, pp. 15\u201328. ACM, New York (2007)"},{"issue":"3","key":"1_CR2","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1109\/65.844496","volume":"14","author":"A. Mahanti","year":"2000","unstructured":"Mahanti, A., Williamson, C., Eager, D.: Traffic analysis of a web proxy caching hierarchy. IEEE Network\u00a014(3), 16\u201323 (2000)","journal-title":"IEEE Network"},{"issue":"5","key":"1_CR3","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1109\/TNET.2004.836125","volume":"12","author":"L. Cherkasova","year":"2004","unstructured":"Cherkasova, L., Gupta, M.: Analysis of enterprise media server workloads: access patterns, locality, content evolution, and rates of change. IEEE\/ACM Transactions on Networking\u00a012(5), 781\u2013794 (2004)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/1028788.1028795","volume-title":"Proceedings of the 4th ACM SIGCOMM Conference on Internet Measurement, IMC 2004","author":"K. Sripanidkulchai","year":"2004","unstructured":"Sripanidkulchai, K., Maggs, B., Zhang, H.: An analysis of live streaming workloads on the internet. In: Proceedings of the 4th ACM SIGCOMM Conference on Internet Measurement, IMC 2004, pp. 41\u201354. ACM, New York (2004)"},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1145\/1693453.1693488","volume-title":"Proceedings of the 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2010","author":"N.G. Bronson","year":"2010","unstructured":"Bronson, N.G., Casper, J., Chafi, H., Olukotun, K.: A practical concurrent binary search tree. In: Proceedings of the 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2010, pp. 257\u2013268. ACM, New York (2010)"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/3-540-62592-5_72","volume-title":"Algorithms and Complexity","author":"S. Hanke","year":"1997","unstructured":"Hanke, S., Ottmann, T., Soisalon-soininen, E.: Relaxed Balanced Red-black Trees. In: Bongiovanni, G., Bovet, D.P., Di Battista, G. (eds.) CIAC 1997. LNCS, vol.\u00a01203, pp. 193\u2013204. Springer, Heidelberg (1997)"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1145\/3828.3835","volume":"32","author":"D.D. Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Self-adjusting binary search trees. Journal of the ACM\u00a032, 652\u2013686 (1985)","journal-title":"Journal of the ACM"},{"key":"1_CR8","unstructured":"Knuth, D.E.: The Art of Computer Programming, Volume 3: Sorting and Searching. Addison Wesley Longman Publishing Co., Inc., Redwood City"},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/BF01940876","volume":"16","author":"R. Seidel","year":"1996","unstructured":"Seidel, R., Aragon, C.R.: Randomized search trees. Algorithmica\u00a016, 464\u2013497 (1996), doi:10.1007\/s004539900061","journal-title":"Algorithmica"},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/800152.804906","volume-title":"Proceedings of the Fourth Annual ACM Symposium on Theory of Computing, STOC 1972","author":"J. Nievergelt","year":"1972","unstructured":"Nievergelt, J., Reingold, E.M.: Binary search trees of bounded balance. In: Proceedings of the Fourth Annual ACM Symposium on Theory of Computing, STOC 1972, pp. 137\u2013142. ACM, New York (1972)"},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1109\/SFCS.1980.15","volume-title":"Proceedings of the 21st Annual Symposium on Foundations of Computer Science, FOCS 1980","author":"S.W. Bent","year":"1980","unstructured":"Bent, S.W., Sleator, D.D., Tarjan, R.E.: Biased 2-3 trees. In: Proceedings of the 21st Annual Symposium on Foundations of Computer Science, FOCS 1980, pp. 248\u2013254. IEEE Computer Society, Washington, DC (1980)"},{"key":"1_CR12","doi-asserted-by":"crossref","first-page":"3139","DOI":"10.1002\/j.1538-7305.1983.tb03469.x","volume":"62","author":"J. Feigenbaum","year":"1983","unstructured":"Feigenbaum, J., Tarjan, R.E.: Two new kinds of biased search trees. Bell System Technical Journal\u00a062, 3139\u20133158 (1983)","journal-title":"Bell System Technical Journal"},{"key":"1_CR13","first-page":"467","volume-title":"American Federation of Information Processing Societies: 1975 National Computer Conference, AFIPS 1975","author":"J.L. Baer","year":"1975","unstructured":"Baer, J.L.: Weight-balanced trees. In: American Federation of Information Processing Societies: 1975 National Computer Conference, AFIPS 1975, pp. 467\u2013472. ACM, New York (1975)"},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1145\/1835698.1835736","volume-title":"Proceeding of the 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2010","author":"F. Ellen","year":"2010","unstructured":"Ellen, F., Fatourou, P., Ruppert, E., van Breugel, F.: Non-blocking binary search trees. In: Proceeding of the 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2010, pp. 131\u2013140. ACM, New York (2010)"},{"key":"1_CR15","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1145\/2145816.2145837","volume-title":"Proceedings of the 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2012","author":"T. Crain","year":"2012","unstructured":"Crain, T., Gramoli, V., Raynal, M.: A speculation-friendly binary search tree. In: Proceedings of the 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2012, pp. 161\u2013170. ACM, New York (2012)"},{"key":"1_CR16","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1145\/78973.78977","volume":"33","author":"W. Pugh","year":"1990","unstructured":"Pugh, W.: Skip lists: a probabilistic alternative to balanced trees. Communications of the ACM\u00a033, 668\u2013676 (1990)","journal-title":"Communications of the ACM"},{"issue":"2","key":"1_CR17","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1137\/0606031","volume":"6","author":"R.E. Tarjan","year":"1985","unstructured":"Tarjan, R.E.: Amortized computational complexity. SIAM Journal on Algebraic and Discrete Methods\u00a06(2), 306\u2013318 (1985)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Afek, Y., Kaplan, H., Korenfeld, B., Morrison, A., Tarjan, R.E.: CBTree: A practical concurrent self-adjusting search tree. Technical report (2012)","DOI":"10.1007\/978-3-642-33651-5_1"},{"key":"1_CR19","first-page":"129","volume-title":"Readings in Database Systems","author":"R. Bayer","year":"1988","unstructured":"Bayer, R., Schkolnick, M.: Concurrency of operations on b-trees. In: Readings in Database Systems, pp. 129\u2013139. Morgan Kaufmann Publishers Inc., San Francisco (1988)"},{"key":"1_CR20","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M.P. Herlihy","year":"1990","unstructured":"Herlihy, M.P., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems (TOPLAS)\u00a012, 463\u2013492 (1990)","journal-title":"ACM Transactions on Programming Languages and Systems (TOPLAS)"},{"key":"1_CR21","unstructured":"Sleator, D.D.: Splay tree implementation, \n                    \n                      http:\/\/www.link.cs.cmu.edu\/splay"},{"key":"1_CR22","unstructured":"Project Gutenberg, \n                    \n                      http:\/\/www.gutenberg.org\/"},{"key":"1_CR23","unstructured":"kc\u00a0claffy, Andersen, D., Hick, P.: The CAIDA anonymized 2011 internet traces, \n                    \n                      http:\/\/www.caida.org\/data\/passive\/passive_2011_dataset.xml"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Zink, M., Suh, K., Gu, Y., Kurose, J.: Watch global, cache local: YouTube network traffic at a campus network - measurements and implications. In: Proceeding of the 15th SPIE\/ACM Multimedia Computing and Networking Conference, vol.\u00a06818 (2008)","DOI":"10.1117\/12.774903"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33651-5_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T08:17:25Z","timestamp":1620116245000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33651-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642336508","9783642336515"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33651-5_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}