{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:39:27Z","timestamp":1740123567866,"version":"3.37.3"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2018,4,21]],"date-time":"2018-04-21T00:00:00Z","timestamp":1524268800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003621","name":"Ministry of Science, ICT and Future Planning","doi-asserted-by":"publisher","award":["2012R1A1A2042552"],"award-info":[{"award-number":["2012R1A1A2042552"]}],"id":[{"id":"10.13039\/501100003621","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s11227-018-2384-8","type":"journal-article","created":{"date-parts":[[2018,4,21]],"date-time":"2018-04-21T01:46:15Z","timestamp":1524275175000},"page":"7952-7978","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Data-independent vantage point selection for range queries"],"prefix":"10.1007","volume":"75","author":[{"given":"Alok","family":"Watve","sequence":"first","affiliation":[]},{"given":"Sakti","family":"Pramanik","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5332-5947","authenticated-orcid":false,"given":"Sungwon","family":"Jung","sequence":"additional","affiliation":[]},{"given":"Chae Yong","family":"Lim","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,4,21]]},"reference":[{"key":"2384_CR1","doi-asserted-by":"publisher","unstructured":"Agarwal PK, Kumar N, Sintos S, Suri S (2016) Range-max queries on uncertain data. In: Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS \u201916. ACM, New York, pp 465\u2013476. \nhttps:\/\/doi.org\/10.1145\/2902251.2902281","DOI":"10.1145\/2902251.2902281"},{"issue":"2","key":"2384_CR2","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/93605.98741","volume":"19","author":"N Beckmann","year":"1990","unstructured":"Beckmann N, Kriegel HP, Schneider R, Seeger B (1990) The R*-Tree: an efficient and robust access method for points and rectangles. SIGMOD Rec 19(2):322\u2013331. \nhttps:\/\/doi.org\/10.1145\/93605.98741","journal-title":"SIGMOD Rec"},{"key":"2384_CR3","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"JL Bentley","year":"1975","unstructured":"Bentley JL (1975) Multidimensional binary search trees used for associative searching. Commun ACM 18:509\u2013517. \nhttps:\/\/doi.org\/10.1145\/361002.361007","journal-title":"Commun ACM"},{"key":"2384_CR4","unstructured":"Bertin-Mahieux T, Ellis DP, Whitman B, Lamere P (2011) The million song dataset. \nhttps:\/\/labrosa.ee.columbia.edu\/millionsong\/\n\n. Accessed 17 Dec 2017"},{"key":"2384_CR5","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1145\/328939.328959","volume":"24","author":"T Bozkaya","year":"1999","unstructured":"Bozkaya T, Ozsoyoglu M (1999) Indexing large metric spaces for similarity search queries. ACM Trans Database Syst 24:361\u2013404. \nhttps:\/\/doi.org\/10.1145\/328939.328959","journal-title":"ACM Trans Database Syst"},{"key":"2384_CR6","unstructured":"Brin S (1995) Near neighbor search in large metric spaces. In: Proceedings of the 21th International Conference on Very Large Data Bases, VLDB \u201995. Morgan Kaufmann Publishers Inc., San Francisco, pp 574\u2013584. \nhttp:\/\/dl.acm.org\/citation.cfm?id=645921.673006"},{"key":"2384_CR7","doi-asserted-by":"publisher","unstructured":"Chen L, Gao Y, Wang K, Jensen C.S, Chen G (2016) Answering why-not questions on metric probabilistic range queries. In: 2016 IEEE 32nd International Conference on Data Engineering (ICDE), pp 767\u2013778. \nhttps:\/\/doi.org\/10.1109\/ICDE.2016.7498288","DOI":"10.1109\/ICDE.2016.7498288"},{"issue":"4","key":"2384_CR8","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/s00778-017-0465-6","volume":"26","author":"L Chen","year":"2017","unstructured":"Chen L, Gao Y, Zhong A, Jensen CS, Chen G, Zheng B (2017) Indexing metric uncertain data for range queries and range joins. VLDB J 26(4):585\u2013610. \nhttps:\/\/doi.org\/10.1007\/s00778-017-0465-6","journal-title":"VLDB J"},{"key":"2384_CR9","unstructured":"Ciaccia P, Patella M, Zezula P (1997) M-tree: an efficient access method for similarity search in metric spaces. In: VLDB \u201997: Proceedings of the 23rd International Conference on Very Large Data Bases. Morgan Kaufmann Publishers Inc., San Francisco, pp 426\u2013435"},{"key":"2384_CR10","doi-asserted-by":"publisher","unstructured":"Faloutsos C, Lin K.I (1995) Fastmap: a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets. In: Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, SIGMOD \u201995. ACM, New York, pp 163\u2013174. \nhttps:\/\/doi.org\/10.1145\/223784.223812","DOI":"10.1145\/223784.223812"},{"key":"2384_CR11","doi-asserted-by":"crossref","unstructured":"Ferrada H, Navarro G (2016) Improved range minimum queries. In: 2016 Data Compression Conference (DCC), pp 516\u2013525","DOI":"10.1109\/DCC.2016.42"},{"key":"2384_CR12","doi-asserted-by":"publisher","unstructured":"Filho R, Traina A, Traina A, Faloutsos C (2001) Similarity search without tears: the OMNI-family of all-purpose access methods. In: Data Engineering, 2001. Proceedings of the 17th International Conference on, pp 623\u2013630. \nhttps:\/\/doi.org\/10.1109\/ICDE.2001.914877","DOI":"10.1109\/ICDE.2001.914877"},{"issue":"6","key":"2384_CR13","doi-asserted-by":"publisher","first-page":"1443","DOI":"10.1007\/s11280-017-0444-2","volume":"20","author":"X Fu","year":"2017","unstructured":"Fu X, Miao X, Xu J, Gao Y (2017) Continuous range-based skyline queries in road networks. World Wide Web 20(6):1443\u20131467. \nhttps:\/\/doi.org\/10.1007\/s11280-017-0444-2","journal-title":"World Wide Web"},{"key":"2384_CR14","doi-asserted-by":"crossref","unstructured":"Guttman A (1984) R-trees: a dynamic index structure for spatial searching. In: Proceedings of ACM SIGMOD, pp 47\u201357","DOI":"10.1145\/971697.602266"},{"issue":"6","key":"2384_CR15","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1109\/TSMCC.2011.2109710","volume":"41","author":"W Hu","year":"2011","unstructured":"Hu W, Xie N, Li Zeng X, Maybank S (2011) A survey on visual content-based video indexing and retrieval. Trans Syst Man Cyber Part C 41(6):797\u2013819. \nhttps:\/\/doi.org\/10.1109\/TSMCC.2011.2109710","journal-title":"Trans Syst Man Cyber Part C"},{"key":"2384_CR16","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1145\/1071610.1071612","volume":"30","author":"HV Jagadish","year":"2005","unstructured":"Jagadish HV, Ooi BC, Tan KL, Yu C, Zhang R (2005) idistance: an adaptive B+-tree based indexing method for nearest neighbor search. ACM Trans Database Syst 30:364\u2013397. \nhttps:\/\/doi.org\/10.1145\/1071610.1071612","journal-title":"ACM Trans Database Syst"},{"issue":"11","key":"2384_CR17","doi-asserted-by":"publisher","first-page":"4233","DOI":"10.1007\/s11227-015-1497-6","volume":"72","author":"NS Jho","year":"2016","unstructured":"Jho NS, Chang KY, Hong D, Seo C (2016) Symmetric searchable encryption with efficient range query using multi-layered linked chains. J Supercomput 72(11):4233\u20134246. \nhttps:\/\/doi.org\/10.1007\/s11227-015-1497-6","journal-title":"J Supercomput"},{"issue":"1","key":"2384_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1126004.1126005","volume":"2","author":"MS Lew","year":"2006","unstructured":"Lew MS, Sebe N, Djeraba C, Jain R (2006) Content-based multimedia information retrieval: state of the art and challenges. ACM Trans Multimed Comput Commun Appl 2(1):1\u201319. \nhttps:\/\/doi.org\/10.1145\/1126004.1126005","journal-title":"ACM Trans Multimed Comput Commun Appl"},{"issue":"1","key":"2384_CR19","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1016\/j.patcog.2006.04.045","volume":"40","author":"Y Liu","year":"2007","unstructured":"Liu Y, Zhang D, Lu G, Ma WY (2007) A survey of content-based image retrieval with high-level semantics. Pattern Recognit 40(1):262\u2013282. \nhttps:\/\/doi.org\/10.1016\/j.patcog.2006.04.045","journal-title":"Pattern Recognit"},{"key":"2384_CR20","doi-asserted-by":"publisher","unstructured":"Luo Q, Zhang S, Huang T, Gao W, Tian Q (2014) Superimage: packing semantic-relevant images for indexing and retrieval. In: Proceedings of International Conference on Multimedia Retrieval, ICMR \u201914. ACM, New York, pp 41:41\u201341:48. \nhttps:\/\/doi.org\/10.1109\/10.1145\/2578726.2578741","DOI":"10.1109\/10.1145\/2578726.2578741"},{"key":"2384_CR21","unstructured":"MIT Image Dataset (2010) MIT CSAIL: visual dictionary. \nhttp:\/\/groups.csail.mit.edu\/vision\/TinyImages\/\n\n. Accessed 17 Dec 2017"},{"key":"2384_CR22","unstructured":"National Oceanic and Atmospheric Administration (NOAA) weather data (2012) \nftp:\/\/ftp.ncdc.noaa.gov\/pub\/data\/gsod\/\n\n. Accessed 17 Dec 2017"},{"key":"2384_CR23","unstructured":"Ortega-Binderberger M, Porkaew K, Mehrotra S (2011) Corel image feature data set\u2014UCI machine learning repository. \nhttp:\/\/archive.ics.uci.edu\/ml\n\n. Accessed 17 Dec 2017"},{"issue":"1-2","key":"2384_CR24","doi-asserted-by":"publisher","first-page":"409","DOI":"10.14778\/1920841.1920895","volume":"3","author":"Sakti Pramanik","year":"2010","unstructured":"Pramanik S, Watve A, Meiners CR, Liu A (2010) Transforming range queries to equivalent box queries to optimize page access. Proc VLDB Endow 3:409\u2013416. \nhttp:\/\/portal.acm.org\/citation.cfm?id=1920841.1920895","journal-title":"Proceedings of the VLDB Endowment"},{"key":"2384_CR25","doi-asserted-by":"crossref","unstructured":"Robinson J (1981) The K-D-B-tree: a search structure for large multidimensional dynamic indexes. In: Proceedings of ACM SIGMOD, pp 10\u201318","DOI":"10.1145\/582318.582321"},{"key":"2384_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-016-1956-8","author":"JJ Song","year":"2017","unstructured":"Song JJ, Lee W (2017) Relevance maximization for high-recall retrieval problem: finding all needles in a haystack. J Supercomput. \nhttps:\/\/doi.org\/10.1007\/s11227-016-1956-8","journal-title":"J Supercomput"},{"key":"2384_CR27","doi-asserted-by":"publisher","first-page":"16:1","DOI":"10.1145\/2000486.2000490","volume":"7","author":"RH Leuken Van","year":"2011","unstructured":"Van Leuken RH, Veltkamp RC (2011) Selecting vantage objects for similarity indexing. ACM Trans Multimed Comput Commun Appl 7:16:1\u201316:18. \nhttps:\/\/doi.org\/10.1145\/2000486.2000490","journal-title":"ACM Trans Multimed Comput Commun Appl"},{"key":"2384_CR28","unstructured":"Venkateswaran J, Lachwani D, Kahveci T, Jermaine C (2006) Reference-based indexing of sequence databases. In: Proceedings of the 32nd International Conference on Very Large Databases, VLDB \u201906. VLDB Endowment, pp 906\u2013917. \nhttp:\/\/dl.acm.org\/citation.cfm?id=1182635.1164205"},{"issue":"1","key":"2384_CR29","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0031-3203(00)00120-5","volume":"35","author":"J Vleugels","year":"2002","unstructured":"Vleugels J, Veltkamp RC (2002) Efficient image retrieval through vantage objects. Pattern Recognit 35(1):69\u201380. \nhttps:\/\/doi.org\/10.1016\/S0031-3203(00)00120-5","journal-title":"Pattern Recognit"},{"key":"2384_CR30","doi-asserted-by":"crossref","unstructured":"Wang P, Ravishankar CV (2013) Secure and efficient range queries on outsourced databases using Rp-trees. In: 2013 IEEE 29th International Conference on Data Engineering (ICDE), pp 314\u2013325","DOI":"10.1109\/ICDE.2013.6544835"},{"key":"2384_CR31","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1109\/TSMCB.2005.848489","volume":"35","author":"X Wang","year":"2005","unstructured":"Wang X, Shasha D, Zhang K (2005) Metricmap: an embedding technique for processing distance-based queries in metric spaces. IEEE Trans Syst Man Cybern Part B (Cybern) 35:973\u2013987. \nhttps:\/\/doi.org\/10.1109\/TSMCB.2005.848489","journal-title":"IEEE Trans Syst Man Cybern Part B (Cybern)"},{"issue":"5","key":"2384_CR32","doi-asserted-by":"publisher","first-page":"1438","DOI":"10.1109\/TKDE.2014.2363658","volume":"27","author":"A Watve","year":"2015","unstructured":"Watve A, Pramanik S, Shahid S, Meiners CR, Liu AX (2015) Topological transformation approaches to database query processing. IEEE Trans Knowl Data Eng 27(5):1438\u20131451. \nhttps:\/\/doi.org\/10.1109\/TKDE.2014.2363658","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2384_CR33","unstructured":"Yianilos PN (1993) Data structures and algorithms for nearest neighbor search in general metric spaces. In: Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA \u201993. Society for Industrial and Applied Mathematics, Philadelphia, pp 311\u2013321. \nhttp:\/\/dl.acm.org\/citation.cfm?id=313559.313789"},{"issue":"1","key":"2384_CR34","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1109\/69.755617","volume":"11","author":"A Yoshitaka","year":"1999","unstructured":"Yoshitaka A, Ichikawa T (1999) A survey on content-based retrieval for multimedia databases. IEEE Trans Knowl Data Eng 11(1):81\u201393. \nhttps:\/\/doi.org\/10.1109\/69.755617","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2384_CR35","doi-asserted-by":"publisher","unstructured":"Zhu H, Yang X, Wang B, Lee WC (2016) Range-based obstructed nearest neighbor queries. In: Proceedings of the 2016 International Conference on Management of Data, SIGMOD \u201916. ACM, New York, pp 2053\u20132068. \nhttps:\/\/doi.org\/10.1145\/2882903.2915234","DOI":"10.1145\/2882903.2915234"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-018-2384-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-018-2384-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-018-2384-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,20]],"date-time":"2019-11-20T04:16:09Z","timestamp":1574223369000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-018-2384-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,21]]},"references-count":35,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["2384"],"URL":"https:\/\/doi.org\/10.1007\/s11227-018-2384-8","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2018,4,21]]},"assertion":[{"value":"21 April 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}