Modern organizations collect increasing volumes of data to drive decision-making, often stored in centralized repositories such as data lakes, which consist of diverse structured and unstructured datasets. However, these repositories often suffer from issues such as incomplete, inconsistent, and low-quality data, which hinder data-driven insights. Existing methods for data imputation, including statistical techniques and machine learning approaches, often rely heavily on large amounts of labeled data and domain-specific knowledge, making them labor-intensive and limited in handling semantic heterogeneity across data formats. To address these challenges, this study proposes a novel retrieval-augmented generation (RAG) framework for data imputation that effectively combines the strengths of retrieval mechanisms and large language models (LLMs). This approach constructs semantic-based indexes for heterogeneous data, employs a recall and re-ranking strategy to enhance retrieval relevance, and proposes a method to reduce inference cost while ensuring imputation quality. Extensive experiments on real-world datasets demonstrate that the proposed framework significantly outperforms machine learning and deep learning approaches.
Cohesive subgraph mining is a fundamental problem in the field of graph data analysis. Many existing cohesive graph mining algorithms are mainly tailored to deterministic graphs. Real-world graphs, however, are often not deterministic, but uncertain in nature. Applications of such uncertain graphs include protein-protein interactions networks with experimentally inferred links and sensor networks with uncertain connectivity links. In this paper, we study the problem of mining cohesive subgraphs from an uncertain graph. Specifically, we introduce a new $(\alpha,\gamma)$ -quasi-clique model to model the cohesive subgraphs in an uncertain graph, and propose a basic enumeration algorithm to find all maximal $(\alpha,\gamma)$ -quasi-cliques. We also develop an advanced enumeration algorithm based on several novel pruning rules, including early termination and candidate set reduction. To further improve the efficiency, we propose several optimization techniques. The results of extensive experiments on five real-world datasets demonstrate the efficiency and effectiveness of the proposed algorithms.
As data volumes grow and business requirements become increasingly complex, Hybrid Transactional/Analytical Processing (HTAP) technologies, capable of handling both Online Transaction Processing (OLTP) and Online Analytical Processing (OLAP) workloads on a single platform, have gained prominence. HTAP databases typically maintain dual data storage formats and dual query engines: one row-oriented for OLTP, and another column-oriented for OLAP. Query plans, known as hybrid plans, can be segmented and pushed down to execute on these different formats. However, existing HTAP solutions still face challenges in optimizing these hybrid plans, struggling to explore the vast space of potential execution strategies effectively. To address these issues, this study introduces a learning-based query optimizer for row–column dual store HTAP database systems, which automatically generates multiple high-quality query optimizer hints (HINTs) to derive candidate plans. To balance plan generation efficiency with plan quality, a lightweight, learning-based algorithm using Monte Carlo Tree Search (MCTS) for generating hybrid access HINTs is proposed. Moreover, a Transformer-based neural network model coupled with a hybrid plan feature representation method is developed to select the candidate execution plan with the lowest predicted execution time. This work focuses on latency-oriented hybrid-plan selection for analytical queries in a row–column dual-store HTAP architecture; the current evaluation does not cover full mixed OLTP/OLAP workload scheduling, transactional interference, or concurrency control, which are left as future work. Experimental results on AlloyDB Omni, a recent row–column dual-store HTAP database, using the real-world IMDB dataset and JOB benchmark demonstrate that our system reduces execution time by 75.02% compared to the Cost-Based Optimizer (CBO) and by 62.23% compared to the state-of-the-art row-store-based learning query optimizer in this evaluated analytical-query setting.
4 December 2025 in Proceedings of the ACM on Management of Data
Identifying the maximum edge biclique in bipartite graphs, a complete bipartite subgraph with the largest number of edges, plays a crucial role in uncovering densely-connected communities and has significant applications in domains such as recommendation systems and biological network analysis. However, this problem is NP-hard, and existing methods face inefficiencies both in practice and theory. In this paper, we propose two novel algorithms with distinct branching strategies and provable time guarantees for solving the maximum edge biclique search problem. The first is a refined pivot-based branching algorithm that systematically exploits vertex adjacency relationships to bound the search for the maximum edge biclique, achieving a time complexity of O ( m 1.348 n ). The second is a cover-based algorithm that uncovers a novel duality between maximal bicliques and minimal vertex covers in bipartite graphs, attaining a complexity of O ( m 1.381 n ). To the best of our knowledge, these two algorithms achieve the best-known worst-case time complexities for this problem. Notably, while the cover-based algorithm has a marginally higher theoretical complexity, it typically provides superior practical performance on dense graphs due to its inherent pruning efficiency. To further enhance performance, we introduce advanced pruning techniques, including polynomial-time solvable graph cases, neighbor and non-neighbor constraint-based upper bounds, vertex cover constraint-driven upper bounds, heuristic prioritization, and an improved progressive bounding approach. Additionally, we propose a hybrid framework that deploys the pivot-based approach for sparse graph regions and the cover-based approach for dense regions, balancing efficiency across varying graph structures. Extensive experiments on 12 real-world bipartite graphs demonstrate that our hybrid framework outperforms the state-of-the-art baseline by up to four orders of magnitude and achieves speedups of several times to orders of magnitude over the pivot-based approach on dense graphs.
Data has become a foundational asset driving innovation across domains such as finance, healthcare, and e-commerce. In these areas, predictive modeling over relational tables is commonly employed, with increasing emphasis on reducing manual effort through automated machine learning (AutoML) techniques. This raises an interesting question: can feature augmentation itself be automated and identify and utilize task-related relational signals? To address this challenge, we propose an end-to-end automated feature augmentation framework, ReCoGNN, which enhances initial datasets using features extracted from multiple relational tables to support predictive tasks. ReCoGNN first captures semantic dependencies within each table by modeling intra-table attribute relationships, enabling it to partition tables into structured, semantically coherent segments. It then constructs a heterogeneous weighted graph that represents inter-row relationships across all segments. Finally, ReCoGNN leverages message-passing graph neural networks to propagate information through the graph, guiding feature selection and augmenting the original dataset. Extensive experiments conducted on ten real-life and synthetic datasets demonstrate that ReCoGNN consistently outperforms existing methods on both classification and regression tasks.