{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:55:23Z","timestamp":1758272123146,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,3,23]],"date-time":"2010-03-23T00:00:00Z","timestamp":1269302400000},"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,3,23]]},"DOI":"10.1145\/1804669.1804676","type":"proceedings-article","created":{"date-parts":[[2010,5,18]],"date-time":"2010-05-18T13:46:25Z","timestamp":1274190385000},"page":"34-43","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient processing of 3-sided range queries with probabilistic guarantees"],"prefix":"10.1145","author":[{"given":"A.","family":"Kaporis","sequence":"first","affiliation":[{"name":"University of Patras, Patras, Greece"}]},{"given":"A. N.","family":"Papadopoulos","sequence":"additional","affiliation":[{"name":"Aristotle University, Thessaloniki, Greece"}]},{"given":"S.","family":"Sioutas","sequence":"additional","affiliation":[{"name":"Ionian University, Corfu, Greece"}]},{"given":"K.","family":"Tsakalidis","sequence":"additional","affiliation":[{"name":"University of Aarhus, Aarhus, Denmark"}]},{"given":"K.","family":"Tsichlas","sequence":"additional","affiliation":[{"name":"Aristotle University, Thessaloniki, Greece"}]}],"member":"320","published-online":{"date-parts":[[2010,3,23]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-56939-1_58"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/303976.304010"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s007780050028"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/543613.543615"},{"key":"e_1_3_2_1_5_1","volume-title":"Nr.92","author":"Blankenagel G.","year":"1990","unstructured":"G. Blankenagel and R. H. Gueting , \" XP-trees-External priority search trees\", Technical report, FernUniversitB Hagen, Informatik-Bericht , Nr.92 , 1990 . G. Blankenagel and R. H. Gueting, \"XP-trees-External priority search trees\", Technical report, FernUniversitB Hagen, Informatik-Bericht, Nr.92, 1990."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10631-6_21"},{"key":"e_1_3_2_1_7_1","volume-title":"Proceedings of VLDB","author":"Cheng R.","year":"2004","unstructured":"R. Cheng , Y. Xia , S. Prabhakar , R. Shah , J. S. Vitter , \"Efficient Indexing Methods for Probabilistic Threshold Queries over Uncertain Data\" , Proceedings of VLDB , 2004 . R. Cheng, Y. Xia, S. Prabhakar, R. Shah, J. S. Vitter, \"Efficient Indexing Methods for Probabilistic Threshold Queries over Uncertain Data\", Proceedings of VLDB, 2004."},{"key":"e_1_3_2_1_8_1","volume-title":"algorithms and applications","author":"deBerg M.","year":"1998","unstructured":"M. deBerg , M. van Kreveld , M. Overmars , O. Schwarzkopf , \"Computational Geometry , algorithms and applications \", Springer , 1998 . M. deBerg, M. van Kreveld, M. Overmars, O. Schwarzkopf, \"Computational Geometry, algorithms and applications\", Springer, 1998."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(87)90174-8"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90014-5"},{"key":"e_1_3_2_1_11_1","volume-title":"Computer Science and Computational Biology","author":"Gusfield D.","year":"1994","unstructured":"D. Gusfield , \"Algorithms on Strings, Trees and Sequences , Computer Science and Computational Biology \", Cambridge University Press , 1994 . D. Gusfield, \"Algorithms on Strings, Trees and Sequences, Computer Science and Computational Biology\", Cambridge University Press, 1994."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/280277.280279"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/0213024"},{"key":"e_1_3_2_1_14_1","first-page":"84","article-title":"Priority search trees in secondary memory","volume":"314","author":"Icking C.","year":"1987","unstructured":"C. Icking , R. Klein , and T. Ottmann , \" Priority search trees in secondary memory \", Proceedings of Graph-Theoretic Concepts in Computer Science, LNCS 314 , pp. 84 -- 93 , 1987 . C. Icking, R. Klein, and T. Ottmann, \"Priority search trees in secondary memory\", Proceedings of Graph-Theoretic Concepts in Computer Science, LNCS 314, pp. 84--93, 1987.","journal-title":"Proceedings of Graph-Theoretic Concepts in Computer Science, LNCS"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1996.0043"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/11602613_33"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39658-1_31"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/11786986_34"},{"key":"e_1_3_2_1_19_1","first-page":"107","volume-title":"Proceedings of ADBIS-DASFAA","author":"Kitsios N.","year":"2000","unstructured":"N. Kitsios , C. Makris , S. Sioutas , A. Tsakalidis , J. Tsaknakis , B. Vassiliadis , \"2- D Spatial Indexing Scheme in Optimal Time\" , Proceedings of ADBIS-DASFAA , pp. 107 -- 116 , 2000 . N. Kitsios, C. Makris, S. Sioutas, A. Tsakalidis, J. Tsaknakis, B. Vassiliadis, \"2-D Spatial Indexing Scheme in Optimal Time\", Proceedings of ADBIS-DASFAA, pp. 107--116, 2000."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1977.231160"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00299635"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/174130.174139"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/0214021"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142544"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(88)90041-7"},{"key":"e_1_3_2_1_26_1","first-page":"25","volume-title":"Proceedings of PODS","author":"Ramaswamy S.","year":"1994","unstructured":"S. Ramaswamy and S. Subramanian , \" Path caching: A technique for optimal external searching \", Proceedings of PODS , pp. 25 -- 35 , 1994 . S. Ramaswamy and S. Subramanian, \"Path caching: A technique for optimal external searching\", Proceedings of PODS, pp. 25--35, 1994."},{"issue":"9","key":"e_1_3_2_1_27_1","first-page":"1325","article-title":"Geometric Retrieval for Grid Points in the RAM Model","volume":"10","author":"Sioutas S.","year":"2004","unstructured":"S. Sioutas , C. Makris , N. Kitsios , G. Lagogiannis , J. Tsaknakis , K. Tsichlas , B. Vassiliadis , \" Geometric Retrieval for Grid Points in the RAM Model \", J. UCS 10 ( 9 ), pp. 1325 -- 1353 , 2004 . S. Sioutas, C. Makris, N. Kitsios, G. Lagogiannis, J. Tsaknakis, K. Tsichlas, B. Vassiliadis, \"Geometric Retrieval for Grid Points in the RAM Model\", J. UCS 10(9), pp. 1325--1353, 2004.","journal-title":"J. UCS"},{"key":"e_1_3_2_1_28_1","first-page":"378","volume-title":"Proceedings of SODA","author":"Subramanian S.","year":"1995","unstructured":"S. Subramanian and S. Ramaswamy , \" The P-range tree: A new data structure for range searching in secondary memory \", Proceedings of SODA , pp. 378 -- 387 , 1995 . S. Subramanian and S. Ramaswamy, \"The P-range tree: A new data structure for range searching in secondary memory\", Proceedings of SODA, pp. 378--387, 1995."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/384192.384193"},{"key":"e_1_3_2_1_30_1","first-page":"286","volume-title":"Proceedings of SODA","author":"Willard D. E.","year":"1992","unstructured":"D. E. Willard , \"Applications of the fusion tree method to computational geometry and searching \", Proceedings of SODA , pp. 286 -- 295 , 1992 . D. E. Willard, \"Applications of the fusion tree method to computational geometry and searching\", Proceedings of SODA, pp. 286--295, 1992."}],"event":{"name":"EDBT\/ICDT '10: EDBT\/ICDT '10 joint conference","acronym":"EDBT\/ICDT '10","location":"Lausanne Switzerland"},"container-title":["Proceedings of the 13th International Conference on Database Theory"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1804669.1804676","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1804669.1804676","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:43:36Z","timestamp":1750286616000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1804669.1804676"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3,23]]},"references-count":30,"alternative-id":["10.1145\/1804669.1804676","10.1145\/1804669"],"URL":"https:\/\/doi.org\/10.1145\/1804669.1804676","relation":{},"subject":[],"published":{"date-parts":[[2010,3,23]]},"assertion":[{"value":"2010-03-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}