{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T09:44:13Z","timestamp":1725529453080},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642008863"},{"type":"electronic","value":"9783642008870"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-00887-0_27","type":"book-chapter","created":{"date-parts":[[2009,3,19]],"date-time":"2009-03-19T13:49:36Z","timestamp":1237470576000},"page":"308-322","source":"Crossref","is-referenced-by-count":18,"title":["Traverse: Simplified Indexing on Large Map-Reduce-Merge Clusters"],"prefix":"10.1007","author":[{"given":"Hung-chih","family":"Yang","sequence":"first","affiliation":[]},{"given":"D. Stott","family":"Parker","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","unstructured":"Apache. Hadoop (2006), \n                    \n                      http:\/\/lucene.apache.org\/hadoop\/"},{"issue":"3","key":"27_CR2","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF00288683","volume":"1","author":"R. Bayer","year":"1972","unstructured":"Bayer, R., McCreight, E.M.: Organization and Maintenance of Large Ordered Indices. Acta Inf.\u00a01(3), 173\u2013189 (1972)","journal-title":"Acta Inf."},{"key":"27_CR3","volume-title":"Readings in Database Systems","author":"E.A. Brewer","year":"2005","unstructured":"Brewer, E.A.: Combining Systems and Databases: A Search Engine Retrospective. In: Hellerstein, J.M., Stonebraker, M. (eds.) Readings in Database Systems, 4th edn. MIT Press, Cambridge (2005)","edition":"4"},{"issue":"2","key":"27_CR4","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1145\/356770.356776","volume":"11","author":"D. Comer","year":"1979","unstructured":"Comer, D.: The Ubiquitous B-tree. Comp. Surveys\u00a011(2), 121\u2013137 (1979)","journal-title":"Comp. Surveys"},{"key":"27_CR5","unstructured":"Dean, J., Ghemawat, S.: MapReduce: Simplified Data Processing on Large Clusters.. In: OSDI, pp. 137\u2013150 (2004)"},{"issue":"3","key":"27_CR6","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1145\/320083.320092","volume":"4","author":"R. Fagin","year":"1979","unstructured":"Fagin, R., et al.: Extendible Hashing - A Fast Access Method for Dynamic Files. TODS\u00a04(3), 315\u2013344 (1979)","journal-title":"TODS"},{"key":"27_CR7","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/1140402.1140409","volume-title":"DaMoN","author":"G. Graefe","year":"2006","unstructured":"Graefe, G.: B-tree Indexes, Interpolation Search, and Skew. In: Ailamaki, A., Boncz, P.A., Manegold, S. (eds.) DaMoN, p. 5. ACM, New York (2006)"},{"key":"27_CR8","first-page":"47","volume-title":"SIGMOD 1984","author":"A. Guttman","year":"1984","unstructured":"Guttman, A.: R-Trees: A Dynamic Index Structure for Spatial Searching. In: Yormark, B. (ed.) SIGMOD 1984, pp. 47\u201357. ACM Press, New York (1984)"},{"key":"27_CR9","first-page":"562","volume-title":"VLDB 1995","author":"J.M. Hellerstein","year":"1995","unstructured":"Hellerstein, J.M., et al.: Generalized Search Trees for Database Systems. In: VLDB 1995, pp. 562\u2013573. Morgan Kaufmann, San Francisco (1995)"},{"key":"27_CR10","first-page":"1099","volume-title":"SIGMOD 2008","author":"C. Olston","year":"2008","unstructured":"Olston, C., Reed, B., Srivastava, U., Kumar, R., Tomkins, A.: Pig Latin: a Not-So-Foreign Language for Data Processing. In: SIGMOD 2008, pp. 1099\u20131110. ACM, New York (2008)"},{"issue":"3","key":"27_CR11","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1145\/211990.212001","volume":"24","author":"P.E. O\u2019Neil","year":"1995","unstructured":"O\u2019Neil, P.E., Graefe, G.: Multi-Table Joins Through Bitmapped Join Indices. SIGMOD Record\u00a024(3), 8\u201311 (1995)","journal-title":"SIGMOD Record"},{"issue":"4","key":"27_CR12","first-page":"227","volume":"13","author":"R. Pike","year":"2005","unstructured":"Pike, R., Dorward, S., Griesemer, R., Quinlan, S.: Interpreting the Data: Parallel Analysis with Sawzall. Scientific Programming Journal\u00a013(4), 227\u2013298 (2005)","journal-title":"Scientific Programming Journal"},{"key":"27_CR13","first-page":"1029","volume-title":"SIGMOD Conference","author":"H.-C. Yang","year":"2007","unstructured":"Yang, H.-C., Dasdan, A., Hsiao, R.-L., Parker Jr., D.S.: Map-Reduce-Merge: Simplified Relational Data Processing on Large Clusters. In: Chan, C.Y., Ooi, B.C., Zhou, A. (eds.) SIGMOD Conference, pp. 1029\u20131040. ACM, New York (2007)"},{"key":"27_CR14","first-page":"23","volume-title":"SSDBM","author":"H.-C. Yang","year":"2006","unstructured":"Yang, H.-C., Parker Jr., D.S., Hsiao, R.-L.: The Holodex: Integrating Summarization with the Index. In: SSDBM, pp. 23\u201332. IEEE Computer Society, Los Alamitos (2006)"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00887-0_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,7]],"date-time":"2019-03-07T05:17:14Z","timestamp":1551935834000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00887-0_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642008863","9783642008870"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00887-0_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}