{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T11:46:50Z","timestamp":1769168810351,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642229213","type":"print"},{"value":"9783642229220","type":"electronic"}],"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-22922-0_12","type":"book-chapter","created":{"date-parts":[[2011,8,20]],"date-time":"2011-08-20T05:39:14Z","timestamp":1313818754000},"page":"186-204","source":"Crossref","is-referenced-by-count":20,"title":["Thread-Level Parallel Indexing of Update Intensive Moving-Object Workloads"],"prefix":"10.1007","author":[{"given":"Darius","family":"\u0160idlauskas","sequence":"first","affiliation":[]},{"given":"Kenneth A.","family":"Ross","sequence":"additional","affiliation":[]},{"given":"Christian S.","family":"Jensen","sequence":"additional","affiliation":[]},{"given":"Simonas","family":"\u0160altenis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"7","key":"12_CR1","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1016\/0010-4485(89)90125-5","volume":"21","author":"V. Akman","year":"1989","unstructured":"Akman, V., Franklin, W.R., Kankanhalli, M., Narayanaswami, C.: Geometric computing and the uniform grid data technique. Computer Aided Design\u00a021(7), 410\u2013420 (1989)","journal-title":"Computer Aided Design"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R*-tree: an efficient and robust access method for points and rectangles. In: SIGMOD, pp. 322\u2013331 (1990)","DOI":"10.1145\/93605.98741"},{"key":"12_CR3","unstructured":"Biveinis, L., \u0160altenis, S., Jensen, C.S.: Main-memory operation buffering for efficient R-tree update. In: VLDB, pp. 591\u2013602 (2007)"},{"issue":"2","key":"12_CR4","first-page":"1574","volume":"1","author":"S. Chen","year":"2008","unstructured":"Chen, S., Jensen, C.S., Lin, D.: A benchmark for evaluating moving object indexes. PVLDB\u00a01(2), 1574\u20131585 (2008)","journal-title":"PVLDB"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Cieslewicz, J., Ross, K.A., Satsumi, K., Ye, Y.: Automatic contention detection and amelioration for data-intensive operations. In: SIGMOD, pp. 483\u2013494 (2010)","DOI":"10.1145\/1807167.1807221"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-642-02982-0_14","volume-title":"Advances in Spatial and Temporal Databases","author":"J. Dittrich","year":"2009","unstructured":"Dittrich, J., Blunschi, L., Salles, M.A.V.: Indexing moving objects using short-lived throwaway indexes. In: Mamoulis, N., Seidl, T., Pedersen, T.B., Torp, K., Assent, I. (eds.) SSTD 2009. LNCS, vol.\u00a05644, pp. 189\u2013207. Springer, Heidelberg (2009)"},{"issue":"1","key":"12_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00288933","volume":"4","author":"R.A. Finkel","year":"1974","unstructured":"Finkel, R.A., Bentley, J.L.: Quad trees: a data structure for retrieval on composite keys. Acta Informatica\u00a04(1), 1\u20139 (1974)","journal-title":"Acta Informatica"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45072-6_2","volume-title":"Advances in Spatial and Temporal Databases","author":"S. Hwang","year":"2003","unstructured":"Hwang, S., Kwon, K., Cha, S., Lee, B.: Performance evaluation of main-memory R-tree variants. In: Hadzilacos, T., Manolopoulos, Y., Roddick, J., Theodoridis, Y. (eds.) SSTD 2003. LNCS, vol.\u00a02750, Springer, Heidelberg (2003)"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Jensen, C., Tiesyte, D., Tradisauskas, N.: The COST Benchmark-Comparison and evaluation of spatio-temporal indexes. Database Systems for Advanced Applications, 125\u2013140 (2006)","DOI":"10.1007\/11733836_11"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Kim, K., Cha, S.K., Kwon, K.: Optimizing multidimensional index trees for main memory access. In: SIGMOD, pp. 139\u2013150 (2001)","DOI":"10.1145\/375663.375679"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Lee, M.L., Hsu, W., Jensen, C.S., Cui, B., Teo, K.L.: Supporting frequent updates in R-trees: a bottom-up approach. In: VLDB, pp. 608\u2013619 (2003)","DOI":"10.1016\/B978-012722442-8\/50060-4"},{"issue":"1","key":"12_CR12","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1145\/348.318586","volume":"9","author":"J. Nievergelt","year":"1984","unstructured":"Nievergelt, J., Hinterberger, H., Sevcik, K.C.: The grid file: An adaptable, symmetric multikey file structure. ACM TODS\u00a09(1), 38\u201371 (1984)","journal-title":"ACM TODS"},{"key":"12_CR13","unstructured":"Rastogi, R., Seshadri, S., Bohannon, P., Leinbaugh, D.W., Silberschatz, A., Sudarshan, S.: Logical and physical versioning in main memory databases. In: VLDB, pp. 86\u201395 (1997)"},{"issue":"3","key":"12_CR14","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1145\/320473.320484","volume":"1","author":"D.G. Severance","year":"1976","unstructured":"Severance, D.G., Lohman, G.M.: Differential files: their application to the maintenance of large databases. ACM TODS\u00a01(3), 256\u2013267 (1976)","journal-title":"ACM TODS"},{"key":"12_CR15","first-page":"255","volume-title":"Effects of copy-on-write memory management on the response time of UNIX fork operations","author":"J.M. Smith","year":"1988","unstructured":"Smith, J.M., Maguire, G.Q.: Effects of copy-on-write memory management on the response time of UNIX fork operations, vol.\u00a01, pp. 255\u2013278. University of California Press, Berkeley (1988)"},{"issue":"11","key":"12_CR16","first-page":"1573","volume":"21","author":"M. Song","year":"2009","unstructured":"Song, M., Kitagawa, H.: Managing frequent updates in R-trees for update-intensive applications. IEEE TKDE\u00a021(11), 1573\u20131589 (2009)","journal-title":"IEEE TKDE"},{"issue":"2","key":"12_CR17","first-page":"71","volume":"23","author":"H. Tropf","year":"1981","unstructured":"Tropf, H., Herzog, H.: Multidimensional range search in dynamically balanced trees. Angewandte Informatik\u00a023(2), 71\u201377 (1981)","journal-title":"Angewandte Informatik"},{"issue":"2","key":"12_CR18","first-page":"1186","volume":"1","author":"K. Tzoumas","year":"2009","unstructured":"Tzoumas, K., Yiu, M.L., Jensen, C.S.: Workload-aware indexing of continuously moving objects. PVLDB\u00a01(2), 1186\u20131197 (2009)","journal-title":"PVLDB"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"\u0160idlauskas, D., \u0160altenis, S., Christiansen, C.W., Johansen, J.M., \u0160aulys, D.: Trees or grids? Indexing moving objects in main memory. In: GIS, pp. 236\u2013245 (2009)","DOI":"10.1145\/1653771.1653805"}],"container-title":["Lecture Notes in Computer Science","Advances in Spatial and Temporal Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22922-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T02:06:10Z","timestamp":1560477970000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22922-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642229213","9783642229220"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22922-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}