Qichen Wang

Orcid: 0000-0002-0959-5536

Affiliations:
  • Nanyang Technological University, Singapore
  • Hong Kong Baptist University, Hong Kong (former)
  • Hong Kong University of Science and Technology, Hong Kong (former)


According to our database1, Qichen Wang authored at least 17 papers between 2018 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Succinct Structure Representations for Efficient Query Optimization.
CoRR, March, 2026

Size Bound-Adorned Datalog.
CoRR, March, 2026

Towards Parameterized Hardness on Maintaining Conjunctive Queries.
CoRR, March, 2026

Database Theory in Action: Yannakakis' Algorithm.
Proceedings of the 29th International Conference on Database Theory, 2026

2025
Query running too slow? Rewrite it with Quorion!
Proc. VLDB Endow., August, 2025

Yannakakis+: Practical Acyclic Query Evaluation with Theoretical Guarantees.
Proc. ACM Manag. Data, June, 2025

Towards Update-Dependent Analysis of Query Maintenance.
Proc. ACM Manag. Data, May, 2025

2024
FedKNN: Secure Federated k-Nearest Neighbor Search.
Proc. ACM Manag. Data, February, 2024

Relational Algorithms for Top-k Query Evaluation.
Proc. ACM Manag. Data, 2024

Effective Clustering on Large Attributed Bipartite Graphs.
Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2024

2023
Change Propagation Without Joins.
Proc. VLDB Endow., 2023

Computing the Difference of Conjunctive Queries Efficiently.
Proc. ACM Manag. Data, 2023

SparkSQL+: Next-generation Query Planning over Spark.
Proceedings of the Companion of the 2023 International Conference on Management of Data, 2023

2022
Conjunctive Queries with Comparisons.
Proceedings of the SIGMOD '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

2021
Cquirrel: Continuous Query Processing over Acyclic Relational Schemas.
Proc. VLDB Endow., 2021

2020
Maintaining Acyclic Foreign-Key Joins under Updates.
Proceedings of the 2020 International Conference on Management of Data, 2020

2018
Efficient Computation of a Near-Maximum Independent Set over Evolving Graphs.
Proceedings of the 34th IEEE International Conference on Data Engineering, 2018


  Loading...