{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T00:52:00Z","timestamp":1649206320467},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,10,9]],"date-time":"2013-10-09T00:00:00Z","timestamp":1381276800000},"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":[[2014,8]]},"DOI":"10.1007\/s00778-013-0339-5","type":"journal-article","created":{"date-parts":[[2013,10,8]],"date-time":"2013-10-08T07:55:25Z","timestamp":1381218925000},"page":"591-607","source":"Crossref","is-referenced-by-count":0,"title":["Instance-level worst-case query bounds on R-trees"],"prefix":"10.1007","volume":"23","author":[{"given":"Yufei","family":"Tao","sequence":"first","affiliation":[]},{"given":"Yi","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Xiaocheng","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Cheng","family":"Sheng","sequence":"additional","affiliation":[]},{"given":"Shuigeng","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,10,9]]},"reference":[{"key":"339_CR1","doi-asserted-by":"crossref","unstructured":"Arge, L., de Berg, M., Haverkort, H.J., Yi, K.: The priority R-tree: a practically efficient and worst-case optimal R-tree. In: Proceedings of ACM Management of Data (SIGMOD), pp. 347\u2013358 (2004)","DOI":"10.1145\/1007568.1007608"},{"key":"339_CR2","doi-asserted-by":"crossref","unstructured":"Beckmann, N., Kriegel, H., Schneider, R., Seeger, B.: The R*-tree: an efficient and robust access method for points and rectangles. In: Proceedings of ACM Management of Data (SIGMOD), pp. 322\u2013331 (1990)","DOI":"10.1145\/93605.98741"},{"issue":"9","key":"339_CR3","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"JL Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM (CACM) 18(9), 509\u2013517 (1975)","journal-title":"Commun. ACM (CACM)"},{"key":"339_CR4","doi-asserted-by":"crossref","unstructured":"Faloutsos, C., Kamel, I.: Beyond uniformity and independence: analysis of R-trees using the concept of fractal dimension. In: Proceedings of ACM Symposium on Principles of Database Systems (PODS), pp. 4\u201313 (1994)","DOI":"10.1145\/182591.182593"},{"key":"339_CR5","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: Proceedings of ACM Management of Data (SIGMOD), pp. 47\u201357 (1984)","DOI":"10.1145\/971697.602266"},{"key":"339_CR6","doi-asserted-by":"crossref","unstructured":"Hellerstein, J.M., Koutsoupias, E., Miranker, D.P., Papadimitriou, C.H., Samoladas, V.: On a model of indexability and its bounds for range queries. JACM 49(1), 35\u201355 (2002)","DOI":"10.1145\/505241.505244"},{"issue":"2","key":"339_CR7","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1145\/320248.320255","volume":"24","author":"GR Hjaltason","year":"1999","unstructured":"Hjaltason, G.R., Samet, H.: Distance browsing in spatial databases. ACM Trans. Datab. Syst. 24(2), 265\u2013318 (1999)","journal-title":"ACM Trans. Datab. Syst."},{"key":"339_CR8","unstructured":"Kamel, I., Faloutsos, C.: Hilbert R-tree: an improved R-tree using fractals. In: Proceedings of Very Large Data Bases (VLDB), pp. 500\u2013509 (1994)"},{"key":"339_CR9","doi-asserted-by":"crossref","unstructured":"Kanth, K.V.R., Singh, A.K.: Optimal dynamic range searching in non-replicating index structures. In: Proceedings of International Conference on Database Theory (ICDT), pp. 257\u2013276 (1999)","DOI":"10.1007\/3-540-49257-7_17"},{"key":"339_CR10","doi-asserted-by":"crossref","unstructured":"Leutenegger, S.T., Edgington, J.M., Lopez, M.A.: STR: A simple and efficient algorithm for R-tree packing. In: Proceedings of International Conference on Data Engineering (ICDE), pp. 497\u2013506 (1997)","DOI":"10.1109\/ICDE.1997.582015"},{"key":"339_CR11","doi-asserted-by":"crossref","unstructured":"Pagel, B.-U., Six, H.-W., Toben, H., Widmayer, P.: Towards an analysis of range query performance in spatial data structures. In: Proceedings of ACM Symposium on Principles of Database Systems (PODS), pp. 214\u2013221 (1993)","DOI":"10.1145\/153850.153878"},{"issue":"1","key":"339_CR12","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1145\/1061318.1061320","volume":"30","author":"D Papadias","year":"2005","unstructured":"Papadias, D., Tao, Y., Fu, G., Seeger, B.: Progressive skyline computation in database systems. ACM Trans. Datab. Syst. 30(1), 41\u201382 (2005)","journal-title":"ACM Trans. Datab. Syst."},{"key":"339_CR13","doi-asserted-by":"crossref","unstructured":"Procopiuc, O., Agarwal, P.K., Arge, L., Vitter, J.S.: Bkd-tree: A dynamic scalable kd-tree. In: Proceedings of Symposium on Advances in Spatial and Temporal Databases (SSTD), pp. 46\u201365 (2003)","DOI":"10.1007\/978-3-540-45072-6_4"},{"key":"339_CR14","doi-asserted-by":"crossref","unstructured":"Robinson, J.T.: The K-D-B-tree: a search structure for large multidimensional dynamic indexes. In: Proceedings of ACM Management of Data (SIGMOD), pp. 10\u201318 (1981)","DOI":"10.1145\/582319.582321"},{"key":"339_CR15","doi-asserted-by":"crossref","unstructured":"Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. In: Proceedings of ACM Management of Data (SIGMOD), pp. 71\u201379 (1995)","DOI":"10.1145\/568271.223794"},{"key":"339_CR16","unstructured":"Sellis, T.K., Roussopoulos, N., Faloutsos, C.: The R+-tree: A dynamic index for multi-dimensional objects. In: Proceedings of Very Large Data Bases (VLDB), pp. 507\u2013518 (1987)"},{"issue":"2","key":"339_CR17","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"DD Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. CACM 28(2), 202\u2013208 (1985)","journal-title":"CACM"},{"issue":"6","key":"339_CR18","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1109\/TKDE.2004.13","volume":"16","author":"Y Tao","year":"2004","unstructured":"Tao, Y., Papadias, D.: Performance analysis of R*-trees with arbitrary node extents. IEEE Trans. Knowl. Data Eng. 16(6), 653\u2013668 (2004)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"339_CR19","doi-asserted-by":"crossref","unstructured":"Theodoridis, Y., Sellis, T.K.: A model for the prediction of R-tree performance. In: Proceedings of ACM Symposium on Principles of Database Systems (PODS), pp. 161\u2013171 (1996)","DOI":"10.1145\/237661.237705"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-013-0339-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-013-0339-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-013-0339-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,30]],"date-time":"2019-07-30T04:55:23Z","timestamp":1564462523000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-013-0339-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,9]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,8]]}},"alternative-id":["339"],"URL":"https:\/\/doi.org\/10.1007\/s00778-013-0339-5","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,9]]}}}