{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:09:46Z","timestamp":1759133386639},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2009,2,28]],"date-time":"2009-02-28T00:00:00Z","timestamp":1235779200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2009,8]]},"DOI":"10.1007\/s00778-009-0135-4","type":"journal-article","created":{"date-parts":[[2009,2,27]],"date-time":"2009-02-27T15:17:07Z","timestamp":1235747827000},"page":"933-958","source":"Crossref","is-referenced-by-count":15,"title":["Large-scale indexing of spatial data in distributed repositories: the SD-Rtree"],"prefix":"10.1007","volume":"18","author":[{"given":"C\u00e9dric","family":"du Mouza","sequence":"first","affiliation":[]},{"given":"Witold","family":"Litwin","sequence":"additional","affiliation":[]},{"given":"Philippe","family":"Rigaux","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,2,28]]},"reference":[{"key":"135_CR1","first-page":"263","volume":"146","author":"G.M. Adelson-Velskii","year":"1962","unstructured":"Adelson-Velskii G.M., Landis E.M.: An algorithm for the organization of information. Doklady Akademii Nauk SSSR 146, 263\u2013266 (1962)","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"135_CR2","doi-asserted-by":"crossref","unstructured":"Arge, L., Eppstein, D., Goodrich, M.T.: Skip-Webs: efficient distributed data structures for multi-dimensional data sets. In: Proc. Intl. Symp. on Principles of Distributed Computing (PODC), pp. 69\u201376 (2005)","DOI":"10.1145\/1073814.1073827"},{"key":"135_CR3","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: Proc. ACM Symp. on the Management of Data (SIGMOD), pp. 322\u2013331 (1990)","DOI":"10.1145\/93597.98741"},{"key":"135_CR4","doi-asserted-by":"crossref","unstructured":"Crainiceanu, A., Linga, P., Gehrke, J., Shanmugasundaram, J.: Querying peer-to-peer networks using P-trees. In: Proc. Intl. Workshop on the Web and Databases (WebDB), pp. 25\u201330 (2004)","DOI":"10.1145\/1017074.1017082"},{"key":"135_CR5","doi-asserted-by":"crossref","unstructured":"Devine, R.: Design and implementation of DDH: a distributed dynamic hashing algorithm. In: Proc. Intl. Conf. on Foundations of Data Organization and Algorithms (FODO), pp. 101\u2013114 (1993)","DOI":"10.1007\/3-540-57301-1_7"},{"key":"135_CR6","doi-asserted-by":"crossref","unstructured":"du Mouza, C., Litwin, W., Rigaux, P.: Dynamic storage balancing in a distributed spatial index. In: Proc. Intl. Symp. on Geographic Information Systems (ACM-GIS) (2007)","DOI":"10.1145\/1341012.1341019"},{"key":"135_CR7","doi-asserted-by":"crossref","unstructured":"du Mouza, C., Litwin, W., Rigaux, P.: SD-Rtre: a scalable distributed Rtree. In: Proc. Intl. Conf. on Data Engineering (ICDE), pp. 96\u2013305 (2007)","DOI":"10.1109\/ICDE.2007.367875"},{"issue":"2","key":"135_CR8","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1145\/280277.280279","volume":"30","author":"V. Gaede","year":"1998","unstructured":"Gaede V., G\u00fcnther O.: Multidimensional access methods. ACM Comput. Surv. 30(2), 170\u2013231 (1998)","journal-title":"ACM Comput. Surv."},{"key":"135_CR9","unstructured":"US Census Bureau Geography Division. Tiger\/Line files (2007). http:\/\/www.census.gov\/geo\/www\/tiger\/"},{"key":"135_CR10","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees : A dynamic index structure for spatial searching. In: Proc. ACM Symp. on the Management of Data (SIGMOD), pp. 45\u201357 (1984)","DOI":"10.1145\/602259.602266"},{"key":"135_CR11","doi-asserted-by":"crossref","unstructured":"Hambrusch, S.E., Khokhar, A.A.: Maintaining spatial data sets in distributed-memory machines. In: Proc. Intl. Parallel Processing Symp. (IPPS), pp. 702\u2013707 (1997)","DOI":"10.1109\/IPPS.1997.580982"},{"key":"135_CR12","unstructured":"Jagadish, H.V., Ooi, B.C, Vu, Q.H.: BATON: a balanced tree structure for peer-to-peer networks. In: Proc. Intl. Conf. on Very Large Data Bases (VLDB), pp. 661\u2013672 (2005)"},{"key":"135_CR13","doi-asserted-by":"crossref","unstructured":"Jagadish, H.V., Ooi, B.C., Vu, Q.H., Zhang, R., Zhou, A.: VBI-Tree: a peer-to-peer framework for supporting multi-dimensional indexing schemes. In: Proc. Intl. Conf. on Data Engineering (ICDE) (2006)","DOI":"10.1109\/ICDE.2006.169"},{"key":"135_CR14","unstructured":"Karlsson, J.S.: hQT*: a scalable distributed data structure for high-performance spatial accesses. In: Proc. Intl. Conf. on Foundations of Data Organization and Algorithms (FODO), pp. 37\u201346 (1998)"},{"key":"135_CR15","doi-asserted-by":"crossref","unstructured":"Kriakov, V, Delis, A., Kollios, G.: Management of highly dynamic multidimensional data in a cluster of workstations. In: Proc. Intl. Conf. on Extending Data Base Technology (EDBT), pp. 748\u2013764 (2004)","DOI":"10.1007\/978-3-540-24741-8_43"},{"key":"135_CR16","unstructured":"Litwin, W., Neimat, M.-A., Schneider, D.A.: RP*: a family of order preserving scalable distributed data structures. In: Proc. Intl. Conf. on Very Large Data Bases (VLDB), pp. 342\u2013353 (1994)"},{"issue":"4","key":"135_CR17","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1145\/236711.236713","volume":"21","author":"W. Litwin","year":"1996","unstructured":"Litwin W., Neimat M.-A., Schneider D.A.: LH*: a scalable, distributed data structure. ACM Trans. Database Syst. (TODS) 21(4), 480\u2013525 (1996)","journal-title":"ACM Trans. Database Syst. (TODS)"},{"key":"135_CR18","unstructured":"Liu, B., Lee, W.-C., Lee, D.L.: Supporting complex multi-dimensional queries in P2P systems. In: Proc. Intl. Conf. on Distributed Computing Systems (ICDCS), pp. 155\u2013164 (2005)"},{"key":"135_CR19","doi-asserted-by":"crossref","unstructured":"Mondal, A., Lifu, Y., Kitsuregawa, M.: P2PR-Tree: an R-tree-based spatial index for peer-to-peer environments. In: EDBT Workshops, pp. 516\u2013525 (2004)","DOI":"10.1007\/978-3-540-30192-9_51"},{"key":"135_CR20","doi-asserted-by":"crossref","unstructured":"Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. In: Proc. ACM Symp. on the Management of Data (SIGMOD), pp. 71\u201379 (1995)","DOI":"10.1145\/223784.223794"},{"key":"135_CR21","volume-title":"Foundations of Multi-dimensional Data Structures","author":"H. Samet","year":"2006","unstructured":"Samet H.: Foundations of Multi-dimensional Data Structures. Kaufmann, Morgan (2006)"},{"issue":"2","key":"135_CR22","doi-asserted-by":"crossref","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 J. 16(2), 165\u2013178 (2007)","journal-title":"VLDB J."},{"key":"135_CR23","doi-asserted-by":"crossref","unstructured":"Theodoridis, Y., Silva, J.R.O., Nascimento, M.A.: On the generation of spatiotemporal datasets. In: Proc. Intl. Conf. on Large Spatial Databases (SSD), pp. 147\u2013164 (1999)","DOI":"10.1007\/3-540-48482-5_11"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-009-0135-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-009-0135-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-009-0135-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T15:05:05Z","timestamp":1559142305000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-009-0135-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,2,28]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,8]]}},"alternative-id":["135"],"URL":"https:\/\/doi.org\/10.1007\/s00778-009-0135-4","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,2,28]]}}}