{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T05:48:37Z","timestamp":1738216117631,"version":"3.34.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540785675"},{"type":"electronic","value":"9783540785682"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78568-2_20","type":"book-chapter","created":{"date-parts":[[2008,4,1]],"date-time":"2008-04-01T17:55:41Z","timestamp":1207072541000},"page":"251-266","source":"Crossref","is-referenced-by-count":1,"title":["Load Balancing for Moving Object Management in a P2P Network"],"prefix":"10.1007","author":[{"given":"Mohammed Eunus","family":"Ali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Egemen","family":"Tanin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rui","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lars","family":"Kulik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"20_CR1","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s00778-005-0001-y","volume":"16","author":"E. Tanin","year":"2007","unstructured":"Tanin, E., Harwood, A., Samet, H.: Using a distributed quadtree index in peer-to-peer networks. VLDB Journal\u00a016(2), 165\u2013178 (2007)","journal-title":"VLDB Journal"},{"unstructured":"Wolfson, O., Xu, B., Chamberlain, S., Jiang, L.: Moving objects databases: Issues and solutions. In: SSDBM, Capri, Italy, pp. 111\u2013122 (1998)","key":"20_CR2"},{"unstructured":"Cheng, R., Xia, Y., Prabhakar, S., Shah, R.: Change tolerant indexing for constantly evolving data. In: ICDE, Tokyo, Japan, pp. 391\u2013402 (2005)","key":"20_CR3"},{"key":"20_CR4","volume-title":"Moving Objects Databases","author":"R.H. Guting","year":"2005","unstructured":"Guting, R.H., Schneider, M.: Moving Objects Databases. Morgan Kaufmann, San Francisco (2005)"},{"key":"20_CR5","series-title":"Lecture Notes in Computer Science","first-page":"608","volume-title":"Databases, Information Systems, and Peer-to-Peer Computing","author":"M. Lee","year":"2004","unstructured":"Lee, M., Hsu, W., Jensen, C., Cui, B., Teo, K.: Supporting frequent updates in R-trees: A bottom-up approach. In: Aberer, K., Koubarakis, M., Kalogeraki, V. (eds.) VLDB 2003. LNCS, vol.\u00a02944, pp. 608\u2013619. Springer, Heidelberg (2004)"},{"key":"20_CR6","series-title":"Lecture Notes in Computer Science","first-page":"790","volume-title":"Databases, Information Systems, and Peer-to-Peer Computing","author":"Y. Tao","year":"2004","unstructured":"Tao, Y., Papadias, D., Sun, J.: The TPR*-tree: An optimized spatio-temporal access method for predictive queries. In: Aberer, K., Koubarakis, M., Kalogeraki, V. (eds.) VLDB 2003. LNCS, vol.\u00a02944, pp. 790\u2013801. Springer, Heidelberg (2004)"},{"key":"20_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/3-540-44498-X_13","volume-title":"Mobile Data Management","author":"Z. Song","year":"2000","unstructured":"Song, Z., Roussopoulos, N.: Hashing moving objects. In: Tan, K.-L., Franklin, M.J., Lui, J.C.-S. (eds.) MDM 2001. LNCS, vol.\u00a01987, pp. 161\u2013172. Springer, Heidelberg (2000)"},{"key":"20_CR8","series-title":"Lecture Notes in Computer Science","first-page":"776","volume-title":"Intelligent Information Technology","author":"J. Guan","year":"2004","unstructured":"Guan, J., Wang, L., Zhou, S.: Enabling GIS services in a P2P environment. In: Das, G., Gulati, V.P. (eds.) CIT 2004. LNCS, vol.\u00a03356, pp. 776\u2013781. Springer, Heidelberg (2004)"},{"unstructured":"Shu, Y., Ooi, B.C., Tan, K.-L., Zhou, A.: Supporting multi-dimensional range queries in peer-to-peer systems. In: P2P, Konstanz, Germany, pp. 173\u2013180 (2005)","key":"20_CR9"},{"doi-asserted-by":"crossref","unstructured":"Wang, S., Ooi, B.C., Tung, A.K.H., Xu, L.: Efficient skyline query processing on peer-to-peer networks. In: ICDE, Istanbul, Turkey, pp. 1126\u20131135 (2007)","key":"20_CR10","DOI":"10.1109\/ICDE.2007.368971"},{"key":"20_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/3-540-36389-0_21","volume-title":"Mobile Data Management","author":"M. Denny","year":"2003","unstructured":"Denny, M., Franklin, M., Castro, P., Purakayasatha, A.: Mobiscope: A scalable spatial discovery service for mobile network resources. In: Chen, M.-S., Chrysanthis, P.K., Sloman, M., Zaslavsky, A. (eds.) MDM 2003. LNCS, vol.\u00a02574, pp. 307\u2013324. Springer, Heidelberg (2003)"},{"issue":"10","key":"20_CR12","doi-asserted-by":"publisher","first-page":"1384","DOI":"10.1109\/TMC.2006.153","volume":"5","author":"M.-B. Gedik","year":"2006","unstructured":"Gedik, M.-B., Liu, S.M.-L.: Mobieyes: A distributed location monitoring service using moving location queries. IEEE Transactions on Mobile Computing\u00a05(10), 1384\u20131402 (2006)","journal-title":"IEEE Transactions on Mobile Computing"},{"doi-asserted-by":"crossref","unstructured":"Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: SIGCOMM, San Diego, CA, pp. 161\u2013172 (2001)","key":"20_CR13","DOI":"10.1145\/383059.383072"},{"doi-asserted-by":"crossref","unstructured":"Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for Internet applications. In: SIGCOMM, San Diego, CA, pp. 161\u2013172 (2001)","key":"20_CR14","DOI":"10.1145\/383059.383071"},{"doi-asserted-by":"crossref","unstructured":"Godfrey, B., Lakshminarayanan, K., Surana, S., Karp, R., Stoica, I.: Load balancing in dynamic structured P2P systems. In: INFOCOM, Hong Kong, pp. 2253\u20132262 (2004)","key":"20_CR15","DOI":"10.1109\/INFCOM.2004.1354648"},{"doi-asserted-by":"crossref","unstructured":"Aspnes, J., Kirsch, J., Krishnamurthy, A.: Load balancing and locality in range queriable data structures. In: PODC, Newfoundland, Canada, pp. 25\u201328 (2004)","key":"20_CR16","DOI":"10.1145\/1011767.1011785"},{"key":"20_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/978-3-540-30183-7_13","volume-title":"Peer-to-Peer Systems III","author":"D. Karger","year":"2005","unstructured":"Karger, D., Ruhl, M.: Simple efficient load-balancing algorithms for peer-to-peer systems. In: Voelker, G.M., Shenker, S. (eds.) IPTPS 2004. LNCS, vol.\u00a03279, pp. 131\u2013140. Springer, Heidelberg (2005)"},{"doi-asserted-by":"crossref","unstructured":"Ganesan, P., Bawa, M., Garcia-Molina, H.: Online balancing of range-partitioned data with applications to peer-to-peer systems. In: VLDB, Toronto, Canada, pp. 444\u2013455 (2004)","key":"20_CR18","DOI":"10.1016\/B978-012088469-8.50041-3"},{"key":"20_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"748","DOI":"10.1007\/978-3-540-24741-8_43","volume-title":"Advances in Database Technology - EDBT 2004","author":"V. Kriakov","year":"2004","unstructured":"Kriakov, V., Delis, A., Kollios, G.: Management of highly dynamic multidimensional data in a cluster of workstations. In: Bertino, E., Christodoulakis, S., Plexousakis, D., Christophides, V., Koubarakis, M., B\u00f6hm, K., Ferrari, E. (eds.) EDBT 2004. LNCS, vol.\u00a02992, pp. 748\u2013764. Springer, Heidelberg (2004)"},{"doi-asserted-by":"crossref","unstructured":"Lee, M.L., Kitsuregawa, M., Ooi, B.C., Tan, K., Mondal, A.: Towards selftuning data placement in parallel database systems. In: SIGMOD, Dallas, TX, pp. 225\u2013236 (2000)","key":"20_CR20","DOI":"10.1145\/335191.335416"},{"unstructured":"Penttinen, A.: Kendall\u2019s notation for queuing models. In: Introduction to Teletraffic Theory. Lecture Notes: S-38, p. 145. Helsinki University of Technology (1999)","key":"20_CR21"},{"key":"20_CR22","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1287\/opre.9.3.383","volume":"9","author":"J.D.C. Little","year":"1961","unstructured":"Little, J.D.C.: A Proof of the Queueing Formula l = \u03bb w. Operations Research\u00a09, 383\u2013387 (1961)","journal-title":"Operations Research"},{"issue":"2","key":"20_CR23","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1023\/A:1015231126594","volume":"6","author":"T. Brinkhoff","year":"2002","unstructured":"Brinkhoff, T.: A framework for generating network-based moving objects. GeoInformatica\u00a06(2), 153\u2013180 (2002)","journal-title":"GeoInformatica"},{"unstructured":"J-SIM: http:\/\/www.j-sim.org\/","key":"20_CR24"},{"unstructured":"BRITE: http:\/\/www.cs.bu.edu\/brite\/","key":"20_CR25"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78568-2_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:13:16Z","timestamp":1619521996000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78568-2_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540785675","9783540785682"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78568-2_20","relation":{},"subject":[]}}