{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T01:17:13Z","timestamp":1760059033862,"version":"build-2065373602"},"reference-count":104,"publisher":"MDPI AG","issue":"5","license":[{"start":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T00:00:00Z","timestamp":1747267200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Data"],"abstract":"<jats:p>In today\u2019s data-driven world, algorithms operating with vertically distributed datasets are crucial due to the increasing prevalence of large-scale, decentralized data storage. These algorithms process data locally, thereby reducing data transfer and exposure to breaches, while at the same time improving scalability thanks to data distribution across multiple sources. Top-k queries are a key tool in vertically distributed scenarios and are widely applied in critical applications involving sensitive data. Classical top-k algorithms typically resort to sorted access to sequentially scan the dataset and to random access to retrieve a tuple by its id. However, the latter kind of access is sometimes too costly to be feasible, and algorithms need to be designed for the so-called \u201cno random access\u201d (NRA) scenario. The latest efforts in this direction do not cover the recent advances in ranking queries, which propose hybridizations of top-k queries (which are preference-aware and control the output size) and skyline queries (which are preference-agnostic and have uncontrolled output size). The non-dominated flexible skyline (ND) is one such proposal, which tries to obtain the best of top-k and skyline queries. We introduce an algorithm for computing ND in the NRA scenario, prove its correctness and optimality within its class, and provide an experimental evaluation covering a wide range of cases, with both synthetic and real datasets.<\/jats:p>","DOI":"10.3390\/data10050076","type":"journal-article","created":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T08:56:55Z","timestamp":1747299415000},"page":"76","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Computing Non-Dominated Flexible Skylines in Vertically Distributed Datasets with No Random Access"],"prefix":"10.3390","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2726-7683","authenticated-orcid":false,"given":"Davide","family":"Martinenghi","sequence":"first","affiliation":[{"name":"Dipartimento di Elettronica, Informazione e Bioingegneria, Politecnico di Milano, Piazza Leonardo 32, 20133 Milan, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2025,5,15]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Fagin, R. (1996, January 3\u20135). Combining Fuzzy Information from Multiple Systems. Proceedings of the Fifteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Montreal, QC, Canada.","DOI":"10.1145\/237661.237715"},{"key":"ref_2","first-page":"1","article-title":"Web Scraping Techniques and Applications: A Literature Review","volume":"142","author":"Ertz","year":"2023","journal-title":"J. Bus. Res."},{"key":"ref_3","unstructured":"Carro, M. (2014). NoSQL Databases. arXiv."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Zhang, W., Liu, J., and Chen, L. (2022, January 5\u20138). Automatic Web Data API Creation via Cross-Lingual Neural Pagination. Proceedings of the 2022 International Conference on Web Engineering, Bari, Italy.","DOI":"10.1007\/978-3-031-09917-5_8"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"1793","DOI":"10.14778\/3401960.3401974","article-title":"Shared Arrangements: Practical Inter-Query Sharing for Streaming Dataflows","volume":"13","author":"McSherry","year":"2020","journal-title":"Proc. VLDB Endow."},{"key":"ref_6","unstructured":"Alabdulkarim, A., and Bhowmick, S.S. (2024, January 13\u201316). Efficient and Secure Multiparty Querying over Federated Graph Databases. Proceedings of the 2024 International Conference on Data Engineering (ICDE), Utrecht, The Netherlands."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Fagin, R., Lotem, A., and Naor, M. (2001, January 21\u201323). Optimal Aggregation Algorithms for Middleware. Proceedings of the Twentieth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, Santa Barbara, CA, USA.","DOI":"10.1145\/375551.375567"},{"key":"ref_8","unstructured":"B\u00f6rzs\u00f6nyi, S., Kossmann, D., and Stocker, K. (2001, January 2\u20136). The Skyline Operator. Proceedings of the 17th International Conference on Data Engineering, Heidelberg, Germany."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1454","DOI":"10.14778\/3137628.3137653","article-title":"Reconciling Skyline and Ranking Queries","volume":"10","author":"Ciaccia","year":"2017","journal-title":"Proc. VLDB Endow."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"18:1","DOI":"10.1145\/3406113","article-title":"Flexible Skylines: Dominance for Arbitrary Sets of Monotone Functions","volume":"45","author":"Ciaccia","year":"2020","journal-title":"ACM Trans. Database Syst."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1145\/1061318.1061320","article-title":"Progressive skyline computation in database systems","volume":"30","author":"Papadias","year":"2005","journal-title":"ACM Trans. Database Syst."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Ciaccia, P., and Martinenghi, D. (2018, January 22\u201326). FA + TA < FSA: Flexible Score Aggregation. Proceedings of the 27th ACM International Conference on Information and Knowledge Management, CIKM 2018, Torino, Italy.","DOI":"10.1145\/3269206.3271753"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/1272743.1272749","article-title":"Efficient top-k aggregation of ranked inputs","volume":"32","author":"Mamoulis","year":"2007","journal-title":"ACM Trans. Database Syst."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1145\/321906.321910","article-title":"On Finding the Maxima of a Set of Vectors","volume":"22","author":"Kung","year":"1975","journal-title":"J. ACM"},{"key":"ref_15","unstructured":"Chomicki, J., Godfrey, P., Gryz, J., and Liang, D. (2003, January 5\u20138). Skyline with Presorting. Proceedings of the 19th International Conference on Data Engineering, Bangalore, India."},{"key":"ref_16","unstructured":"B\u00f6hm, K., Jensen, C.S., Haas, L.M., Kersten, M.L., Larson, P., and Ooi, B.C. (September, January 30). Maximal Vector Computation in Large Data Sets. Proceedings of the 31st International Conference on Very Large Data Bases, Trondheim, Norway."},{"key":"ref_17","unstructured":"Yu, P.S., Tsotras, V.J., Fox, E.A., and Liu, B. (2006, January 6\u201311). SaLSa: Computing the skyline without scanning the whole sky. Proceedings of the 2006 ACM CIKM International Conference on Information and Knowledge Management, Arlington, VA, USA."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s00778-006-0029-7","article-title":"Algorithms and analyses for maximal vector computation","volume":"16","author":"Godfrey","year":"2007","journal-title":"VLDB J."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"670","DOI":"10.1016\/j.is.2006.05.002","article-title":"Semantic optimization techniques for preference queries","volume":"32","author":"Chomicki","year":"2007","journal-title":"Inf. Syst."},{"key":"ref_20","unstructured":"Koch, C., Gehrke, J., Garofalakis, M.N., Srivastava, D., Aberer, K., Deshpande, A., Florescu, D., Chan, C.Y., Ganti, V., and Kanne, C. (2007, January 23\u201327). Approaching the Skyline in Z Order. Proceedings of the 33rd International Conference on Very Large Data Bases, Vienna, Austria."},{"key":"ref_21","unstructured":"Lenzerini, M., and Schwentick, T. (2011, January 12\u201316). On finding skylines in external memory. Proceedings of the 30th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2011, Athens, Greece."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Fagin, R. (1998, January 1\u20133). Fuzzy Queries in Multimedia Database Systems. Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Seattle, WA, USA.","DOI":"10.1145\/275487.275488"},{"key":"ref_23","unstructured":"Koch, C., Gehrke, J., Garofalakis, M.N., Srivastava, D., Aberer, K., Deshpande, A., Florescu, D., Chan, C.Y., Ganti, V., and Kanne, C. (2007, January 23\u201327). Best Position Algorithms for Top-k Queries. Proceedings of the 33rd International Conference on Very Large Data Bases, Vienna, Austria."},{"key":"ref_24","unstructured":"Dayal, U., Whang, K., Lomet, D.B., Alonso, G., Lohman, G.M., Kersten, M.L., Cha, S.K., and Kim, Y. (2006, January 12\u201315). IO-Top-k: Index-access Optimized Top-k Query Processing. Proceedings of the 32nd International Conference on Very Large Data Bases, Seoul, Republic of Korea."},{"key":"ref_25","unstructured":"Lenzerini, M., and Lembo, D. (2008, January 9\u201311). Evaluating rank joins with optimal cost. Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2008, Vancouver, BC, Canada."},{"key":"ref_26","unstructured":"Szalay, A., Budavari, T., Balazinska, M., Meliou, A., and Sacan, A. (2013, January 29\u201331). Bulk sorted access for efficient top-k retrieval. Proceedings of the Conference on Scientific and Statistical Database Management, SSDBM \u201913, Baltimore, MD, USA."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"1763","DOI":"10.1109\/TKDE.2011.60","article-title":"SPARK2: Top-k Keyword Query in Relational Databases","volume":"23","author":"Luo","year":"2011","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_28","unstructured":"Chan, C.Y., Ooi, B.C., and Zhou, A. (2007, January 12\u201314). Spark: Top-k keyword query in relational databases. Proceedings of the ACM SIGMOD International Conference on Management of Data, Beijing, China."},{"key":"ref_29","unstructured":"Chan, C.Y., Ooi, B.C., and Zhou, A. (2007, January 12\u201314). Progressive and selective merge: Computing top-k with ad-hoc ranking functions. Proceedings of the ACM SIGMOD International Conference on Management of Data, Beijing, China."},{"key":"ref_30","unstructured":"G\u00fcntzer, U., Balke, W., and Kie\u00dfling, W. (2001, January 2\u20134). Towards Efficient Multi-Feature Queries in Heterogeneous Environments. Proceedings of the 2001 International Symposium on Information Technology (ITCC 2001), Las Vegas, NV, USA."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"614","DOI":"10.1016\/S0022-0000(03)00026-6","article-title":"Optimal aggregation algorithms for middleware","volume":"66","author":"Fagin","year":"2003","journal-title":"J. Comput. Syst. Sci."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1145\/565117.565143","article-title":"Combining Fuzzy Information: An Overview","volume":"31","author":"Fagin","year":"2002","journal-title":"SIGMOD Rec."},{"key":"ref_33","unstructured":"Nascimento, M.A., \u00d6zsu, M.T., Kossmann, D., Miller, R.J., Blakeley, J.A., and Schiefer, K.B. (September, January 31). Top-k Query Evaluation with Probabilistic Guarantees. Proceedings of the Thirtieth International Conference on Very Large Data Bases, VLDB 2004, Toronto, ON, Canada."},{"key":"ref_34","first-page":"243","article-title":"Speeding Up the NRA Algorithm","volume":"Volume 5291","author":"Greco","year":"2008","journal-title":"Proceedings of the Scalable Uncertainty Management, Second International Conference, SUM 2008"},{"key":"ref_35","first-page":"15","article-title":"Selective-NRA Algorithms for Top-k Queries","volume":"Volume 5446","author":"Li","year":"2009","journal-title":"Proceedings of the Advances in Data and Web Management, Joint International Conferences, APWeb\/WAIM 2009"},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1007\/s10844-012-0208-5","article-title":"Efficient processing of top-k queries: Selective NRA algorithms","volume":"39","author":"Yuan","year":"2012","journal-title":"J. Intell. Inf. Syst."},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"Chen, L., Hwang, K., and Wu, J. (2012, January 21\u201325). MapReduce Skyline Query Processing with a New Angular Partitioning Approach. Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium Workshops & PhD Forum, IPDPS 2012, Shanghai, China.","DOI":"10.1109\/IPDPSW.2012.279"},{"key":"ref_38","unstructured":"Mullesgaard, K., Pederseny, J.L., Lu, H., and Zhou, Y. (2014, January 24\u201328). Efficient Skyline Computation in MapReduce. Proceedings of the 17th International Conference on Extending Database Technology, EDBT 2014, Athens, Greece."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"1996","DOI":"10.1109\/TPDS.2015.2472016","article-title":"Efficient Parallel Skyline Evaluation Using MapReduce","volume":"27","author":"Zhang","year":"2016","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/j.ins.2016.09.046","article-title":"MapReduce skyline query processing with partitioning and distributed dominance tests","volume":"375","author":"Koh","year":"2017","journal-title":"Inf. Sci."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"886","DOI":"10.1007\/s11227-017-2171-y","article-title":"An efficient parallel processing method for skyline queries in MapReduce","volume":"74","author":"Kim","year":"2018","journal-title":"J. Supercomput."},{"key":"ref_42","unstructured":"Markl, V., Orlando, S., Mitschang, B., Andritsos, P., Sattler, K., and Bre\u00df, S. (2017, January 21\u201324). Efficient Parallel Spatial Skyline Evaluation Using MapReduce. Proceedings of the 20th International Conference on Extending Database Technology, EDBT 2017, Venice, Italy."},{"key":"ref_43","unstructured":"Li, C., Gu, Y., Qi, J., and Yu, G. (2021). SkyCell: A Space-Pruning Based Parallel Skyline Algorithm. arXiv."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"1059","DOI":"10.1109\/TKDE.2008.235","article-title":"Efficient Skyline Computation in Structured Peer-to-Peer Systems","volume":"21","author":"Cui","year":"2009","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.is.2013.05.005","article-title":"Scalable skyline computation using a balanced pivot selection technique","volume":"39","author":"Lee","year":"2014","journal-title":"Inf. Syst."},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1007\/s10115-018-1256-0","article-title":"Ranking the big sky: Efficient top-k skyline computation on massive data","volume":"60","author":"Han","year":"2019","journal-title":"Knowl. Inf. Syst."},{"key":"ref_47","doi-asserted-by":"crossref","unstructured":"Song, B., Liu, A., and Ding, L. (2015, January 11\u201313). Efficient Top-k Skyline Computation in MapReduce. Proceedings of the 12th Web Information System and Application Conference, WISA 2015, Jinan, China.","DOI":"10.1109\/WISA.2015.57"},{"key":"ref_48","doi-asserted-by":"crossref","unstructured":"Liu, A. (2019, January 19\u201321). Top-k Skyline Result Optimization Algorithm in MapReduce. Proceedings of the 14th International Conference on Computer Science & Education, ICCSE 2019, Toronto, ON, Canada.","DOI":"10.1109\/ICCSE.2019.8845361"},{"key":"ref_49","unstructured":"Hasan, M.A., and Xiong, L. (2022, January 17\u201321). Parallel Skyline Processing Using Space Pruning on GPU. Proceedings of the 31st ACM International Conference on Information & Knowledge Management, Atlanta, GA, USA."},{"key":"ref_50","doi-asserted-by":"crossref","unstructured":"Tang, M., Yu, Y., Aref, W.G., Malluhi, Q.M., and Ouzzani, M. (2019, January 8\u201311). Efficient Parallel Skyline Query Processing for High-Dimensional Data. Proceedings of the 35th IEEE International Conference on Data Engineering, ICDE 2019, Macao, China.","DOI":"10.1109\/ICDE.2019.00251"},{"key":"ref_51","first-page":"3363","article-title":"LShape Partitioning: Parallel Skyline Query Processing Using MapReduce","volume":"34","author":"Wijayanto","year":"2022","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_52","unstructured":"Desai, B.C., Larriba-Pey, J.L., and Bernardino, J. (2013, January 9\u201311). Top-k join queries: Overcoming the curse of anti-correlation. Proceedings of the 17th International Database Engineering & Applications Symposium, IDEAS \u201913, Barcelona, Spain."},{"key":"ref_53","doi-asserted-by":"crossref","first-page":"352","DOI":"10.14778\/1920841.1920889","article-title":"Proximity Rank Join","volume":"3","author":"Martinenghi","year":"2010","journal-title":"Proc. VLDB Endow."},{"key":"ref_54","doi-asserted-by":"crossref","first-page":"2143","DOI":"10.1109\/TKDE.2011.161","article-title":"Cost-Aware Rank Join with Random and Sorted Access","volume":"24","author":"Martinenghi","year":"2012","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_55","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1109\/TKDE.2015.2460742","article-title":"Top-k Dominating Queries on Incomplete Data","volume":"28","author":"Miao","year":"2016","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_56","doi-asserted-by":"crossref","first-page":"13:1","DOI":"10.1145\/1386118.1386119","article-title":"Probabilistic top-k and ranking-aggregate queries","volume":"33","author":"Soliman","year":"2008","journal-title":"ACM Trans. Database Syst."},{"key":"ref_57","doi-asserted-by":"crossref","unstructured":"Liu, D., Wan, C., Xiong, N., Yang, L.T., and Chen, L. (July, January 29). Two Novel Semantics of Top-k Queries Processing in Uncertain Database. Proceedings of the 10th IEEE International Conference on Computer and Information Technology, CIT 2010, Bradford, UK.","DOI":"10.1109\/CIT.2010.130"},{"key":"ref_58","first-page":"660","article-title":"Top-k dominating queries in uncertain databases","volume":"Volume 360","author":"Kersten","year":"2009","journal-title":"Proceedings of the EDBT 2009, 12th International Conference on Extending Database Technology"},{"key":"ref_59","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1007\/s00778-010-0186-6","article-title":"Top-k queries on temporal data","volume":"19","author":"Li","year":"2010","journal-title":"VLDB J."},{"key":"ref_60","unstructured":"Rundensteiner, E.A., Markl, V., Manolescu, I., Amer-Yahia, S., Naumann, F., and Ari, I. (2012, January 27\u201330). Top-k spatial keyword queries on road networks. Proceedings of the 15th International Conference on Extending Database Technology, EDBT \u201912, Berlin, Germany. Proceedings."},{"key":"ref_61","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/j.ins.2015.04.032","article-title":"Top-k queries on RDF graphs","volume":"316","author":"Wang","year":"2015","journal-title":"Inf. Sci."},{"key":"ref_62","doi-asserted-by":"crossref","first-page":"1985","DOI":"10.14778\/3137765.3137826","article-title":"Geometric Approaches for Top-k Queries","volume":"10","author":"Mouratidis","year":"2017","journal-title":"Proc. VLDB Endow."},{"key":"ref_63","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/j.ins.2017.03.010","article-title":"CrowdK: Answering top-k queries with crowdsourcing","volume":"399","author":"Lee","year":"2017","journal-title":"Inf. Sci."},{"key":"ref_64","unstructured":"Li, F., Moro, M.M., Ghandeharizadeh, S., Haritsa, J.R., Weikum, G., Carey, M.J., Casati, F., Chang, E.Y., Manolescu, I., and Mehrotra, S. (2010, January 1\u20136). Reverse top-k queries. Proceedings of the 26th International Conference on Data Engineering, ICDE 2010, Long Beach, CA, USA."},{"key":"ref_65","doi-asserted-by":"crossref","unstructured":"Farazi, S., and Rafiei, D. (2019, January 8\u201311). Top-K Frequent Term Queries on Streaming Data. Proceedings of the 35th IEEE International Conference on Data Engineering, ICDE 2019, Macao, China.","DOI":"10.1109\/ICDE.2019.00147"},{"key":"ref_66","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/j.future.2024.03.011","article-title":"Lightweight verifiable blockchain top-k queries","volume":"156","author":"Cheng","year":"2024","journal-title":"Future Gener. Comput. Syst."},{"key":"ref_67","first-page":"504","article-title":"Privacy-Preserving Top-$k$k Spatial Keyword Queries in Fog-Based Cloud Computing","volume":"16","author":"Li","year":"2023","journal-title":"IEEE Trans. Serv. Comput."},{"key":"ref_68","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1391729.1391730","article-title":"A survey of top-k query processing techniques in relational database systems","volume":"40","author":"Ilyas","year":"2008","journal-title":"ACM Comput. Surv."},{"key":"ref_69","doi-asserted-by":"crossref","first-page":"866","DOI":"10.14778\/3204028.3204031","article-title":"Exact Processing of Uncertain Top-k Queries in Multi-criteria Settings","volume":"11","author":"Mouratidis","year":"2018","journal-title":"Proc. VLDB Endow."},{"key":"ref_70","doi-asserted-by":"crossref","unstructured":"Mouratidis, K., Li, K., and Tang, B. (2021, January 20\u201325). Marrying Top-k with Skyline Queries: Relaxing the Preference Input while Producing Output of Controllable Size. Proceedings of the SIGMOD \u201921: International Conference on Management of Data, Virtual Event, China.","DOI":"10.1145\/3448016.3457299"},{"key":"ref_71","doi-asserted-by":"crossref","first-page":"1114","DOI":"10.14778\/1920841.1920980","article-title":"Regret-Minimizing Representative Databases","volume":"3","author":"Nanongkai","year":"2010","journal-title":"Proc. VLDB Endow."},{"key":"ref_72","doi-asserted-by":"crossref","unstructured":"Soliman, M.A., Ilyas, I.F., Martinenghi, D., and Tagliasacchi, M. (2011, January 12\u201316). Ranking with uncertain scoring functions: Semantics and sensitivity measures. Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2011, Athens, Greece.","DOI":"10.1145\/1989323.1989408"},{"key":"ref_73","unstructured":"Halevy, A.Y., Ives, Z.G., and Doan, A. (2003, January 9\u201312). An Optimal and Progressive Algorithm for Skyline Queries. Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, San Diego, CA, USA."},{"key":"ref_74","unstructured":"Chirkova, R., Dogac, A., \u00d6zsu, M.T., and Sellis, T.K. (2007, January 15\u201320). Selecting Stars: The k Most Representative Skyline Operator. Proceedings of the 23rd International Conference on Data Engineering, ICDE 2007, Istanbul, Turkey."},{"key":"ref_75","unstructured":"Ioannidis, Y.E., Lee, D.L., and Ng, R.T. (April, January 29). Distance-Based Representative Skyline. Proceedings of the 25th International Conference on Data Engineering, ICDE 2009, Shanghai, China."},{"key":"ref_76","doi-asserted-by":"crossref","first-page":"1554","DOI":"10.14778\/2824032.2824053","article-title":"Maximum Rank Query","volume":"8","author":"Mouratidis","year":"2015","journal-title":"Proc. VLDB Endow."},{"key":"ref_77","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3698807","article-title":"Directional Queries: Making Top-k Queries More Effective in Discovering Relevant Results","volume":"2","author":"Ciaccia","year":"2024","journal-title":"Proc. ACM Manag. Data"},{"key":"ref_78","doi-asserted-by":"crossref","unstructured":"Masciari, E. (2009, January 26\u201328). Trajectory Clustering via Effective Partitioning. Proceedings of the Flexible Query Answering Systems, 8th International Conference, FQAS 2009, Roskilde, Denmark.","DOI":"10.1007\/978-3-642-04957-6_31"},{"key":"ref_79","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/j.ins.2013.12.003","article-title":"Analysing microarray expression data through effective clustering","volume":"262","author":"Masciari","year":"2014","journal-title":"Inf. Sci."},{"key":"ref_80","unstructured":"Desai, B.C., Sacc\u00e0, D., and Greco, S. (2009, January 16\u201318). Efficient and effective RFID data warehousing. Proceedings of the International Database Engineering and Applications Symposium (IDEAS 2009), Cetraro, Calabria, Italy. ACM International Conference Proceeding Series."},{"key":"ref_81","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/2487259.2487263","article-title":"RFID-data compression for supporting aggregate queries","volume":"38","author":"Fazzinga","year":"2013","journal-title":"ACM Trans. Database Syst."},{"key":"ref_82","doi-asserted-by":"crossref","unstructured":"Galli, L., Fraternali, P., Martinenghi, D., Tagliasacchi, M., and Novak, J. (2012, January 3\u20135). A Draw-and-Guess Game to Segment Images. Proceedings of the 2012 International Conference on Privacy, Security, Risk and Trust, PASSAT 2012, and 2012 International Confernece on Social Computing, SocialCom 2012, Amsterdam, The Netherlands.","DOI":"10.1109\/SocialCom-PASSAT.2012.139"},{"key":"ref_83","unstructured":"Griwodz, C. (March, January 27). Fashion-focused creative commons social dataset. Proceedings of the Multimedia Systems Conference 2013, MMSys \u201913, Oslo, Norway."},{"key":"ref_84","first-page":"42","article-title":"A Framework for Crowdsourced Multimedia Processing and Querying","volume":"Volume 842","author":"Bozzon","year":"2012","journal-title":"Proceedings of the First International Workshop on Crowdsourcing Web Search"},{"key":"ref_85","first-page":"76","article-title":"Querying Context-Aware Databases","volume":"Volume 5822","author":"Andreasen","year":"2009","journal-title":"Proceedings of the Flexible Query Answering Systems, 8th International Conference, FQAS 2009"},{"key":"ref_86","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1007\/s00778-012-0303-9","article-title":"Top-k queries over web applications","volume":"22","author":"Deutch","year":"2013","journal-title":"VLDB J."},{"key":"ref_87","unstructured":"Dembinski, P., and Maluszynski, J. (1985, January 15\u201318). AND-Parallelism with Intelligent Backtracking for Annotated Logic Programs. Proceedings of the 1985 Symposium on Logic Programming, Boston, MA, USA."},{"key":"ref_88","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1007\/s007780100054","article-title":"Answering Queries Using Views: A Survey","volume":"10","author":"Halevy","year":"2001","journal-title":"Very Large Database J."},{"key":"ref_89","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/S0022-0000(02)00028-4","article-title":"Query containment for data integration systems","volume":"66","author":"Millstein","year":"2003","journal-title":"J. Comput. Syst. Sci."},{"key":"ref_90","doi-asserted-by":"crossref","unstructured":"Florescu, D., Levy, A.Y., Manolescu, I., and Suciu, D. (1999, January 1\u20133). Query Optimization in the Presence of Limited Access Patterns. Proceedings of the ACM SIGMOD International Conference on Management of Data, Philadelphia, PA, USA.","DOI":"10.1145\/304182.304210"},{"key":"ref_91","unstructured":"Li, C., and Chang, E. (March, January 29). Query Planning with Limited Source Capabilities. Proceedings of the Sixteenth IEEE International Conference on Data Engineering (ICDE 2000), San Diego, CA, USA."},{"key":"ref_92","doi-asserted-by":"crossref","unstructured":"Li, C., and Chang, E. (2001, January 4\u20136). On Answering Queries in the Presence of Limited Access Patterns. Proceedings of the Eighth International Conference on Database Theory (ICDT 2001), London, UK.","DOI":"10.1007\/3-540-44503-X_15"},{"key":"ref_93","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1145\/502030.502032","article-title":"Answering Queries with Useful Bindings","volume":"26","author":"Li","year":"2001","journal-title":"ACM Trans. Database Syst."},{"key":"ref_94","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/s00778-002-0085-6","article-title":"Computing Complete Answers to Queries in the Presence of Limited Access Patterns","volume":"12","author":"Li","year":"2003","journal-title":"Very Large Database J."},{"key":"ref_95","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1007\/978-3-540-87877-3_24","article-title":"Conjunctive Query Containment under Access Limitations","volume":"Volume 5231","author":"Li","year":"2008","journal-title":"Proceedings of the Conceptual Modeling\u2014ER 2008, 27th International Conference on Conceptual Modeling"},{"key":"ref_96","unstructured":"Alonso, G., Blakeley, J.A., and Chen, A.L.P. (2008, January 7\u201312). Querying Data under Access Limitations. Proceedings of the 24th International Conference on Data Engineering, ICDE 2008, Canc\u00fan, Mexico."},{"key":"ref_97","first-page":"33","article-title":"Dynamic Query Optimization under Access Limitations and Dependencies","volume":"15","author":"Calvanese","year":"2009","journal-title":"J. Univ. Comput. Sci."},{"key":"ref_98","unstructured":"Duschka, O.M., and Levy, A.Y. (1997, January 23\u201329). Recursive Plans for Information Gathering. Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence (IJCAI\u201997), Nagoya, Japan."},{"key":"ref_99","doi-asserted-by":"crossref","unstructured":"Rajaraman, A., Sagiv, Y., and Ullman, J.D. (1995, January 22\u201325). Answering Queries Using Templates with Binding Patterns. Proceedings of the Fourteenth ACM SIGACT SIGMOD SIGART Symposium on Principles of Database Systems (PODS\u201995), San Jose, CA, USA.","DOI":"10.1145\/212433.220199"},{"key":"ref_100","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/j.tcs.2006.11.008","article-title":"Rewriting queries using views with access patterns under integrity constraints","volume":"371","author":"Deutsch","year":"2007","journal-title":"Theor. Comput. Sci."},{"key":"ref_101","doi-asserted-by":"crossref","unstructured":"Nash, A., and Lud\u00e4scher, B. (2004, January 14\u201316). Processing first-order queries under limited access patterns. Proceedings of the Twentythird ACM SIGACT SIGMOD SIGART Symposium on Principles of Database Systems (PODS 2004), Paris, France.","DOI":"10.1145\/1055558.1055601"},{"key":"ref_102","doi-asserted-by":"crossref","unstructured":"Lud\u00e4scher, B., and Nash, A. (2004, January 14\u201318). Processing union of conjunctive queries with negation under limited access patterns. Proceedings of the Ninth International Conference on Extending Database Technology (EDBT 2004), Heraklion, Crete, Greece.","DOI":"10.1007\/978-3-540-24741-8_25"},{"key":"ref_103","doi-asserted-by":"crossref","unstructured":"Yang, G., Kifer, M., and Chaudhri, V.K. (2006, January 26\u201328). Efficiently ordering subgoals with access constraints. Proceedings of the Twentyfifth ACM SIGACT SIGMOD SIGART Symposium on Principles of Database Systems (PODS 2006), Chicago, IL, USA.","DOI":"10.1145\/1142351.1142378"},{"key":"ref_104","first-page":"724","article-title":"Querying the deep web","volume":"Volume 426","author":"Manolescu","year":"2010","journal-title":"Proceedings of the EDBT 2010, 13th International Conference on Extending Database Technology"}],"container-title":["Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2306-5729\/10\/5\/76\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T17:33:18Z","timestamp":1760031198000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2306-5729\/10\/5\/76"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,15]]},"references-count":104,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2025,5]]}},"alternative-id":["data10050076"],"URL":"https:\/\/doi.org\/10.3390\/data10050076","relation":{},"ISSN":["2306-5729"],"issn-type":[{"type":"electronic","value":"2306-5729"}],"subject":[],"published":{"date-parts":[[2025,5,15]]}}}