{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T16:02:39Z","timestamp":1781107359128,"version":"3.54.1"},"reference-count":31,"publisher":"IGI Global Scientific Publishing","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,4,1]]},"abstract":"<p>Criteria that induce a Skyline naturally represent user's preference conditions useful to discard irrelevant data in large datasets. However, in the presence of high-dimensional Skyline spaces, the size of the Skyline can still be very large, making unfeasible for users to process this set of points. To identify the best points among the Skyline, the Top-k Skyline approach has been proposed. Top-k Skyline uses discriminatory criteria to induce a total order of the points that comprise the Skyline, and recognizes the best or top-k points based on these criteria. In this article the authors model queries as multi-dimensional points that represent bounds of VPT (Vertically Partitioned Table) property values, and datasets as sets of multi-dimensional points; the problem is to locate the k best tuples in the dataset whose distance to the query is minimized. A tuple is among the k best tuples whenever there is not another tuple that is better in all dimensions, and that is closer to the query point, i.e., the k best tuples correspond to the k nearest points to the query that are incomparable or belong to the skyline. The authors name these tuples the k nearest neighbors in the skyline. The authors propose a hybrid approach that combines Skyline and Top-k solutions and develop two algorithms: TKSI and k-NNSkyline. The proposed algorithms identify among the skyline tuples, the k ones with the lowest values of the distance metric, i.e., the k nearest neighbors to the multi-dimensional query that are incomparable. Empirically, we study the performance and quality of TKSI and k-NNSkyline. The authors\u2019 experimental results show the TKSI is able to speed up the computation of the Top-k Skyline in at least 50% percent with respect to the state-of-the-art solutions, whenever k is smaller than the size of the Skyline. Additionally, the authors\u2019 results suggest that k-NNSkyline outperforms existing solutions by up to three orders of magnitude.<\/p>","DOI":"10.4018\/ijirr.2013040104","type":"journal-article","created":{"date-parts":[[2014,1,23]],"date-time":"2014-01-23T11:51:02Z","timestamp":1390477862000},"page":"58-77","source":"Crossref","is-referenced-by-count":0,"title":["Efficiently Producing the K Nearest Neighbors in the Skyline on Vertically Partitioned Tables"],"prefix":"10.4018","volume":"3","author":[{"given":"Marlene","family":"Goncalves","sequence":"first","affiliation":[{"name":"Departamento de Computaci\u00f3n y Tecnolog\u00eda de Informaci\u00f3n, Universidad Sim\u00f3n Bol\u00edvar, Caracas, Venezuela"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Maria-Esther","family":"Vidal","sequence":"additional","affiliation":[{"name":"Departamento de Computaci\u00f3n y Tecnolog\u00eda de Informaci\u00f3n, Universidad Sim\u00f3n Bol\u00edvar, Caracas, Venezuela"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"ijirr.2013040104-0","doi-asserted-by":"crossref","unstructured":"Acosta, M., Goncalves, M., & Vidal, M.-E. (2011). Carey: Climatological control of emergency regions. In Proceedings of the On The Move (OTM) Workshops (pp. 494-503). Crete, Greece: Springer-Verlag.","DOI":"10.1007\/978-3-642-25126-9_61"},{"key":"ijirr.2013040104-1","doi-asserted-by":"crossref","unstructured":"Balke, W. T., & G\u00fcntzer, U. (2004). Multi-objective query processing for database systems. In Proceedings of The International Conference on Very Large Databases (VLDB) (pp. 936-947). Toronto, Canada: Morgan Kaufmann.","DOI":"10.1016\/B978-012088469-8.50082-6"},{"key":"ijirr.2013040104-2","doi-asserted-by":"crossref","unstructured":"Balke, W. T., G\u00fcntzer, U., & Zheng, J. X. (2004). Efficient distributed skylining for web information systems. In The extending database technology (EDBT) (pp. 256-273). Heraklion, Crete, Greece: Springer-Verlag.","DOI":"10.1007\/978-3-540-24741-8_16"},{"key":"ijirr.2013040104-3","doi-asserted-by":"crossref","unstructured":"Bao, J., Chow, C.-Y., Mokbel, M. F., & Ku, W.-S. (2010). Efficient evaluation of k-range nearest neighbor queries in road networks. In Proceedings of the Eleventh International Conference on Mobile Data Management (MDM) (pp. 115-124). Kansas City, MI: IEEE Computer Society.","DOI":"10.1109\/MDM.2010.40"},{"key":"ijirr.2013040104-4","doi-asserted-by":"publisher","DOI":"10.1145\/322092.322095"},{"key":"ijirr.2013040104-5","unstructured":"B\u00f6rzs\u00f6nyi, S., Kossmann, D., & Stocker, K. (2001). The skyline operator. In the Proceedings of the 17th International Conference on Data Engineering (pp. 421- 430). Washington, DC: IEEE Computer Society."},{"key":"ijirr.2013040104-6","doi-asserted-by":"publisher","DOI":"10.1145\/253262.253302"},{"key":"ijirr.2013040104-7","doi-asserted-by":"crossref","unstructured":"Chan, C.-Y., Jagadish, H. V., Tan, K.-L., Tung, A. K. H., & Zhang, Z. (2006a). Finding k-dominant skylines in high dimensional space. In the Proceedings of the 2006 ACM SIGMOD International Conference on Management of Data (SIGMOD '06) (pp. 503-514). New York, NY: ACM.","DOI":"10.1145\/1142473.1142530"},{"key":"ijirr.2013040104-8","doi-asserted-by":"crossref","unstructured":"Chan, C. Y., Jagadish, H. V., Tan, K.-L., Tung, A. K. H., & Zhang, Z. (2006b). On high dimensional skylines. In Proceedings of International Conference on Extending Database Technology (EDBT) (pp. 478-495). Munich, Germany: Springer-Verlag.","DOI":"10.1007\/11687238_30"},{"key":"ijirr.2013040104-9","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-009-0152-3"},{"key":"ijirr.2013040104-10","doi-asserted-by":"crossref","unstructured":"Chen, L., Gao, S., & Anyanwu, K. (2011). Efficiently evaluating skyline queries on RDF databases. In 8th Extended Semantic Web Conference (ESWC), (pp. 123-138). Heraklion, Crete, Greece: Springer-Verlag.","DOI":"10.1007\/978-3-642-21064-8_9"},{"key":"ijirr.2013040104-11","doi-asserted-by":"crossref","unstructured":"Chow, C.-Y., Mokbel, M. F., Naps, J., & Nath, S. (2009). Approximate evaluation of range nearest neighbor queries with quality guarantee. In Proceedings of the 11th International Symposium of Advances in Spatial and Temporal Databases (SSTD) (pp. 283-301). Aalborg, Denmark: Springer-Verlag.","DOI":"10.1007\/978-3-642-02982-0_19"},{"key":"ijirr.2013040104-12","unstructured":"Godfrey, P., Shipley, R., & Gryz, J. (2005). Maximal vector computation in large data sets. In Proceedings of the 31st International Conference on Very Large Data Bases (VLDB '05) (pp. 229-240). Trondheim, Norway: Morgan Kaufmann."},{"key":"ijirr.2013040104-13","doi-asserted-by":"crossref","unstructured":"Goncalves, M., & Vidal, M.-E. (2009). Reaching the top of the skyline: An efficient indexed algorithm for top-k skyline queries. In Proceedings of International Conference on Database and Expert Systems Applications (DEXA) (pp. 471-485). Lynz, Austria: Springer-Verlag.","DOI":"10.1007\/978-3-642-03573-9_41"},{"key":"ijirr.2013040104-14","doi-asserted-by":"crossref","unstructured":"Kossmann, D., Ramsak, F., & Rost, S. (2002). Shooting stars in the sky: An online algorithm for skyline queries. In Proceedings of the 28th International Conference on Very Large Data Bases (VLDB) (pp. 275-286). Hong Kong, China: Morgan Kaufmann.","DOI":"10.1016\/B978-155860869-6\/50032-9"},{"key":"ijirr.2013040104-15","unstructured":"Kunder, M. (2013). The size of the world wide web (the internet). Retrieved from http:\/\/www.worldwidewebsize.com\/"},{"key":"ijirr.2013040104-16","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-009-0166-x"},{"key":"ijirr.2013040104-17","unstructured":"Ley, M. (2013). The DBLP computer science bibliography. Retrieved from http:\/\/www.informatik.uni-trier.de\/~ley\/db"},{"key":"ijirr.2013040104-18","doi-asserted-by":"crossref","unstructured":"Lin, X., Yuan, Y., Zhang, Q., & Zhang, Y. (2007). Selecting stars: The k most representative skyline operator. In Proceedings of International Conference on Database Theory (ICDE) (pp. 86-95). Istanbul, Turkey: Springer-Verlag.","DOI":"10.1109\/ICDE.2007.367854"},{"key":"ijirr.2013040104-19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29035-0_3"},{"key":"ijirr.2013040104-20","doi-asserted-by":"crossref","unstructured":"Papadias, D., Tao, Y., Fu, G., & Seeger, B. (2003). An optimal and progressive algorithm for skyline queries. In Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data (SIGMOD '03) (pp. 467-478) New York, NY: ACM Press.","DOI":"10.1145\/872757.872814"},{"key":"ijirr.2013040104-21","doi-asserted-by":"publisher","DOI":"10.1145\/1189769.1189774"},{"key":"ijirr.2013040104-22","doi-asserted-by":"crossref","unstructured":"Roussopoulos, N., Kelley, S., & Vincent, F. (1995). Nearest neighbor queries. In Proceedings of the SIGMOD Conference (pp. 71-79). San Jose, CA: ACM Press.","DOI":"10.1145\/568271.223794"},{"key":"ijirr.2013040104-23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23091-2_30"},{"key":"ijirr.2013040104-24","unstructured":"Selke, J., & Balke, W. T. (2011). Exploiting conceptual knowledge for querying information systems. CoRR Vol abs\/1105.4702, 2011. Retrieved from http:\/\/arxiv.org\/abs\/1105.4702"},{"key":"ijirr.2013040104-25","doi-asserted-by":"crossref","unstructured":"Song, Z., & Roussopoulos, N. (2001). K-nearest neighbor search for moving query point. In Proceedings of the International Symposium of Advances in Spatial and Temporal Databases (SSTD) (pp. 79-96). Redondo Beach, CA: Springer-Verlag.","DOI":"10.1007\/3-540-47724-1_5"},{"key":"ijirr.2013040104-26","unstructured":"Tan, K., Eng, P., & Ooi, B. (2001). Efficient progressive skyline computation. In Proceedings of the 28th international conference on Very Large Data Bases (VLDB) (pp. 301-310). Roma, Italy: Morgan Kaufmann."},{"key":"ijirr.2013040104-27","unstructured":"Vlachou, A., & Vazirgiannis, M. (2007). Link-based ranking of skyline result sets. In The Proceedings of the 3rd Multidisciplinary Workshop on Advances in Preference Handling (M-Pref). Vienna, Austria."},{"key":"ijirr.2013040104-28","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2010.03.008"},{"key":"ijirr.2013040104-29","doi-asserted-by":"crossref","unstructured":"Wagner, A., Tran, T., Lagwid, G., & Harth, A. (2012). Top-k linked data query processing. In Proceedings of the Extended Semantic Web Conference (ESWC) (pp. 56-71). Heraklion, Crete, Greece: Springer-Verlag.","DOI":"10.1007\/978-3-642-30284-8_11"},{"key":"ijirr.2013040104-30","unstructured":"Yuan, Y., Lin, X., Liu, Q., Wang, W., Yu, J. X., & Zhang, Q. (2005). Efficient computation of the skyline cube. In Proceedings of the 31st international conference on Very Large Data Bases (VLDB '05) (pp. 241-252). Trondheim, Norway: Morgan Kaufmann."}],"container-title":["International Journal of Information Retrieval Research"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=100041","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T13:34:05Z","timestamp":1654090445000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/ijirr.2013040104"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2013,4,1]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,4]]}},"URL":"https:\/\/doi.org\/10.4018\/ijirr.2013040104","relation":{},"ISSN":["2155-6377","2155-6385"],"issn-type":[{"value":"2155-6377","type":"print"},{"value":"2155-6385","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,1]]}}}