{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T05:01:55Z","timestamp":1755838915829,"version":"3.37.3"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,2,12]],"date-time":"2020-02-12T00:00:00Z","timestamp":1581465600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,12]],"date-time":"2020-02-12T00:00:00Z","timestamp":1581465600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Geoinformatica"],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1007\/s10707-020-00393-z","type":"journal-article","created":{"date-parts":[[2020,2,12]],"date-time":"2020-02-12T04:48:01Z","timestamp":1581482881000},"page":"591-631","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Top-k spatial distance joins"],"prefix":"10.1007","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5411-9304","authenticated-orcid":false,"given":"Shuyao","family":"Qi","sequence":"first","affiliation":[]},{"given":"Panagiotis","family":"Bouros","sequence":"additional","affiliation":[]},{"given":"Nikos","family":"Mamoulis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,2,12]]},"reference":[{"key":"393_CR1","unstructured":"Arge L, Procopiuc O, Ramaswamy S, Suel T, Vitter JS (1998) Scalable sweeping-based spatial join. In: VLDB\u201998, Proceedings of 24rd International Conference on Very Large Data Bases, New York City, pp 570\u2013581"},{"key":"393_CR2","unstructured":"Belussi A, Faloutsos C (1995) Estimating the selectivity of spatial queries using the \u2018correlation\u2019 fractal dimension. In: VLDB\u201995, Proceedings of 21th International Conference on Very Large Data Bases, Zurich, pp 299\u2013310"},{"key":"393_CR3","doi-asserted-by":"crossref","unstructured":"Brinkhoff T, Kriegel HP, Seeger B (1993) Efficient processing of spatial joins using R-trees. In: Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, Washington, pp 237\u2013246","DOI":"10.1145\/170035.170075"},{"key":"393_CR4","doi-asserted-by":"crossref","unstructured":"Chakrabarti K, Chaudhuri S, Ganti V (2011) Interval-based pruning for top-k processing over compressed lists. In: Proceedings of the 27th International Conference on Data Engineering, ICDE 2011, Hannover, pp 709\u2013720","DOI":"10.1109\/ICDE.2011.5767855"},{"issue":"4","key":"393_CR5","first-page":"895","volume":"15","author":"EPF Chan","year":"2003","unstructured":"Chan EPF (2003) Buffer queries. IEEE TKDE 15(4):895\u2013910","journal-title":"IEEE TKDE"},{"key":"393_CR6","doi-asserted-by":"crossref","unstructured":"Corral A, Manolopoulos Y, Theodoridis Y, Vassilakopoulos M (2000) Closest pair queries in spatial databases. In: Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, Dallas, pp 189\u2013200","DOI":"10.1145\/342009.335414"},{"key":"393_CR7","doi-asserted-by":"crossref","unstructured":"Doulkeridis C, Vlachou A, Kotidis Y, Polyzotis N (2012) Processing of rank joins in highly distributed systems. In: IEEE 28Th international conference on data engineering (ICDE 2012), Washington, pp 606\u2013617","DOI":"10.1109\/ICDE.2012.108"},{"key":"393_CR8","doi-asserted-by":"crossref","unstructured":"Fagin R, Lotem A, Naor M (2001) Optimal aggregation algorithms for middleware. In: Proceedings of the Twentieth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Santa Barbara, pp 102\u2013113","DOI":"10.1145\/375551.375567"},{"key":"393_CR9","doi-asserted-by":"crossref","unstructured":"Faloutsos C, Seeger B, Traina A, Traina C Jr (2000) Spatial join selectivity using power laws. In: Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, Dallas, pp 177\u2013188","DOI":"10.1145\/342009.335412"},{"key":"393_CR10","doi-asserted-by":"crossref","unstructured":"Finger J, Polyzotis N (2009) Robust and efficient algorithms for rank join evaluation. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2009, Providence, pp 415\u2013428","DOI":"10.1145\/1559845.1559890"},{"key":"393_CR11","doi-asserted-by":"crossref","unstructured":"Guttman A (1984) R-trees: a dynamic index structure for spatial searching. In: SIGMOD\u201984, Proceedings of Annual Meeting, Boston, pp 47\u201357","DOI":"10.1145\/602259.602266"},{"key":"393_CR12","unstructured":"Hjaltason GR, Samet H (1998) Incremental distance join algorithms for spatial databases. In: SIGMOD 1998, Proceedings ACM SIGMOD International Conference on Management of Data, Seattle, pp 237\u2013248"},{"issue":"2","key":"393_CR13","first-page":"551","volume":"28","author":"H Hu","year":"2016","unstructured":"Hu H, Li G, Bao Z, Feng J, Wu Y, Gong Z, Xu Y (2016) Top-k spatio-textual similarity join. IEEE TKDE 28(2):551\u2013565","journal-title":"IEEE TKDE"},{"key":"393_CR14","doi-asserted-by":"crossref","unstructured":"Ilyas IF, Aref WG, Elmagarmid AK (2003) Supporting top-k join queries in relational databases. In: VLDB 2003, Proceedings of 29th International Conference on Very Large Data Bases, Berlin, pp 754\u2013765","DOI":"10.1016\/B978-012722442-8\/50072-0"},{"key":"393_CR15","doi-asserted-by":"crossref","unstructured":"Ilyas IF, Shah R, Aref WG, Vitter JS, Elmagarmid AK (2004) Rank-aware query optimization. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, Paris, pp 203\u2013214","DOI":"10.1145\/1007568.1007593"},{"issue":"1","key":"393_CR16","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1145\/1206049.1206056","volume":"32","author":"EH Jacox","year":"2007","unstructured":"Jacox EH, Samet H (2007) Spatial join techniques. ACM Trans Database Syst 32(1):7","journal-title":"ACM Trans Database Syst"},{"issue":"3","key":"393_CR17","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1090\/S0002-9939-1953-0055639-3","volume":"4","author":"J Kiefer","year":"1953","unstructured":"Kiefer J (1953) Sequential minimax search for a maximum. Proc Am Math Soc 4(3):502\u2013506","journal-title":"Proc Am Math Soc"},{"key":"393_CR18","doi-asserted-by":"crossref","unstructured":"Kim Y, Shim K (2012) Parallel top-k similarity join algorithms using mapreduce. In: IEEE 28Th international conference on data engineering (ICDE 2012), Washington, pp 510\u2013521","DOI":"10.1109\/ICDE.2012.87"},{"key":"393_CR19","doi-asserted-by":"crossref","unstructured":"Koudas N, Muthukrishnan S, Srivastava D (2000) Optimal histograms for hierarchical range queries. In: Proceedings of the Nineteenth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, Dallas, pp 196\u2013204","DOI":"10.1145\/335168.335223"},{"key":"393_CR20","doi-asserted-by":"crossref","unstructured":"Li C, Chang KCC, Ilyas IF, Song S (2005) Ranksql: Query algebra and optimization for relational top-k queries. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, Baltimore, pp 131\u2013142","DOI":"10.1145\/1066157.1066173"},{"key":"393_CR21","doi-asserted-by":"crossref","unstructured":"Ljosa V, Singh AK (2008) Top-k spatial joins of probabilistic objects. In: Proceedings of the 24th International Conference on Data Engineering, ICDE 2008, Cancu\u0307n, pp 566\u2013575","DOI":"10.1109\/ICDE.2008.4497465"},{"issue":"4","key":"393_CR22","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1145\/503099.503101","volume":"26","author":"N Mamoulis","year":"2001","unstructured":"Mamoulis N, Papadias D (2001) Multiway spatial joins. ACM Trans Database Syst 26(4):424\u2013475","journal-title":"ACM Trans Database Syst"},{"issue":"3","key":"393_CR23","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/1272743.1272749","volume":"32","author":"N Mamoulis","year":"2007","unstructured":"Mamoulis N, Yiu ML, Cheng KH, Cheung DW (2007) Efficient top-k aggregation of ranked inputs. ACM TODS 32(3):19\u201363","journal-title":"ACM TODS"},{"issue":"1","key":"393_CR24","first-page":"352","volume":"3","author":"D Martinenghi","year":"2010","unstructured":"Martinenghi D, Tagliasacchi M (2010) Proximity rank join. PVLDB 3 (1):352\u2013363","journal-title":"PVLDB"},{"key":"393_CR25","unstructured":"Natsev A, Chang YC, Smith JR, Li CS, Vitter JS (2001) Supporting incremental join queries on ranked inputs. In: VLDB 2001, Proceedings of 27th International Conference on Very Large Data Bases, Roma, pp 281\u2013290"},{"key":"393_CR26","doi-asserted-by":"crossref","unstructured":"Nobari S, Tauheed F, Heinis T, Karras P, Bressan S, Ailamaki A (2013) TOUCH: in-memory spatial join by hierarchical data-oriented partitioning. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2013, New York, pp 701\u2013712","DOI":"10.1145\/2463676.2463700"},{"issue":"7","key":"393_CR27","first-page":"493","volume":"7","author":"N Ntarmos","year":"2014","unstructured":"Ntarmos N, Patlakas I, Triantafillou P (2014) Rank join queries in nosql databases. PVLDB 7(7):493\u2013504","journal-title":"PVLDB"},{"key":"393_CR28","doi-asserted-by":"crossref","unstructured":"Papadias D, Kalnis P, Zhang J, Tao Y (2001) Efficient OLAP operations in spatial data warehouses. In: Advances in spatial and temporal databases, 7th international symposium, SSTD 2001, Redondo Beach, Proceedings, pp 443\u2013459","DOI":"10.1007\/3-540-47724-1_23"},{"key":"393_CR29","unstructured":"Patel JM, DeWitt DJ (1996) Partition based spatial-merge join. In: Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, Montreal, pp 259\u2013270"},{"issue":"7","key":"393_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0041322","volume":"7","author":"SB Petersen","year":"2012","unstructured":"Petersen SB, Neves-Petersen MT, Henriksen SB, Mortensen RJ, Geertz-Hansen HM (2012) Scale-free behaviour of amino acid pair interactions in folded proteins. PLos ONE 7(7):1\u201314","journal-title":"PLos ONE"},{"key":"393_CR31","doi-asserted-by":"crossref","unstructured":"Poosala V, Haas PJ, Ioannidis YE, Shekita EJ (1996) Improved histograms for selectivity estimation of range predicates. In: Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, Montreal, pp 294\u2013305","DOI":"10.1145\/233269.233342"},{"key":"393_CR32","doi-asserted-by":"crossref","unstructured":"Qi S, Bouros P, Mamoulis N (2013) Efficient top-k spatial distance joins. In: Advances in spatial and temporal databases - 13th international symposium, SSTD 2013, Munich, pp 1\u201318","DOI":"10.1007\/978-3-642-40235-7_1"},{"issue":"3","key":"393_CR33","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/s11280-017-0472-y","volume":"21","author":"Z Qian","year":"2018","unstructured":"Qian Z, Xu J, Zheng K, Zhao P, Zhou X (2018) Semantic-aware top-k spatial keyword queries. World Wide Web 21(3):573\u2013594","journal-title":"World Wide Web"},{"key":"393_CR34","doi-asserted-by":"crossref","unstructured":"Ray S, Simion B, Brown AD, Johnson R (2014) Skew-resistant parallel in-memory spatial join. In: Conference on scientific and statistical database management, SSDBM\u201914, Aalborg, pp 6:1\u20136:12","DOI":"10.1145\/2618243.2618262"},{"key":"393_CR35","doi-asserted-by":"crossref","unstructured":"Roussopoulos N, Kelley S, Vincent F (1995) Nearest neighbor queries. In: Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, San Jose, pp 71\u201379","DOI":"10.1145\/223784.223794"},{"key":"393_CR36","doi-asserted-by":"crossref","unstructured":"Saouk M, Doulkeridis C, Vlachou A, N\u00f8rv\u00e5g K (2016) Efficient processing of top-k joins in mapreduce. In: 2016 IEEE International conference on big data, bigdata 2016, Washington, pp 570\u2013577","DOI":"10.1109\/BigData.2016.7840649"},{"issue":"1","key":"393_CR37","doi-asserted-by":"publisher","first-page":"6:1","DOI":"10.1145\/1670243.1670249","volume":"35","author":"K Schnaitter","year":"2010","unstructured":"Schnaitter K, Polyzotis N (2010) Optimal algorithms for evaluating rank joins in database systems. ACM TODS 35(1):6:1\u20136:47","journal-title":"ACM TODS"},{"key":"393_CR38","unstructured":"Schnaitter K, Spiegel J, Polyzotis N (2007) Depth estimation for ranking query optimization. In: Proceedings of the 33rd International Conference on Very Large Data Bases. University of Vienna, Austria, pp 902\u2013913"},{"key":"393_CR39","doi-asserted-by":"crossref","unstructured":"Shin H, Moon B, Lee S (2000) Adaptive multi-stage distance join processing. In: Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, Dallas, pp 343\u2013354","DOI":"10.1145\/342009.335428"},{"issue":"3","key":"393_CR40","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1145\/320263.320276","volume":"3","author":"AJ Smith","year":"1978","unstructured":"Smith AJ (1978) Sequentiality and prefetching in database systems. ACM TODS 3(3):223\u2013247","journal-title":"ACM TODS"},{"issue":"1-2","key":"393_CR41","first-page":"860","volume":"3","author":"M Wu","year":"2010","unstructured":"Wu M, Berti-\u00c9quille L, Marian A, Procopiuc CM, Srivastava D (2010) Processing top-k join queries. PVLDB 3(1-2):860\u2013870","journal-title":"PVLDB"},{"key":"393_CR42","doi-asserted-by":"crossref","unstructured":"Xiao C, Wang W, Lin X, Shang H (2009) Top-k set similarity joins. In: Proceedings of the 2009 IEEE International Conference on Data Engineering, pp 916\u2013927","DOI":"10.1109\/ICDE.2009.111"},{"key":"393_CR43","doi-asserted-by":"crossref","unstructured":"Xin D, Han J, Chang KC (2007) Progressive and selective merge: computing top-k with ad-hoc ranking functions. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, Beijing, pp 103\u2013114","DOI":"10.1145\/1247480.1247494"},{"key":"393_CR44","doi-asserted-by":"crossref","unstructured":"Zhang S, Han J, Liu Z, Wang K, Xu Z (2009) SJMR: parallelizing spatial join with mapreduce on clusters. In: Proceedings of the 2009 IEEE International Conference on Cluster Computing, New Orleans, pp 1\u20138","DOI":"10.1109\/CLUSTR.2009.5289178"},{"key":"393_CR45","doi-asserted-by":"crossref","unstructured":"Zhao K, Zhou S, Tan KL, Zhou A (2005) Supporting ranked join in peer-to-peer networks. In: 16Th international workshop on database and expert systems applications (DEXA\u201905), pp 796\u2013800","DOI":"10.1109\/DEXA.2005.181"},{"issue":"4","key":"393_CR46","first-page":"567","volume":"17","author":"M Zhu","year":"2005","unstructured":"Zhu M, Papadias D, Lee DL, Zhang J (2005) Top-k spatial joins. IEEE TKDE 17(4):567\u2013579","journal-title":"IEEE TKDE"}],"container-title":["GeoInformatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-020-00393-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10707-020-00393-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-020-00393-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,11]],"date-time":"2021-02-11T14:24:18Z","timestamp":1613053458000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10707-020-00393-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,12]]},"references-count":46,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,7]]}},"alternative-id":["393"],"URL":"https:\/\/doi.org\/10.1007\/s10707-020-00393-z","relation":{},"ISSN":["1384-6175","1573-7624"],"issn-type":[{"type":"print","value":"1384-6175"},{"type":"electronic","value":"1573-7624"}],"subject":[],"published":{"date-parts":[[2020,2,12]]},"assertion":[{"value":"21 January 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 September 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 January 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 February 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}