{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:06:39Z","timestamp":1725566799074},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642163173"},{"type":"electronic","value":"9783642163180"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-16318-0_51","type":"book-chapter","created":{"date-parts":[[2010,9,27]],"date-time":"2010-09-27T09:06:23Z","timestamp":1285578383000},"page":"421-426","source":"Crossref","is-referenced-by-count":1,"title":["Indexing Moving Objects: A Real Time Approach"],"prefix":"10.1007","author":[{"given":"George","family":"Lagogiannis","sequence":"first","affiliation":[]},{"given":"Nikos","family":"Lorentzos","sequence":"additional","affiliation":[]},{"given":"Alexander B.","family":"Sideridis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"9","key":"51_CR1","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A. Aggarwal","year":"1988","unstructured":"Aggarwal, A., Vitter, S.J.: The input\/output complexity of sorting and related problems. Communications of the ACM\u00a031(9), 1116\u20131127 (1988)","journal-title":"Communications of the ACM"},{"issue":"4","key":"51_CR2","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/s007780050028","volume":"5","author":"B. Becker","year":"1996","unstructured":"Becker, B., Gschwind, S., Ohler, T., Seeger, B., Widmayer, P.: An asymptotically optimal multiversion B-tree. The VLDB Journal\u00a05(4), 264\u2013275 (1996)","journal-title":"The VLDB Journal"},{"key":"51_CR3","first-page":"391","volume-title":"ICDE","author":"R. Cheng","year":"2005","unstructured":"Cheng, R., Xia, Y., Prabhakar, S., Shah, R.: Change Tolerant Indexing for Constantly Evolving Data. In: ICDE, pp. 391\u2013402. IEEE Computer Society Press, Tokyo (2005)"},{"key":"51_CR4","first-page":"113","volume-title":"MDM","author":"D. Kwon","year":"2002","unstructured":"Kwon, D., Lee, J.S., Lee, S.: Indexing the current positions of moving objects using the lazy update Rtree. In: MDM, pp. 113\u2013120. IEEE Computer Society, Singapore (2002)"},{"key":"51_CR5","doi-asserted-by":"crossref","unstructured":"Lagogiannis, G., Lorentzos, N.: Partially Persistent B-trees with Constant Worst Case Update Time. Technical report 184, Informatics Laboratory, Department of Science, Agricultural University of Athens (May 2010)","DOI":"10.1007\/978-90-481-9794-1_1"},{"key":"51_CR6","doi-asserted-by":"crossref","unstructured":"Lagogiannis, G., Lorentzos, N., Sideridis, A.B.: Indexing moving objects: A real time approach. Technical report 186, Informatics Laboratory, Department of Science, Agricultural University of Athens (July 2010)","DOI":"10.1007\/978-3-642-16318-0_51"},{"key":"51_CR7","doi-asserted-by":"crossref","unstructured":"Lee, L.M., Hsu, W., Jensen, S.C., Cui, B., Teo, L.K.: Supporting Frequent Updates in R-Trees: A Bottom-Up Approach. In: VLDB, Berlin, pp. 608\u2013619 (2003)","DOI":"10.1016\/B978-012722442-8\/50060-4"},{"key":"51_CR8","first-page":"591","volume-title":"VLDB","author":"S. Saltenis","year":"2007","unstructured":"Saltenis, S., Jensen, S.C.: Main memory operation buffering for efficient R-tree update. In: VLDB, pp. 591\u2013602. ACM, Vienna (2007)"},{"key":"51_CR9","first-page":"6","volume-title":"CIT","author":"H. Tung","year":"2006","unstructured":"Tung, H., Ryu, K.: One update for all moving objects at a timestamp. In: CIT, p. 6. IEEE Computer Society, Seoul (2006)"},{"issue":"3","key":"51_CR10","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1109\/69.599929","volume":"9","author":"P. Varman","year":"1997","unstructured":"Varman, P., Verma, R.: An Efficient Multiversion Access Structure. IEEE Transactions on Knowledge and Data Engineering\u00a09(3), 391\u2013409 (1997)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"51_CR11","first-page":"22","volume-title":"ICDE","author":"X. Xiong","year":"2006","unstructured":"Xiong, X., Aref, G.W.: R-trees with Update Memos. In: ICDE, pp. 22\u201322. IEEE Computer Society, Atlanta (2006)"}],"container-title":["Communications in Computer and Information Science","Knowledge Management, Information Systems, E-Learning, and Sustainability Research"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16318-0_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,10]],"date-time":"2021-11-10T18:22:22Z","timestamp":1636568542000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16318-0_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642163173","9783642163180"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16318-0_51","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2010]]}}}