{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:31:32Z","timestamp":1750307492092,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,6,6]],"date-time":"2010-06-06T00:00:00Z","timestamp":1275782400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,6,6]]},"DOI":"10.1145\/1807167.1807174","type":"proceedings-article","created":{"date-parts":[[2010,6,8]],"date-time":"2010-06-08T12:37:34Z","timestamp":1276000654000},"page":"39-50","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":29,"title":["Boosting spatial pruning"],"prefix":"10.1145","author":[{"given":"Tobias","family":"Emrich","sequence":"first","affiliation":[{"name":"Ludwig-Maximillians-Universit\u00e4t M\u00fcnchen, M\u00fcnchen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans-Peter","family":"Kriegel","sequence":"additional","affiliation":[{"name":"Ludwig-Maximillians-Universit\u00e4t M\u00fcnchen, M\u00fcnchen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peer","family":"Kr\u00f6ger","sequence":"additional","affiliation":[{"name":"Ludwig-Maximillians-Universit\u00e4t M\u00fcnchen, M\u00fcnchen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Renz","sequence":"additional","affiliation":[{"name":"Ludwig-Maximillians-Universit\u00e4t M\u00fcnchen, M\u00fcnchen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Z\u00fcfle","sequence":"additional","affiliation":[{"name":"Ludwig-Maximillians-Universit\u00e4t M\u00fcnchen, M\u00fcnchen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,6,6]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1007\/978-3-642-02982-0_35"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1145\/1516360.1516462"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1145\/93597.98741"},{"key":"e_1_3_2_1_4_1","volume-title":"Proc. VLDB","author":"Berchtold S.","year":"1996","unstructured":"S. Berchtold , D. A. Keim , and H.-P. Kriegel . The X- Tree : An index structure for high-dimensional data . In Proc. VLDB , 1996 . S. Berchtold, D. A. Keim, and H.-P. Kriegel. The X-Tree: An index structure for high-dimensional data. In Proc. VLDB, 1996."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.14778\/1453856.1453895"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1145\/872757.872828"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1109\/ICDE.2007.367904"},{"key":"e_1_3_2_1_8_1","volume-title":"Probabilistic verifiers: Evaluating constrained nearest-neighbor queries over uncertain data","author":"Cheng R.","year":"2008","unstructured":"R. Cheng , J. Chen , M. Mokbel , and C. Chow . Probabilistic verifiers: Evaluating constrained nearest-neighbor queries over uncertain data . 2008 . R. Cheng, J. Chen, M. Mokbel, and C. Chow. Probabilistic verifiers: Evaluating constrained nearest-neighbor queries over uncertain data. 2008."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1109\/TKDE.2004.46"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1145\/872757.872823"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1145\/1653771.1653801"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1007\/978-3-642-02982-0_18"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1145\/1807167.1807174"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1145\/280277.280279"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1145\/602259.602266"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1007\/s00778-004-0151-3"},{"key":"e_1_3_2_1_17_1","volume-title":"The uci kdd archive","author":"Hettich S.","year":"1999","unstructured":"S. Hettich and S. D. Bay . The uci kdd archive ., 1999 . S. Hettich and S. D. Bay. The uci kdd archive., 1999."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.5555\/647224.718930"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.5555\/1287369.1287405"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1007\/978-3-642-00887-0_4"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1145\/223784.223794"},{"key":"e_1_3_2_1_22_1","volume-title":"VLDB '05","author":"Tao Y.","year":"2005","unstructured":"Y. Tao , R. Cheng , X. Xiao , W. K. Ngai , B. Kao , and S. Prabhakar . Indexing multi-dimensional uncertain data with arbitrary probability density functions . In VLDB '05 . VLDB Endowment , 2005 . Y. Tao, R. Cheng, X. Xiao, W. K. Ngai, B. Kao, and S. Prabhakar. Indexing multi-dimensional uncertain data with arbitrary probability density functions. In VLDB '05. VLDB Endowment, 2005."},{"key":"e_1_3_2_1_23_1","volume-title":"Proc. VLDB","author":"Tao Y.","year":"2004","unstructured":"Y. Tao , D. Papadias , and X. Lian . Reverse kNN search in arbitrary dimensionality . In Proc. VLDB , 2004 . Y. Tao, D. Papadias, and X. Lian. Reverse kNN search in arbitrary dimensionality. In Proc. VLDB, 2004."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1016\/B978-155860869-6\/50033-0"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.1145\/335191.335427"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.1086\/301098"}],"event":{"sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"acronym":"SIGMOD\/PODS '10","name":"SIGMOD\/PODS '10: International Conference on Management of Data","location":"Indianapolis Indiana USA"},"container-title":["Proceedings of the 2010 ACM SIGMOD International Conference on Management of data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1807167.1807174","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1807167.1807174","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:17:34Z","timestamp":1750249054000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1807167.1807174"}},"subtitle":["on optimal pruning of MBRs"],"short-title":[],"issued":{"date-parts":[[2010,6,6]]},"references-count":26,"alternative-id":["10.1145\/1807167.1807174","10.1145\/1807167"],"URL":"https:\/\/doi.org\/10.1145\/1807167.1807174","relation":{},"subject":[],"published":{"date-parts":[[2010,6,6]]},"assertion":[{"value":"2010-06-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}