Jiadong Xie

Jiadong Xie

orcid

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
19 June 2021 in World Wide Web
Verified
Journal Article
Closed access
PDF file
FZFan Zhang
Fan Zhang
JXJiadong Xie
Jiadong Xie
KWKai Wang
Kai Wang
SYShiyu Yang
Shiyu Yang
YJYu Jiang
Yu Jiang

30 June 2025 in ACM Transactions on Database Systems
Verified
Journal Article
Open access
JXJiadong Xie
Jiadong Xie
JYJeffrey Xu Yu
Jeffrey Xu Yu
YLYingfan Liu
Yingfan Liu
The problem of k -nearest neighbor ( k -NN) search is a fundamental problem to find the exact k nearest neighbor points for a user-given query point q in a d -dimensional large dataset D with n points, and the approximate k -NN ( k -ANN) search problem is to find the approximate k -NN. Both are extensively studied to support real applications. Among all approaches, the graph-based approaches have been seen as the best to support k -NN/ANN in recent studies. The state-of-the-art graph-based approach, τ-MG, finds 1-NN, \(\bar{p}_1\) , over a graph index G τ constructed for D based on a predetermined parameter τ where the distance between \(\bar{p}_1\) and q is less than τ, and finds k -ANN based on the approach taken for 1-NN. There are some main issues in τ-MG and other graph-based approaches. One is that it is difficult to predetermine τ which can ensure to find 1-NN and can do it efficiently. This is because the accuracy/efficiency is related to the size of the graph index G τ constructed. To achieve high accuracy is at the expense of efficiency. In addition, like all the other existing graph-based approaches, it does not have a theoretical guarantee to ensure k -NN for the same reason to use the same graph index, G τ , for both 1-NN and k -NN ( k > 1). In this article, we propose a new graph-based approach for k -NN with a theoretical guarantee. We construct a labeled graph, \(\mathcal {G}\) , and we do not need to predetermine τ. Instead, we find 1-NN over a subgraph, \(\mathcal {G}_{\dot{\tau }}\) , of \(\mathcal {G}\) , virtually constructed in a dynamic manner. Here, \(\dot{\tau }\) we use is query-dependent and can be smaller than τ, and the subgraph \(\mathcal {G}_{\dot{\tau }}\) is smaller than G τ when \(\dot{\tau }= \tau\) . We find k -NN in two phases. In the navigation phase, we find 1-NN, \(\bar{p}_1\) , of q over \(\mathcal {G}_{\dot{\tau }}\) . In the second refinement phase, for k > 1, we explore the neighbors within the vicinity region of \(\bar{p}_1\) in \(\mathcal {G}\) . Based on our solution for k -NN in theory, we propose new algorithms to support k -ANN efficiently in practice. We conduct extensive performance studies and confirm the effectiveness and efficiency of our new approach.

17 June 2025 in Proceedings of the ACM on Management of Data
Verified
Journal Article
Open access
JXJiadong Xie
Jiadong Xie
JYJeffrey Xu Yu
Jeffrey Xu Yu
YLYingfan Liu
Yingfan Liu
Recent advancements in deep learning, particularly in embedding models, have enabled the effective representation of various data types such as text, images, and audio as vectors, thereby facilitating semantic analysis. A large number of massive vector datasets are maintained in vector databases. Approximate similarity join is a core operation in vector database systems that joins two datasets, and outputs all pairs of vectors from the two datasets, if the distance between such a pair of two vectors is no more than a specified value. Existing approaches for similarity join are selection-based such that they treat each data point in a dataset as an individual query point to search data points by an approximate range query in another dataset. Such methods do not fully capitalize on the inherent properties of the join operation itself. In this paper, we propose a new join algorithm, SimJoin. Our join algorithm aims at boosting join processing efficiency by leveraging relationships between partial join results (e.g., join windows). In brief, our join algorithm accelerates the join processing to process a join window by utilizing the join windows from the processed data points. Then, we discuss optimizing join window order to minimize join costs. In addition, we discuss how to support k -similarity join, and how to maintain proximity graph index based on k-similarity join. Extensive experiments on real-world and synthetic datasets demonstrate the significant performance superiority of our proposed algorithms over existing state-of-the-art methods.

4 August 2023
Verified
Conference Paper
Open access
FZFan Zhang
Fan Zhang
QLQingyuan Linghu
Qingyuan Linghu
JXJiadong Xie
Jiadong Xie
KWKai Wang
Kai Wang
XLXuemin Lin
Xuemin Lin
Wenjie ZhangWenjie Zhang
Wenjie Zhang
Quantifying node importance on engagement dynamics is critical to support network stability. We can motivate or retain the users in a social platform according to their importance s.t. the network is more sustainable. Existing studies validate that the coreness of a node is the "best practice" on network topology to estimate the engagement of the node. In this paper, the importance of a node is the effect on the engagement of other nodes when its engagement is strengthened or weakened. Specifically, the importance of a node is quantified via two novel concepts: the anchor power to measure the engagement effect of node strengthening (i.e., the overall coreness gain) and the collapse power to measure the engagement effect of node weakening (i.e., the overall coreness loss). We find the computation of the two concepts can be naturally integrated into a shell component-based framework, and propose a unified static algorithm to compute both the anchored and collapsed followers. For evolving networks, efficient maintenance techniques are designed to update the follower sets of each node, which is faster than redoing the static algorithm by around 3 orders of magnitude. Extensive experiments on real-life data demonstrate the effectiveness of our model and the efficiency of our algorithms.


1 November 2025 in INFORMS Journal on Computing
Verified
Journal Article
Closed access
JXJiadong Xie
Jiadong Xie
FZFan Zhang
Fan Zhang
KWKai Wang
Kai Wang
JLJialu Liu
Jialu Liu
XLXuemin Lin
Xuemin Lin
Wenjie ZhangWenjie Zhang
Wenjie Zhang
We study the influence minimization problem: given a graph G and a seed set S, blocking at most b nodes or b edges such that the influence spread of seed set is minimized. This is a pivotal yet underexplored aspect of network analytics, which can limit the spread of undesirable phenomena in networks, such as misinformation and epidemics. Given the inherent NP-hardness of the problem under the independent cascade and linear threshold models, previous studies have employed greedy algorithms and Monte Carlo Simulations for its resolution. However, existing techniques become cost-prohibitive when applied to large networks due to the necessity of enumerating all the candidate blockers and computing the decrease in expected spread from blocking each of them. This significantly restricts the practicality and effectiveness of existing methods, especially when prompt decision making is crucial. In this paper, we propose the AdvancedGreedy algorithm, which utilizes a novel graph sampling technique that incorporates the dominator tree structure. We find that AdvancedGreedy can achieve a [ ]-approximation in the problem under the linear threshold model. For the problem under the independent cascade model, we further propose a novel heuristic algorithm GreedyReplace, based on identifying the relationships among candidate blockers. Experimental evaluations on real-life networks reveal that our proposed algorithms exhibit a significant enhancement in efficiency, surpassing the state-of-the-art algorithm by three orders of magnitude while achieving high effectiveness. History: Accepted by Erwin Pesch, Area Editor for Heuristic Search & Approximation Algorithms. Funding: K. Wang was supported by the National Natural Science Foundation of China [Grants 72221001 and 62302294]. J. Liu was supported by the National Natural Science Foundation of China [Grants 72221001 and 72402127] and Shanghai Pujiang Program [Grant 23PJC059]. F. Zhang was supported by the Guangdong Basic and Applied Basic Research Foundation [Grants 2023A1515012603 and 2024A1515011501]. W. Zhang was supported by the Australian Research Council [Grant FT210100303]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2024.0591 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2024.0591 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .