arXiv subjects

Guoliang Li

Publications and source records attributed to Guoliang Li.

At least 91 records · Page 5Linked to original sources

arXiv2025

The Cambridge Report on Database Research

On October 19 and 20, 2023, the authors of this report convened in Cambridge, MA, to discuss the state of the database research field, its recent accomplishments and ongoing challenges, and future directions for research and community engagement. This gathering continues a long standing tradition in the database community, dating back to the late 1980s, in which researchers meet roughly every five years to produce a forward looking report. This report summarizes the key takeaways from our discussions. We begin with a retrospective on the academic, open source, and commercial successes of the community over the past five years. We then turn to future opportunities, with a focus on core data systems, particularly in the context of cloud computing and emerging hardware, as well as on the growing impact of data science, data governance, and generative AI. This document is not intended as an exhaustive survey of all technical challenges or industry innovations in the field. Rather, it reflects the perspectives of senior community members on the most pressing challenges and promising opportunities ahead.

cs.DB↗

arXiv2025

FeatInsight: An Online ML Feature Management System on 4Paradigm Sage-Studio Platform

Feature management is essential for many online machine learning applications and can often become the performance bottleneck (e.g., taking up to 70% of the overall latency in sales prediction service). Improper feature configurations (e.g., introducing too many irrelevant features) can severely undermine the model's generalization capabilities. However, managing online ML features is challenging due to (1) large-scale, complex raw data (e.g., the 2018 PHM dataset contains 17 tables and dozens to hundreds of columns), (2) the need for high-performance, consistent computation of interdependent features with complex patterns, and (3) the requirement for rapid updates and deployments to accommodate real-time data changes. In this demo, we present FeatInsight, a system that supports the entire feature lifecycle, including feature design, storage, visualization, computation, verification, and lineage management. FeatInsight (with OpenMLDB as the execution engine) has been deployed in over 100 real-world scenarios on 4Paradigm's Sage Studio platform, handling up to a trillion-dimensional feature space and enabling millisecond-level feature updates. We demonstrate how FeatInsight enhances feature design efficiency (e.g., for online product recommendation) and improve feature computation performance (e.g., for online fraud detection). The code is available at https://github.com/4paradigm/FeatInsight.

cs.DB↗

arXiv2025

CrackSQL: A Hybrid SQL Dialect Translation System Powered by Large Language Models

Dialect translation plays a key role in enabling seamless interaction across heterogeneous database systems. However, translating SQL queries between different dialects (e.g., from PostgreSQL to MySQL) remains a challenging task due to syntactic discrepancies and subtle semantic variations. Existing approaches including manual rewriting, rule-based systems, and large language model (LLM)-based techniques often involve high maintenance effort (e.g., crafting custom translation rules) or produce unreliable results (e.g., LLM generates non-existent functions), especially when handling complex queries. In this demonstration, we present CrackSQL, the first hybrid SQL dialect translation system that combines rule and LLM-based methods to overcome these limitations. CrackSQL leverages the adaptability of LLMs to minimize manual intervention, while enhancing translation accuracy by segmenting lengthy complex SQL via functionality-based query processing. To further improve robustness, it incorporates a novel cross-dialect syntax embedding model for precise syntax alignment, as well as an adaptive local-to-global translation strategy that effectively resolves interdependent query operations. CrackSQL supports three translation modes and offers multiple deployment and access options including a web console interface, a PyPI package, and a command-line prompt, facilitating adoption across a variety of real-world use cases

cs.DB↗

arXiv2025

AnDB: Breaking Boundaries with an AI-Native Database for Universal Semantic Analysis

In this demonstration, we present AnDB, an AI-native database that supports traditional OLTP workloads and innovative AI-driven tasks, enabling unified semantic analysis across structured and unstructured data. While structured data analytics is mature, challenges remain in bridging the semantic gap between user queries and unstructured data. AnDB addresses these issues by leveraging cutting-edge AI-native technologies, allowing users to perform semantic queries using intuitive SQL-like statements without requiring AI expertise. This approach eliminates the ambiguity of traditional text-to-SQL systems and provides a seamless end-to-end optimization for analyzing all data types. AnDB automates query processing by generating multiple execution plans and selecting the optimal one through its optimizer, which balances accuracy, execution time, and financial cost based on user policies and internal optimizing mechanisms. AnDB future-proofs data management infrastructure, empowering users to effectively and efficiently harness the full potential of all kinds of data without starting from scratch.

cs.DB↗

arXiv2025

A Topology-Aware Localized Update Strategy for Graph-Based ANN Index

The graph-based index has been widely adopted to meet the demand for approximate nearest neighbor search (ANNS) for high-dimensional vectors. However, in dynamic scenarios involving frequent vector insertions and deletions, existing systems improve update throughput by adopting a batch update method. However, a large batch size leads to significant degradation in search accuracy. This work aims to improve the performance of graph-based ANNS systems in small-batch update scenarios, while maintaining high search efficiency and accuracy. We identify two key issues in existing batch update systems for small-batch updates. First, the system needs to scan the entire index file to identify and update the affected vertices, resulting in excessive unnecessary I/O. Second, updating the affected vertices introduces many new neighbors, frequently triggering neighbor pruning. To address these issues, we propose a topology-aware localized update strategy for graph-based ANN index. We introduce a lightweight index topology to identify affected vertices efficiently and employ a localized update strategy that modifies only the affected vertices in the index file. To mitigate frequent heavy neighbor pruning, we propose a similar neighbor replacement strategy, which connects the affected vertices to only a small number (typically one) of the most similar outgoing neighbors of the deleted vertex during repair. Based on extensive experiments on real-world datasets, our update strategy achieves 2.47X-6.45X higher update throughput than the state-of-the-art system FreshDiskANN while maintaining high search efficiency and accuracy.

cs.DB↗

arXiv2025

The Magnified Waltz: Simulating Light Curves of Binary Stars Passing through Micro-Caustics in Strong Lensing Galaxy Clusters

Individual stars located near the caustics of galaxy clusters can undergo extreme magnification when crossing micro-caustics, rendering them observable even at cosmological distances. Though most massive stars are likely reside in binary systems rather than as single star, the influence of binary star system on magnification events is severely under-explored. In this work, we simulate the light curves produced by detached binary stars crossing micro-caustics, aiming to characterize their unique observational signatures.Using high-resolution magnification maps generated by the GPU-PMO-CAUSTIC algorithm and PARSEC stellar models with red-shifted magnitude, we examined the impact of binary star parameters and crossing geometries on microlensing magnification patterns. Our simulations reveal that binary stars produce diverse light curve features, including overlapping peaks, plateau-like structures, and time-variable color-magnitude differences. These features, particularly the distinct temporal variations in spectral energy distributions, offer diagnostic tools for distinguishing binary systems from single stars.We further demonstrate the potential of multi-band photometry using the Chinese Space Station Telescope's Multi-Channel Imager (CSST-MCI) to capture these variations.Our findings provide theoretical support for identifying binary systems in future caustic-crossing events, enabling more accurate characterization of high-redshift stellar populations.

astro-ph.GA↗

arXiv2025

Graph Neural Networks for Databases: A Survey

Graph neural networks (GNNs) are powerful deep learning models for graph-structured data, demonstrating remarkable success across diverse domains. Recently, the database (DB) community has increasingly recognized the potentiality of GNNs, prompting a surge of researches focusing on improving database systems through GNN-based approaches. However, despite notable advances, There is a lack of a comprehensive review and understanding of how GNNs could improve DB systems. Therefore, this survey aims to bridge this gap by providing a structured and in-depth overview of GNNs for DB systems. Specifically, we propose a new taxonomy that classifies existing methods into two key categories: (1) Relational Databases, which includes tasks like performance prediction, query optimization, and text-to-SQL, and (2) Graph Databases, addressing challenges like efficient graph query processing and graph similarity computation. We systematically review key methods in each category, highlighting their contributions and practical implications. Finally, we suggest promising avenues for integrating GNNs into Database systems.

cs.DB↗

arXiv2025

OpenMLDB: A Real-Time Relational Data Feature Computation System for Online ML

Efficient and consistent feature computation is crucial for a wide range of online ML applications. Typically, feature computation is divided into two distinct phases, i.e., offline stage for model training and online stage for model serving. These phases often rely on execution engines with different interface languages and function implementations, causing significant inconsistencies. Moreover, many online ML features involve complex time-series computations (e.g., functions over varied-length table windows) that differ from standard streaming and analytical queries. Existing data processing systems (e.g., Spark, Flink, DuckDB) often incur multi-second latencies for these computations, making them unsuitable for real-time online ML applications that demand timely feature updates. This paper presents OpenMLDB, a feature computation system deployed in 4Paradigm's SageOne platform and over 100 real scenarios. Technically, OpenMLDB first employs a unified query plan generator for consistent computation results across the offline and online stages, significantly reducing feature deployment overhead. Second, OpenMLDB provides an online execution engine that resolves performance bottlenecks caused by long window computations (via pre-aggregation) and multi-table window unions (via data self-adjusting). It also provides a high-performance offline execution engine with window parallel optimization and time-aware data skew resolving. Third, OpenMLDB features a compact data format and stream-focused indexing to maximize memory usage and accelerate data access. Evaluations in testing and real workloads reveal significant performance improvements and resource savings compared to the baseline systems. The open community of OpenMLDB now has over 150 contributors and gained 1.6k stars on GitHub.

cs.DB↗

arXiv2025

Discovery of 19 strongly-lensed quasars, dual and projected quasars in DESI-LS

We report the follow-up spectroscopic confirmation of two lensed quasars, six dual quasars, and eleven projected quasars that were previously identified as lensed-quasar candidates in \cite{He2023}. The spectroscopic data were obtained from two different sources: the P200/DBSP in California and publicly available datasets, including SDSS and DESI-EDR. The two lensed quasars (both pairs) have the following properties: $θ_E$ = 1.208'', $z_s$ = 3.105; $θ_E$ = 0.749, $z_s$ = 2.395. The six dual quasars have redshifts ranging from 0.58 to 3.28 and projected separations ranging from 15.44 to 22.54 kpc, with a mean separation of 17.95 kpc. The eleven projected quasars have projected separations ranging from 10.96 to 39.07 kpc, with a mean separation of 22.64 kpc. Additionally, there are three likely lensed quasars that cannot be definitively confirmed, contributed by two reasons. Firstly, their image separations (0.83'', 0.98'', and 0.93'') are small compared to the seeing conditions during our observations (around 1.2''). Secondly, no high SNR lensing galaxy can be detected in the Legacy Survey Imaging. Better spectroscopy and (or) imaging are needed to confirm their lensing nature.

astro-ph.GA↗

arXiv2025

Forecast of gravitationally lensed Type Ia supernovae time delay measurement by Muztage-Ata 1.93m Synergy Telescope

Strong lensing time delay measurement is a promising method to address the Hubble tension, offering a completely independent approach compared to both the cosmic microwave background analysis and the local distance ladder. As a third-party examination of the Hubble tension, this method provides a unique perspective. Strongly lensed quasar (glQSO) systems have demonstrated significant potential in tackling this issue, achieving an impressive $2\%$ accuracy level. However, advancing to $1\%$ or sub-percent accuracy is challenging due to several intrinsic limitations of glQSOs. Fortunately, strongly lensed supernovae (glSNe) offer a more robust solution, thanks to their characteristic light curve, significant brightness variations, and additional advantages. The Muztagh-Ata 1.93m Synergy Telescope (MOST) is an exceptional instrument for monitoring strong lensing time delays. In this study, we simulate the follow-up multi-band light curve monitoring for glSNe Ia systems, which are expected to be firstly discovered by the Chinese Survey Space Telescope (CSST). Our results show that with $300s \times 9$ exposures in each epoch, MOST can achieve a signal-to-noise ratio (SNR) of approximately 50 for the brightest images of glSNe Ia, while even the faintest images maintain an SNR of at least 7. Using a standard SNe Ia light curve template for fitting, we measured the time delays. With a 2-day cadence, MOST achieves a time delay error of only a few hours, with the bias typically remaining below one hour. This study highlights the capability of MOST to significantly advance the precision of time delay measurements, offering a promising path toward resolving the Hubble tension.

astro-ph.GA↗

arXiv2025

Using Convolutional Neural Networks to Search for Strongly Lensed Quasars in KiDS DR5

Gravitationally strongly lensed quasars (SL-QSO) offer invaluable insights into cosmological and astrophysical phenomena. With the data from ongoing and next-generation surveys, thousands of SL-QSO systems can be discovered expectedly, leading to unprecedented opportunities. However, the challenge lies in identifying SL-QSO from enormous datasets with high recall and purity in an automated and efficient manner. Hence, we developed a program based on a Convolutional Neural Network (CNN) for finding SL-QSO from large-scale surveys and applied it to the Kilo-degree Survey Data Release 5 (KiDS DR5). Our approach involves three key stages: firstly, we pre-selected ten million bright objects (with $r$-band $\tt{MAG\_AUTO} < 22$), excluding stars from the dataset; secondly, we established realistic training and test sets to train and fine-tune the CNN, resulting in the identification of 4195 machine candidates, and the false positive rate (FPR) of $\sim$1/2000 and recall of 0.8125 evaluated by using the real test set containing 16 confirmed lensed quasars; thirdly, human inspections were performed for further selections, and then 272 SL-QSO candidates were eventually found in total, including 16 high-score, 118 median-score, and 138 lower-score candidates, separately. Removing the systems already confirmed or identified in other papers, we end up with 229 SL-QSO candidates, including 7 high-score, 95 median-score, and 127 lower-score candidates, and the corresponding catalog is publicly available online. We have also included an excellent quad candidate in the appendix, discovered serendipitously during the fine-tuning process of the CNN.

astro-ph.GA↗

arXiv2024

Clutter Resilient Occlusion Avoidance for Tightly-Coupled Motion-Assisted Detection

Occlusion is a key factor leading to detection failures. This paper proposes a motion-assisted detection (MAD) method that actively plans an executable path, for the robot to observe the target at a new viewpoint with potentially reduced occlusion. In contrast to existing MAD approaches that may fail in cluttered environments, the proposed framework is robust in such scenarios, therefore termed clutter resilient occlusion avoidance (CROA). The crux to CROA is to minimize the occlusion probability under polyhedron-based collision avoidance constraints via the convex-concave procedure and duality-based bilevel optimization. The system implementation supports lidar-based MAD with intertwined execution of learning-based detection and optimization-based planning. Experiments show that CROA outperforms various MAD schemes under a sparse convolutional neural network detector, in terms of point density, occlusion ratio, and detection error, in a multi-lane urban driving scenario.

cs.RO↗

arXiv2024

Revolutionizing Database Q&A with Large Language Models: Comprehensive Benchmark and Evaluation

The development of Large Language Models (LLMs) has revolutionized QA across various industries, including the database domain. However, there is still a lack of a comprehensive benchmark to evaluate the capabilities of different LLMs and their modular components in database QA. To this end, we introduce DQABench, the first comprehensive database QA benchmark for LLMs. DQABench features an innovative LLM-based method to automate the generation, cleaning, and rewriting of evaluation dataset, resulting in over 200,000 QA pairs in English and Chinese, separately. These QA pairs cover a wide range of database-related knowledge extracted from manuals, online communities, and database instances. This inclusion allows for an additional assessment of LLMs' Retrieval-Augmented Generation (RAG) and Tool Invocation Generation (TIG) capabilities in the database QA task. Furthermore, we propose a comprehensive LLM-based database QA testbed DQATestbed. This testbed is highly modular and scalable, with basic and advanced components such as Question Classification Routing (QCR), RAG, TIG, and Prompt Template Engineering (PTE). Moreover, DQABench provides a comprehensive evaluation pipeline that computes various metrics throughout a standardized evaluation process to ensure the accuracy and fairness of the evaluation. We use DQABench to evaluate the database QA capabilities under the proposed testbed comprehensively. The evaluation reveals findings like (i) the strengths and limitations of nine LLM-based QA bots and (ii) the performance impact and potential improvements of various service components (e.g., QCR, RAG, TIG). Our benchmark and findings will guide the future development of LLM-based database QA research.

cs.DB↗

arXiv2024

UPdec-Webb: A Dataset for Coaddition of JWST NIRCam Images

We present the application of the image coaddition algorithm, Up-sampling and PSF Deconvolution Coaddition (UPDC), for stacking multiple exposure images captured by the James Webb Space Telescope (JWST) Near-Infrared Camera (NIRCam). By addressing the point spread function (PSF) effect, UPDC provides visually enhanced and sharper images. Furthermore, the anti-aliasing and super-resolution capabilities of UPDC make it easier to deblend sources overlapped on images, yielding a higher accuracy of aperture photometry. We apply this algorithm to the SMACS J0723 imaging data. Comparative analysis with the Drizzle algorithm demonstrates significant improvements in detecting faint sources, achieving accurate photometry, and effectively deblending (super-resolution) closely packed sources. {As a result, we have newly detected a pair of close binary stars that were previously unresolvable in the original exposures or the Drizzled image.} These improvements significantly benefit various scientific projects conducted by JWST. The resulting dataset, named "UPdec-Webb", can be accessible through the official website of the Chinese Virtual Observatory (ChinaVO).

astro-ph.IM↗

arXiv2024

Robotic Sensor Network: Achieving Mutual Communication Control Assistance With Fast Cross-Layer Optimization

Robotic sensor network (RSN) is an emerging paradigm that harvests data from remote sensors adopting mobile robots. However, communication and control functionalities in RSNs are interdependent, for which existing approaches become inefficient, as they plan robot trajectories merely based on unidirectional impact between communication and control. This paper proposes the concept of mutual communication control assistance (MCCA), which leverages a model predictive communication and control (MPC2) design for intertwined optimization of motion-assisted communication and communication-assisted collision avoidance. The MPC2 problem jointly optimizes the cross-layer variables of sensor powers and robot actions, and is solved by alternating optimization, strong duality, and cross-horizon minorization maximization in real time. This approach contrasts with conventional communication control co-design methods that calculate an offline non-executable trajectory. Experiments in a high-fidelity RSN simulator demonstrate that the proposed MCCA outperforms various benchmarks in terms of communication efficiency and navigation time.

cs.RO↗

arXiv2024

Probing the He II re-Ionization ERa via Absorbing C IV Historical Yield (HIERACHY) II: Project Design, Current Status, and Examples of Initial Data Products

The He II reionization epoch is expected to take place at $z\sim3-5$. In this stage, the helium and metals in the inter-galactic medium (IGM) are further ionized with additional contributions from harder non-stellar sources, and some large-scale gravitationally bound systems approach virialization. The "Probing the He II re-Ionization ERa via Absorbing C IV Historical Yield (HIERACHY)" program utilizes high- and medium-resolution spectra of bright background quasars at $z\approx3.9-5.2$ to investigate Ly$α$, C IV, and other metal absorption lines during this epoch. Additionally, we employ narrow-band imaging to search for Ly$α$ emitters associated with C IV absorbers, alongside multi-wavelength observations to identify and study particularly intriguing cases. In this paper, we present the design of the HIERACHY program, its current status, major scientific goals, and examples of initial data products from completed Magellan/MIKE, MagE spectroscopy, and MDM imaging observations. We also provide a brief outlook on future multi-wavelength observations that may significantly impact the related science.

astro-ph.GA↗

arXiv2024

Cosmological Prediction of the Void and Galaxy Clustering Measurements in the CSST Spectroscopic Survey

The void power spectrum is related to the clustering of low-density regions in the large-scale structure (LSS) of the Universe, and can be used as an effective cosmological probe to extract the information of the LSS. We generate the galaxy mock catalogs from Jiutian simulation, and identify voids using the watershed algorithm for studying the cosmological constraint strength of the China Space Station Telescope (CSST) spectroscopic survey. The galaxy and void auto power spectra and void-galaxy cross power spectra at $z=0.3$, 0.6, and 0.9 are derived from the mock catalogs. To fit the full power spectra, we propose to use the void average effective radius at a given redshift to simplify the theoretical model, and adopt the Markov Chain Monte Carlo (MCMC) technique to implement the constraints on the cosmological and void parameters. The systematical parameters, such as galaxy and void biases, and noise terms in the power spectra are also included in the fitting process. We find that our theoretical model can correctly extract the cosmological information from the galaxy and void power spectra, which demonstrates its feasibility and effectivity. The joint constraint accuracy of the cosmological parameters can be improved by $\sim20\%$ compared to that from the galaxy power spectrum only. The fitting results of the void density profile and systematical parameters are also well constrained and consistent with the expectation. This indicates that the void clustering measurement can be an effective complement to the galaxy clustering probe, especially for the next generation galaxy surveys.

astro-ph.CO↗

arXiv2024

PACE: Poisoning Attacks on Learned Cardinality Estimation

Cardinality estimation (CE) plays a crucial role in database optimizer. We have witnessed the emergence of numerous learned CE models recently which can outperform traditional methods such as histograms and samplings. However, learned models also bring many security risks. For example, a query-driven learned CE model learns a query-to-cardinality mapping based on the historical workload. Such a learned model could be attacked by poisoning queries, which are crafted by malicious attackers and woven into the historical workload, leading to performance degradation of CE. In this paper, we explore the potential security risks in learned CE and study a new problem of poisoning attacks on learned CE in a black-box setting. Experiments show that PACE reduces the accuracy of the learned CE models by 178 times, leading to a 10 times decrease in the end-to-end performance of the target database.

cs.DB↗