Yilei Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Yilei Wang has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Ke Yi
Hong Kong University of Science and Technology, Hong Kong, China
3 shared publications - Floris Geerts
University of Antwerp, Antwerp, Belgium
2 shared publications - Qiuliang Xu
School of Software, Shandong University, Jinan, China
2 shared publications - Qiyao Luo
Hong Kong University of Science and Technology, Hong Kong, Hong Kong
2 shared publications - Fei Shan
Key Laboratory of Carcinogenesis and Translational Research (Ministry of Education), Department of Gastrointestinal Surgery, Peking University Cancer Hospital and Institute, Beijing, China
1 shared publication - Feifei Li
Alibaba Cloud, Hangzhou, China
1 shared publication
Latest Publications
- Open Access
- 12 May 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 4 (2) , 1-3
PACMMOD, V4, N2 (PODS), May 2026 Editorial
We are excited to announce the fifth issue dedicated to the Principles of Database Systems (PODS) research track of the Proceedings of the ACM on Management of Data (PACMMOD) journal. In its current form, the journal hosts a SIGMOD and a PODS research track. The PODS research track aims to provide a solid scientific basis for methods, techniques, and solutions for the data management challenges that continually arise in our data-driven society. Articles for the PODS track of PACMMOD present principled contributions to modeling, application, system building, and both theoretical and experimental validation in the context of data management. Such articles might be based, among others, on establishing theoretical results, developing new concepts and frameworks that deserve further exploration, providing experimental work that sheds light on the scientific foundations of the discipline, or conducting a rigorous analysis of industry artifacts that are widely used and/or recently developed. At a time when computer science is increasingly data-centric, it is essential to promote an active exchange of tools and techniques between principles of database systems and other communities focused on data management. The PODS research track thus pays special attention to articles that promote the integration of data management techniques within broader computer science.
- 12 May 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 4 (2) , 1-3
Open AccessPACMMOD, V4, N2 (PODS), May 2026 Editorial
We are excited to announce the fifth issue dedicated to the Principles of Database Systems (PODS) research track of the Proceedings of the ACM on Management of Data (PACMMOD) journal. In its current form, the journal hosts a SIGMOD and a PODS research track. The PODS research track aims to provide a solid scientific basis for methods, techniques, and solutions for the data management challenges that continually arise in our data-driven society. Articles for the PODS track of PACMMOD present principled contributions to modeling, application, system building, and both theoretical and experimental validation in the context of data management. Such articles might be based, among others, on establishing theoretical results, developing new concepts and frameworks that deserve further exploration, providing experimental work that sheds light on the scientific foundations of the discipline, or conducting a rigorous analysis of industry artifacts that are widely used and/or recently developed. At a time when computer science is increasingly data-centric, it is essential to promote an active exchange of tools and techniques between principles of database systems and other communities focused on data management. The PODS research track thus pays special attention to articles that promote the integration of data management techniques within broader computer science.
- Open Access
- 10 November 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 3 (5) , 1-3
PACMMOD V3, N5 (PODS), November 2025 Editorial
This editorial accompanies the third issue dedicated to the PODS research track of the Proceedings of the ACM on Management of Data (PACMMOD) journal. The journal hosts a SIGMOD and a PODS research track. The PODS research track aims to provide a solid scientific basis for methods, techniques, and solutions for the data management challenges that continually arise in our data-driven society. Articles for the PODS track of PACMMOD present principled contributions to modeling, application, system building, and both theoretical and experimental validation in the context of data management. Such articles might be based, among others, on establishing theoretical results, developing new concepts and frameworks that deserve further exploration, providing experimental work that sheds light on the scientific foundations of the discipline, or conducting a rigorous analysis of industry artifacts that are widely used and/or recently developed. Articles published in this track will be invited for presentation to the ACM Symposium on Principles of Database Systems (PODS), which is held jointly with SIGMOD each year.
- 10 November 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 3 (5) , 1-3
Open AccessPACMMOD V3, N5 (PODS), November 2025 Editorial
This editorial accompanies the third issue dedicated to the PODS research track of the Proceedings of the ACM on Management of Data (PACMMOD) journal. The journal hosts a SIGMOD and a PODS research track. The PODS research track aims to provide a solid scientific basis for methods, techniques, and solutions for the data management challenges that continually arise in our data-driven society. Articles for the PODS track of PACMMOD present principled contributions to modeling, application, system building, and both theoretical and experimental validation in the context of data management. Such articles might be based, among others, on establishing theoretical results, developing new concepts and frameworks that deserve further exploration, providing experimental work that sheds light on the scientific foundations of the discipline, or conducting a rigorous analysis of industry artifacts that are widely used and/or recently developed. Articles published in this track will be invited for presentation to the ACM Symposium on Principles of Database Systems (PODS), which is held jointly with SIGMOD each year.
- Open Access
- 29 May 2024
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 2 (3) , 1-27
Relational Algorithms for Top-k Query Evaluation
The evaluation of top-k conjunctive queries, a staple in business analysis, often requires evaluating the conjunctive query prior to filtering the top-k results, leading to a significant computational overhead within Database Management Systems (DBMSs). While efficient algorithms have been proposed, their integration into DBMSs remains arduous. We introduce relational algorithms, a paradigm where each algorithmic step is expressed by a relational operator. This allows the algorithm to be represented as a set of SQL queries, enabling easy deployment across different systems that support SQL. We introduce two novel relational algorithms, level-k and product-k, specifically designed for evaluating top-k conjunctive queries and demonstrate that level-k achieves optimal running time for top-k free-connex queries. Furthermore, these algorithms enable easy translation into an oblivious algorithm for secure query evaluations. The presented algorithms are not only theoretically optimal but also exhibit eminent efficiency in practice. The experiment results show significant improvements, with our rewritten SQL outperforming the baseline by up to 6 orders of magnitude. Moreover, our secure implementations not only achieve substantial speedup compared to the baseline with secure guarantees but even surpass those baselines that have no secure guarantees.
- 29 May 2024
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 2 (3) , 1-27
Open AccessRelational Algorithms for Top-k Query Evaluation
The evaluation of top-k conjunctive queries, a staple in business analysis, often requires evaluating the conjunctive query prior to filtering the top-k results, leading to a significant computational overhead within Database Management Systems (DBMSs). While efficient algorithms have been proposed, their integration into DBMSs remains arduous. We introduce relational algorithms, a paradigm where each algorithmic step is expressed by a relational operator. This allows the algorithm to be represented as a set of SQL queries, enabling easy deployment across different systems that support SQL. We introduce two novel relational algorithms, level-k and product-k, specifically designed for evaluating top-k conjunctive queries and demonstrate that level-k achieves optimal running time for top-k free-connex queries. Furthermore, these algorithms enable easy translation into an oblivious algorithm for secure query evaluations. The presented algorithms are not only theoretically optimal but also exhibit eminent efficiency in practice. The experiment results show significant improvements, with our rewritten SQL outperforming the baseline by up to 6 orders of magnitude. Moreover, our secure implementations not only achieve substantial speedup compared to the baseline with secure guarantees but even surpass those baselines that have no secure guarantees.
- Open Access
- 13 November 2023
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 1 (3) , 1-27
Secure Sampling for Approximate Multi-party Query Processing
We study the problem of random sampling in the secure multi-party computation (MPC) model. In MPC, taking a sample securely must have a cost Ω(n) irrespective to the sample size s. This is in stark contrast with the plaintext setting, where a sample can be taken in O(s) time trivially. Thus, the goal of approximate query processing (AQP) with sublinear costs seems unachievable under MPC. To get around this inherent barrier, in this paper we take a two-stage approach: In the offline stage, we generate a batch of n/s samples with (n) total cost, which can then be consumed to answer queries as they arrive online. Such an approach allows us to achieve an Õ(s) amortized cost per query, similar to the plaintext setting. Based on our secure batch sampling algorithms, we build MASQUE, an MPC-AQP system that achieves sublinear online query costs by running an MPC protocol to evaluate the queries on pre-generated samples. MASQUE achieves the strong security guarantee of the MPC model, i.e., nothing is revealed beyond the query result, which itself can be further protected by (amplified) differential privacy
- 13 November 2023
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 1 (3) , 1-27
Open AccessSecure Sampling for Approximate Multi-party Query Processing
We study the problem of random sampling in the secure multi-party computation (MPC) model. In MPC, taking a sample securely must have a cost Ω(n) irrespective to the sample size s. This is in stark contrast with the plaintext setting, where a sample can be taken in O(s) time trivially. Thus, the goal of approximate query processing (AQP) with sublinear costs seems unachievable under MPC. To get around this inherent barrier, in this paper we take a two-stage approach: In the offline stage, we generate a batch of n/s samples with (n) total cost, which can then be consumed to answer queries as they arrive online. Such an approach allows us to achieve an Õ(s) amortized cost per query, similar to the plaintext setting. Based on our secure batch sampling algorithms, we build MASQUE, an MPC-AQP system that achieves sublinear online query costs by running an MPC protocol to evaluate the queries on pre-generated samples. MASQUE achieves the strong security guarantee of the MPC model, i.e., nothing is revealed beyond the query result, which itself can be further protected by (amplified) differential privacy
- 11 November 2022
- Published by SPIE-Intl Soc Optical Eng
- Vol. 12348, 117-124
An equipment fault diagnosis method based on fuzzy support vector machine
When the fuzzy factors is in the sample or noise around the classification surface which is the decisive factor for the summary of support vector machines (SVM), the operation results of SVM will be greatly affected. In this case, the noise must be effectively removed to minimize the impact on the sample. Here, the method of “one class to the rest class” is used to establish fault classifier, and a decision algorithm combining binary tree with fuzzy support vector machine is proposed. In this algorithm, the noise points near the classification surface in the samples are removed by SDWFCM (Spacial distance weighted fuzzy C-Means) method firstly. Then, based on the fuzzy feature representation method, the fuzzy support vector machine is improved by combining the fuzzy membership degree determination method and the basis of the threshold determination after fuzzy programming. The support vector machine can effectively process the composite samples of mixed fuzzy samples, in order to accomplish the fault diagnosis of a certain type of equipment.
- 11 November 2022
- Published by SPIE-Intl Soc Optical Eng
- Vol. 12348, 117-124
An equipment fault diagnosis method based on fuzzy support vector machine
When the fuzzy factors is in the sample or noise around the classification surface which is the decisive factor for the summary of support vector machines (SVM), the operation results of SVM will be greatly affected. In this case, the noise must be effectively removed to minimize the impact on the sample. Here, the method of “one class to the rest class” is used to establish fault classifier, and a decision algorithm combining binary tree with fuzzy support vector machine is proposed. In this algorithm, the noise points near the classification surface in the samples are removed by SDWFCM (Spacial distance weighted fuzzy C-Means) method firstly. Then, based on the fuzzy feature representation method, the fuzzy support vector machine is improved by combining the fuzzy membership degree determination method and the basis of the threshold determination after fuzzy programming. The support vector machine can effectively process the composite samples of mixed fuzzy samples, in order to accomplish the fault diagnosis of a certain type of equipment.
- 3 July 2015
- Published by Springer Nature in Journal of Ambient Intelligence and Humanized Computing
- Vol. 6 (6) , 807-824
A brief survey on secure multi-party computing in the presence of rational parties
- 3 July 2015
- Published by Springer Nature in Journal of Ambient Intelligence and Humanized Computing
- Vol. 6 (6) , 807-824
A brief survey on secure multi-party computing in the presence of rational parties
- 1 January 2012
- Published by Inderscience Publishers in International Journal of Grid and Utility Computing
- Vol. 3 (1) , 12
Repeated rational secret sharing, revisited
Rational Secret Sharing Scheme (RSSS) disposes the dilemma that several selfish players come together and willingly pool their shares to reconstruct a secret without a compulsory execution measure, while cooperation is not a strict optimisation. This paper introduces four punishment strategies and expands the perfect conclusions in infinitely repeated RSSS to show that cooperation will recur by means of some strategies. For finitely repeated RSSS, this paper verifies that there is no way for players to cooperate under perfect and complete information for backward induction. To overcome this difficulty, this paper relaxes conditions such as the types of players and the randomised strategies. It is proved that, given the different types and incomplete information, players will insist on cooperation in finitely repeated RSSS. In addition, we discuss repeated games in an extensive form and propose a 2-out-of-2 RSSS.
- 1 January 2012
- Published by Inderscience Publishers in International Journal of Grid and Utility Computing
- Vol. 3 (1) , 12
Repeated rational secret sharing, revisited
Rational Secret Sharing Scheme (RSSS) disposes the dilemma that several selfish players come together and willingly pool their shares to reconstruct a secret without a compulsory execution measure, while cooperation is not a strict optimisation. This paper introduces four punishment strategies and expands the perfect conclusions in infinitely repeated RSSS to show that cooperation will recur by means of some strategies. For finitely repeated RSSS, this paper verifies that there is no way for players to cooperate under perfect and complete information for backward induction. To overcome this difficulty, this paper relaxes conditions such as the types of players and the randomised strategies. It is proved that, given the different types and incomplete information, players will insist on cooperation in finitely repeated RSSS. In addition, we discuss repeated games in an extensive form and propose a 2-out-of-2 RSSS.