{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:15:57Z","timestamp":1763468157329},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642385612"},{"type":"electronic","value":"9783642385629"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38562-9_24","type":"book-chapter","created":{"date-parts":[[2013,6,20]],"date-time":"2013-06-20T11:14:18Z","timestamp":1371726858000},"page":"235-240","source":"Crossref","is-referenced-by-count":10,"title":["RUM+-tree: A New Multidimensional Index Supporting Frequent Updates"],"prefix":"10.1007","author":[{"given":"Yuean","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuan","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yansong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","unstructured":"Xiong, X., Aref, W.G.: R-Trees with Update Memos. In: ICDE (2006)"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Lee, M.-L., et al.: Supporting Frequent Updates in R-Trees: A Bottom-Up Approach. In: VLDB, pp. 608\u2013619 (2003)","DOI":"10.1016\/B978-012722442-8\/50060-4"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-Trees: A Dynamic Index Structure for Spatial Searching. In: ACM SIGMOD, pp. 47\u201357 (1984)","DOI":"10.1145\/971697.602266"},{"key":"24_CR4","unstructured":"Pfoser, D., et al.: Novel Approaches in Query Processing for Moving Object Trajectories. In: VLDB, pp. 395\u2013406 (2000)"},{"key":"24_CR5","unstructured":"Kwon, D., Lee, S., Lee, S.: Indexing the Current Positions of Moving Objects Using the Lazy Update R-Tree. In: MDM, pp. 113\u2013120 (2002)"},{"key":"24_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/3-540-48482-5_11","volume-title":"Advances in Spatial Databases","author":"Y. Theodoridis","year":"1999","unstructured":"Theodoridis, Y., Silva, J.R.O., Nascimento, M.A.: On the generation of spatiotemporal datasets. In: G\u00fcting, R.H., Papadias, D., Lochovsky, F.H. (eds.) SSD 1999. LNCS, vol.\u00a01651, pp. 147\u2013164. Springer, Heidelberg (1999)"},{"key":"24_CR7","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., Vaz Salles, M.A.: 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)"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Nguyen, T., He, Z., Zhang, R., Ward, P.: Boosting moving object indexing through velocity partitioning. In: VLDB, pp. 860\u2013871 (2012)","DOI":"10.14778\/2311906.2311913"},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/978-3-642-22922-0_12","volume-title":"Advances in Spatial and Temporal Databases","author":"D. \u0160idlauskas","year":"2011","unstructured":"\u0160idlauskas, D., Ross, K.A., Jensen, C.S., \u0160altenis, S.: Thread-Level Parallel Indexing of Update Intensive Moving-Object Workloads. In: Pfoser, D., Tao, Y., Mouratidis, K., Nascimento, M.A., Mokbel, M., Shekhar, S., Huang, Y. (eds.) SSTD 2011. LNCS, vol.\u00a06849, pp. 186\u2013204. Springer, Heidelberg (2011)"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"\u0160idlauskas, D., \u0160altenis, S., Jensen, C.S.: Parallel main-memory indexing for moving-object query and update workloads. In: ACM SIGMOD, pp. 37\u201348 (2012)","DOI":"10.1145\/2213836.2213842"},{"key":"24_CR11","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: ACM SIGMOD, pp. 322\u2013331 (1990)","DOI":"10.1145\/93605.98741"}],"container-title":["Lecture Notes in Computer Science","Web-Age Information Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38562-9_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T05:23:28Z","timestamp":1557811408000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38562-9_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385612","9783642385629"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38562-9_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}