{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T05:16:15Z","timestamp":1740287775267,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540260431"},{"type":"electronic","value":"9783540321149"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11428848_74","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T17:44:33Z","timestamp":1279129473000},"page":"568-575","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Indexing of Moving Objects Using Time-Based Partitioning with R-Tree"],"prefix":"10.1007","author":[{"given":"Youn Chul","family":"Jung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hee Yong","family":"Youn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ungmo","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"74_CR1","doi-asserted-by":"crossref","unstructured":"Nascimento, M.A., Silva, J.R.O.: Towards historical R-Tree. In: Proceesings of the 13th ACM Symposium on Applied Computing (ACM-SAC 1998), pp. 235\u2013240 (1998)","DOI":"10.1145\/330560.330692"},{"key":"74_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/3-540-48344-6_10","volume-title":"Spatio-Temporal Database Management","author":"M.A. Nascimento","year":"1999","unstructured":"Nascimento, M.A., Silva, J.R.O., Theodoridis, Y.: Evaluation for access Structures for discretely moving points. In: B\u00f6hlen, M.H., Jensen, C.S., Scholl, M.O. (eds.) STDBM 1999. LNCS, vol.\u00a01678, pp. 171\u2013188. Springer, Heidelberg (1999)"},{"key":"74_CR3","unstructured":"Tao, Y., Papadias, D.: Mv3R-tree: a spatiotemporal access method for timestamp and intervalqueries. In: Proceedings of the 27th International Conference on Very Large Databases, pp. 431\u2013440 (2001)"},{"key":"74_CR4","doi-asserted-by":"crossref","unstructured":"Theodoridis, Y., Vazirgiannis, M., Sellis, T.: Spatio-temporal Indexing for Large Multimedia Applications. In: Proceedings of the 3rd IEEE Conference on Multimedia Computing and Systems, Hiroshima, Japan, pp. 441\u2013448 (1996)","DOI":"10.1109\/MMCS.1996.535011"},{"key":"74_CR5","unstructured":"Pfoser, D., Jensen, C.S., Theodoridis, Y.: Novel Approaches to the Indexing of Moving Object Trajectories. In: Proceedings of the 26th International Conference on Very Large Databases, Cairo, Egypt, pp. 395\u2013406 (2000)"},{"key":"74_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/978-3-540-45072-6_17","volume-title":"Advances in Spatial and Temporal Databases","author":"E. Frentzos","year":"2003","unstructured":"frentzos, E.: Indexing object moving on fixed networks. In: Hadzilacos, T., Manolopoulos, Y., Roddick, J., Theodoridis, Y. (eds.) SSTD 2003. LNCS, vol.\u00a02750, pp. 289\u2013305. Springer, Heidelberg (2003)"},{"key":"74_CR7","doi-asserted-by":"crossref","unstructured":"Brinkhoff, T.: Generation Network-Based Moving Objects. In: Proceedings of the 12th Int\u2019l Conference on Scientific and Statistical Database Management, SSDBM 2000, Berlin, Germany, pp. 253\u2013255 (2000)","DOI":"10.1109\/SSDM.2000.869794"},{"key":"74_CR8","doi-asserted-by":"crossref","unstructured":"Theodoridis, Y., Silva, J.R.O., Nascimento, M.A.: On the Generation of Spatiotemporal Datasets. In: SSD, pp. 147\u2013164 (1999)","DOI":"10.1007\/3-540-48482-5_11"},{"key":"74_CR9","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-Tree: A Dynamic Index Structure for Spatial Searching. ACM SIGMOD, 47\u201357 (1984)","DOI":"10.1145\/971697.602266"},{"key":"74_CR10","doi-asserted-by":"crossref","unstructured":"Beckmann, N., Kriegel, H., Schmeider, R., Seeger, B.: The R*-Tree: An Efficient and Robust Access Method for Point and Rectangles. ACM SIGMOD, 322\u2013331 (1990)","DOI":"10.1145\/93605.98741"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11428848_74","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T22:24:52Z","timestamp":1740263092000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11428848_74"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540260431","9783540321149"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11428848_74","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}