{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:08:19Z","timestamp":1725602899652},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642230875"},{"type":"electronic","value":"9783642230882"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23088-2_5","type":"book-chapter","created":{"date-parts":[[2011,8,25]],"date-time":"2011-08-25T08:56:20Z","timestamp":1314262580000},"page":"62-77","source":"Crossref","is-referenced-by-count":0,"title":["NEFOS: Rapid Cache-Aware Range Query Processing with Probabilistic Guarantees"],"prefix":"10.1007","author":[{"given":"Spyros","family":"Sioutas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kostas","family":"Tsichlas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ioannis","family":"Karydis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yannis","family":"Manolopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yannis","family":"Theodoridis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Arge, L., de Berg, M., Haverkort, H.J., Yi, K.: The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree. In: SIGMOD Conf., pp. 347\u2013358 (2004)","DOI":"10.1145\/1007568.1007608"},{"issue":"9","key":"5_CR2","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A. Aggarwal","year":"1988","unstructured":"Aggarwal, A., Vitter, J.S.: The Input\/Output Complexity of Sorting and Related Problems. C. ACM\u00a031(9), 1116\u20131127 (1988)","journal-title":"C. ACM"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/3-540-56939-1_58","volume-title":"Automata, Languages and Programming","author":"A. Andersson","year":"1993","unstructured":"Andersson, A., Mattson, C.: Dynamic Interpolation Search in o(loglogn) Time. In: Lingas, A., Carlsson, S., Karlsson, R. (eds.) ICALP 1993. LNCS, vol.\u00a0700, pp. 15\u201327. Springer, Heidelberg (1993)"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Beckmann, N., Krigel, H., Schneider, R., Seeger, B.: The R*-tree: An Efficient and Robust Access Method for Points and Rectangles. In: SIGMOD (1990)","DOI":"10.1145\/93597.98741"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF00288683","volume":"1","author":"R. Bayer","year":"1972","unstructured":"Bayer, R., McCreight, E.: Organization of large ordered indexes. Acta Informatica\u00a01, 173\u2013189 (1972)","journal-title":"Acta Informatica"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J. Dean","year":"2008","unstructured":"Dean, J., Ghemawat, S.: Mapreduce: Simplified data processing on large clusters. C. ACM\u00a051, 107\u2013113 (2008)","journal-title":"C. ACM"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/0020-0190(94)00115-4","volume":"52","author":"P. Dietz","year":"1994","unstructured":"Dietz, P., Raman, R.: A constant update time finger search tree. Information Processing Letters\u00a052, 147\u2013154 (1994)","journal-title":"Information Processing Letters"},{"issue":"3","key":"5_CR8","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1145\/320083.320092","volume":"4","author":"R. Fagin","year":"1979","unstructured":"Fagin, R., Nievergelt, J., Pippinger, N., Strong, H.R.: Extendible Hashing-A fast access method for dynamic files. ACM Trans.\u00a0Database Systems\u00a04(3), 315\u2013344 (1979)","journal-title":"ACM Trans.\u00a0Database Systems"},{"issue":"2","key":"5_CR9","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/301970.301973","volume":"46","author":"P. Ferragina","year":"1999","unstructured":"Ferragina, P., Grossi, R.: The String B-tree: A New Data Structure for String Search in External Memory and Its Applications. Journal of the ACM\u00a046(2), 236\u2013280 (1999)","journal-title":"Journal of the ACM"},{"issue":"5","key":"5_CR10","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1145\/129617.129623","volume":"35","author":"E. Fox","year":"1992","unstructured":"Fox, E., Chen, Q., Daoud, A.: Practical Minimal Perfect Hash Functions for Large Databases. C. ACM\u00a035(5), 105\u2013121 (1992)","journal-title":"C. ACM"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-540-39658-1_31","volume-title":"Algorithms - ESA 2003","author":"A. Kaporis","year":"2003","unstructured":"Kaporis, A., Makris, C., Sioutas, S., Tsakalidis, A., Tsichlas, K., Zaroliagis, C.: Improved Bounds for Finger Search on a RAM. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 325\u2013336. Springer, Heidelberg (2003)"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/11602613_33","volume-title":"Algorithms and Computation","author":"A. Kaporis","year":"2005","unstructured":"Kaporis, A., Makris, C., Mavritsakis, G., Sioutas, S., Tsakalidis, A., Tsichlas, K., Zaroliagis, C.: ISB-Tree: A New Indexing Scheme with Efficient Expected Behaviour. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol.\u00a03827, pp. 318\u2013327. Springer, Heidelberg (2005)"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1109\/TSE.1977.231160","volume":"3","author":"D.E. Knuth","year":"1977","unstructured":"Knuth, D.E.: Deletions that preserve randomness. IEEE Trans. Softw. Eng.\u00a03, 351\u2013359 (1977)","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"4","key":"5_CR14","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1145\/319628.319663","volume":"6","author":"P. Lehman","year":"1981","unstructured":"Lehman, P., Bing Yao, S.: Efficient Locking for Concurrent Operations on B-Trees. ACM Trans.\u00a0Database Systems\u00a06(4), 650\u2013670 (1981)","journal-title":"ACM Trans.\u00a0Database Systems"},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF00299635","volume":"26","author":"C. Levcopoulos","year":"1988","unstructured":"Levcopoulos, C., Overmars, M.H.: Balanced Search Tree with O(1) Worst-case Update Time. Acta Informatica\u00a026, 269\u2013277 (1988)","journal-title":"Acta Informatica"},{"key":"5_CR16","unstructured":"Litwin, W.: Linear Hashing: A new tool for files and tables addressing. In: International Conference on Very Large Databases, vol.\u00a06, pp. 212\u2013223 (1980)"},{"issue":"2","key":"5_CR17","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1109\/MS.1987.230092","volume":"4","author":"W. Litwin","year":"1987","unstructured":"Litwin, W., Lomet, D.: A New Method for Fast Data Searches with Keys. IEEE Software\u00a04(2), 16\u201324 (1987)","journal-title":"IEEE Software"},{"key":"5_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8590-3","volume-title":"Advanced Database Indexing","author":"Y. Manolopoulos","year":"2000","unstructured":"Manolopoulos, Y., Theodoridis, Y., Tsotras, V.: Advanced Database Indexing. Kluwer Academic Publishers, Dordrecht (2000)"},{"issue":"3","key":"5_CR19","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1145\/174130.174139","volume":"40","author":"K. Mehlhorn","year":"1993","unstructured":"Mehlhorn, K., Tsakalidis, A.: Dynamic Interpolation Search. Journal of the ACM\u00a040(3), 621\u2013634 (1993)","journal-title":"Journal of the ACM"},{"key":"5_CR20","unstructured":"Raman, R.: Eliminating Amortization: On Data Structures with Guaranteed Response Time. PhD Thesis, Dept. of Computer Science, University of Rochester, New York; Technical Report TR-439 (1992)"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Seeger, B., Larson, P.A.: Multi-Disk B-trees. In: Proc.\u00a0SIGMOD Conference, pp. 436\u2013445 (1991)","DOI":"10.1145\/115790.115862"},{"issue":"4","key":"5_CR22","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/BF01263046","volume":"2","author":"V. Srinivasan","year":"1993","unstructured":"Srinivasan, V., Carey, M.J.: Performance of B+ Tree Concurrency Algorithms. VLDB Journal\u00a02(4), 361\u2013406 (1993)","journal-title":"VLDB Journal"},{"key":"5_CR23","unstructured":"Theodoridis, Y.: The R-tree Portal (2003), http:\/\/www.rtreeportal.org , [Tiger1] and [Tiger2] data sets in http:\/\/www.rtreeportal.org"},{"issue":"2","key":"5_CR24","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/384192.384193","volume":"33","author":"J.S. Vitter","year":"2001","unstructured":"Vitter, J.S.: External memory algorithms and data structures: dealing with massive data. ACM Computing Surveys\u00a033(2), 209\u2013271 (2001)","journal-title":"ACM Computing Surveys"},{"issue":"2-3","key":"5_CR25","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/BF01185207","volume":"12","author":"J.S. Vitter","year":"1994","unstructured":"Vitter, J.S., Shriver, E.A.M.: Optimal Algorithms for Parallel Memory I: Two-Level Memories. Algorithmica\u00a012(2-3), 110\u2013147 (1994)","journal-title":"Algorithmica"},{"issue":"4","key":"5_CR26","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1137\/0214071","volume":"14","author":"D.E. Willard","year":"1985","unstructured":"Willard, D.E.: Searching Unindexed and Nonuniformly Generated Files in loglogN Time. SIAM Journal of Computing\u00a014(4), 1013\u20131029 (1985)","journal-title":"SIAM Journal of Computing"},{"issue":"3","key":"5_CR27","doi-asserted-by":"publisher","first-page":"1030","DOI":"10.1137\/S0097539797322425","volume":"29","author":"D.E. Willard","year":"2000","unstructured":"Willard, D.E.: Examining Computational Geometry, van Emde Boas Trees, and Hashing from the Perspective of the Fusion Tree. SIAM Journal of Computing\u00a029(3), 1030\u20131049 (2000)","journal-title":"SIAM Journal of Computing"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23088-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T07:37:28Z","timestamp":1560497848000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23088-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642230875","9783642230882"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23088-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}