Qiuru Lin

dblp:257/5696 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
3since 2021 · last 2023
0000-0002-6429-9713ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 2 · 2 first-author · 2 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Systems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
2 papers
Machine learning and data management · 58% Database system architecture and tuning · 33% Query processing and optimization · 9%
Artificial intelligence
1 paper
Efficient and distributed learning · 100%
Computer networks
1 paper
Edge and fog computing · 100%

Topics — the 6 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
model compression
0.712023
SmartLite: A DBMS-based Serving System for DNN Inference in Resource-constrained Environments · Proc. VLDB Endow. 2023
Machine learning › Efficient and distributed learning › model compression
pruning and quantization
0.712023
SmartLite: A DBMS-based Serving System for DNN Inference in Resource-constrained Environments · Proc. VLDB Endow. 2023
Database system architecture and tuning
embedded database
0.712023
SmartLite: A DBMS-based Serving System for DNN Inference in Resource-constrained Environments · Proc. VLDB Endow. 2023
Machine learning and data management › in-database machine learning
in-database inference
0.612022
A Comparative Study of in-Database Inference Approaches · ICDE 2022
Edge and fog computing › edge inference
resource-constrained edge inference
0.212023
SmartLite: A DBMS-based Serving System for DNN Inference in Resource-constrained Environments · Proc. VLDB Endow. 2023
Query processing and optimization
query optimization
0.212022
A Comparative Study of in-Database Inference Approaches · ICDE 2022

Methods — techniques the papers use, named apart from their topics

value lookup · 2.0neural pruning · 2.0binarization · 2.0user-defined functions · 0.6deep learning · 0.6SQL rewriting · 0.6
YearPublicationVenuePosition
2023 SmartLite: A DBMS-based Serving System for DNN Inference in Resource-constrained Environments
abstract
Many IoT applications require the use of multiple deep neural networks (DNNs) to perform various tasks on low-cost edge devices with limited computation resources. However, existing DNN model serving platforms, such as TensorFlow Serving and TorchServe, are resource-intensive and require high-performance GPUs that are often not available on low-cost edge devices. In this paper, we propose SmartLite, a lightweight DBMS that addresses these challenges by storing the parameters and structural information of neural networks as database tables and implementing neural network operators inside the DBMS engine. SmartLite quantizes model parameters as binarized values, applies neural pruning techniques to compress the models, and transforms tensor manipulations into value lookup operations of the DBMS to reduce computation overhead. Experimental results show that SmartLite requires 98% less memory while achieving about a 134% performance speedup compared to Torch-Serve. Our proposed solution addresses the challenges of running multiple DNN models on low-cost edge devices and provides a significant contribution to the field of IoT applications.
Qiuru Lin, Sai Wu, Junbo Zhao 0002, Meng Shi, Gang Chen 0001, Feifei Li 0001
Proc. VLDB Endow.1
2022 A Comparative Study of in-Database Inference Approaches
abstract
In Alibaba's IoT platform, we face the challenge of processing analytical queries involving both structured and unstructured data. Normally, collaborative queries need deep learning (DL) models and relational algebras to work intertwined to produce sophisticated analytical answers. To be able to support collaborative queries, a variety of approaches have been proposed. In this paper, we present the three most representative ones and study their advantages and limitations. The first one translates the collaborative query into a series of database and DL sub-queries and then maintains the dependence of the intermediate results of two sub-systems and computes the final results on the fly. The second one transforms a DL model to a database built-in User Defined Function(UDF) implemented in C++. The whole collaborative query is then processed by the database system independently. The third one is our novel solution proposed in the paper, DL2SQL, where neural operators underneath DL models are rewritten as SQL queries, and collaborative queries are processed using native SQL syntax. A cost model for our SQL-native neural operators is designed to leverage the database's optimizer to generate an efficient query plan. All three approaches are implemented on the ClickHouse. Finally, we use the real-world workloads on Alibaba's IoT platform as our benchmark and deploy various approaches on both an embedded device and a Cloud server to compare their performance. Results show that DL2SQL outperforms others in most scenarios and is more extensible.
Qiuru Lin, Sai Wu, Junbo Zhao 0002, Feifei Li 0001, Gang Chen 0001
ICDE1
2022 Bioinspired Scene Classification by Deep Active Learning With Remote Sensing Applications
abstract
Accurately classifying sceneries with different spatial configurations is an indispensable technique in computer vision and intelligent systems, for example, scene parsing, robot motion planning, and autonomous driving. Remarkable performance has been achieved by the deep recognition models in the past decade. As far as we know, however, these deep architectures are incapable of explicitly encoding the human visual perception, that is, the sequence of gaze movements and the subsequent cognitive processes. In this article, a biologically inspired deep model is proposed for scene classification, where the human gaze behaviors are robustly discovered and represented by a unified deep active learning (UDAL) framework. More specifically, to characterize objects' components with varied sizes, an objectness measure is employed to decompose each scenery into a set of semantically aware object patches. To represent each region at a low level, a local-global feature fusion scheme is developed which optimally integrates multimodal features by automatically calculating each feature's weight. To mimic the human visual perception of various sceneries, we develop the UDAL that hierarchically represents the human gaze behavior by recognizing semantically important regions within the scenery. Importantly, UDAL combines the semantically salient region detection and the deep gaze shifting path (GSP) representation learning into a principled framework, where only the partial semantic tags are required. Meanwhile, by incorporating the sparsity penalty, the contaminated/redundant low-level regional features can be intelligently avoided. Finally, the learned deep GSP features from the entire scene images are integrated to form an image kernel machine, which is subsequently fed into a kernel SVM to classify different sceneries. Experimental evaluations on six well-known scenery sets (including remote sensing images) have shown the competitiveness of our approach.
Ge Su, Jianwei Yin, Ying Li 0001, Qiuru Lin, Xiaoqin Zhang 0002, Ling Shao 0001
IEEE Trans. Cybern.5
2019 CRState: In-Kernel Checkpoint/Restart of OpenCL Program Execution on GPU
abstract
Checkpoint/restart is an important mechanism to achieve fault tolerance, load balancing and resources sharing in a preemptive system. As Graphics Processing Unit (GPU) becomes quite popular in high performance computing as well as OpenCL programs are portable across various CPUs and GPUs, checkpoint/restart of OpenCL programs on GPUs is in demand. However, due to the intricacy of computation states inside GPUs, there is no effective checkpoint/restart scheme for heterogeneous devices now. This paper proposes a feasible system, CRState, to achieve checkpoint/restart in GPU kernels. With the assistant of a pre-compiler, the primitives are inserted into programs. In run-time, the computation state existing in the underlying hardware is concretized and reconstructed at application level and is ported to heterogeneous devices. Comprehensive experiments have been conducted to demonstrate CRState's feasibility and effectiveness. The experimental results also indicate that CRState has the potential to reschedule resources and balance workload across heterogeneous devices.
Genlang Chen, Jiajian Zhang, Qiuru Lin, Hai Jiang 0003, Chaoyi Pang
ICPADS3