Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Renjie Lou

dblp:169/1444 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
1since 2021 · last 2023
—ORCID · none

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

Artificial intelligence and machine learning · 2Databases, data management, data science and information retrieval · 2 · 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
Query processing and optimization · 53% Information retrieval · 26% Distributed and cloud data management · 20%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 100%

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

TopicWeightPapersLastEvidence papers
Query processing and optimization
adaptive query processing
0.712023
Anser: Adaptive Information Sharing Framework of AnalyticDB · Proc. VLDB Endow. 2023
Distributed and cloud data management › distributed data store
distributed data warehouse
0.712023
Anser: Adaptive Information Sharing Framework of AnalyticDB · Proc. VLDB Endow. 2023
Information retrieval › similarity search › nearest neighbor search
approximate nearest neighbor search
0.412020
AnalyticDB-V: A Hybrid Analytical Engine Towards Query Fusion for Structured and Unstructured Data · Proc. VLDB Endow. 2020
Query processing and optimization › complex query processing
hybrid queries
0.412020
AnalyticDB-V: A Hybrid Analytical Engine Towards Query Fusion for Structured and Unstructured Data · Proc. VLDB Endow. 2020
Information retrieval › similarity search
nearest neighbor search
0.412020
AnalyticDB-V: A Hybrid Analytical Engine Towards Query Fusion for Structured and Unstructured Data · Proc. VLDB Endow. 2020
Cloud and datacenter computing › big data analytics
cloud data analytics service
0.212023
Anser: Adaptive Information Sharing Framework of AnalyticDB · Proc. VLDB Endow. 2023

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

scheduling policy · 1.3information sharing · 1.3lambda framework · 0.4accuracy-aware cost-based optimization · 0.4
YearPublicationVenuePosition
2023 Anser: Adaptive Information Sharing Framework of AnalyticDB
abstract
The surge in data analytics has fostered burgeoning demand for AnalyticDB on Alibaba Cloud, which has well served thousands of customers from various business sectors. The most notable feature is the diversity of the workloads it handles, including batch processing, real-time data analytics, and unstructured data analytics. To improve the overall performance for such diverse workloads, one of the major challenges is to optimize long-running complex queries without sacrificing the processing efficiency of short-running interactive queries. While existing methods attempt to utilize runtime dynamic statistics for adaptive query processing, they often focus on specific scenarios instead of providing a holistic solution. To address this challenge, we propose a new framework called Anser , which enhances the design of traditional distributed data warehouses by embedding a new information sharing mechanism. This allows for the efficient management of the production and consumption of various dynamic information across the system. Building on top of Anser , we introduce a novel scheduling policy that optimizes both data and information exchanges within the physical plan, enabling the acceleration of complex analytical queries without sacrificing the performance of short-running interactive queries. We conduct comprehensive experiments over public and in-house workloads to demonstrate the effectiveness and efficiency of our proposed information sharing framework.
Liang Lin 0003, Bin Wu 0003, Huijun Mai, Renjie Lou, Jian Tan 0001, Feifei Li 0001
Proc. VLDB Endow.5
2020 AnalyticDB-V: A Hybrid Analytical Engine Towards Query Fusion for Structured and Unstructured Data
abstract
With the explosive growth of unstructured data (such as images, videos, and audios), unstructured data analytics is widespread in a rich vein of real-world applications. Many database systems start to incorporate unstructured data analysis to meet such demands. However, queries over unstructured and structured data are often treated as disjoint tasks in most systems, where hybrid queries ( i.e. , involving both data types) are not yet fully supported. In this paper, we present a hybrid analytic engine developed at Alibaba, named AnalyticDB-V (ADBV), to fulfill such emerging demands. ADBV offers an interface that enables users to express hybrid queries using SQL semantics by converting unstructured data to high dimensional vectors. ADBV adopts the lambda framework and leverages the merits of approximate nearest neighbor search (ANNS) techniques to support hybrid data analytics. Moreover, a novel ANNS algorithm is proposed to improve the accuracy on large-scale vectors representing massive unstructured data. All ANNS algorithms are implemented as physical operators in ADBV, meanwhile, accuracy-aware cost-based optimization techniques are proposed to identify effective execution plans. Experimental results on both public and in-house datasets show the superior performance achieved by ADBV and its effectiveness. ADBV has been successfully deployed on Alibaba Cloud to provide hybrid query processing services for various real-world applications.
Chuangxian Wei, Bin Wu 0003, Sheng Wang 0011, Renjie Lou, Chaoqun Zhan, Feifei Li 0001, Yuanzhe Cai
Proc. VLDB Endow.4
2015 Taxonomy Induction from Chinese Encyclopedias by Combinatorial Optimization
Weiming Lu 0001, Renjie Lou, Zhenyu Zhang 0008, Shansong Yang, Baogang Wei
NLPCC2
2015 Mining RDF from Tables in Chinese Encyclopedias
abstract
Web tables understanding has recently attracted a number of studies. However, many works focus on the tables in English, because they usually need the help of knowledge bases, while the existing knowledge bases such as DBpedia, YAGO, Freebase and Probase mainly contain knowledge in English. In this paper, we focus on the RDF triples extraction from tables in Chinese encyclopedias. Firstly, we constructed a Chinese knowledge base through taxonomy mining and class attribute mining. Then, with the help of our knowledge base, we extracted triples from tables through column scoring, table classification and RDF extraction. In our experiments, we practically implemented our approach in 6,618,544 articles from Hudong Baike with 764,292 tables, and extracted about 1,053,407 unique and new RDF triples with an estimated accuracy of \(90.2\%\) , which outperforms other similar works.
Weiming Lu 0001, Zhenyu Zhang 0008, Renjie Lou, Shansong Yang, Baogang Wei
NLPCC3
2015 Improving MapReduce Performance with Partial Speculative Execution
Yaoguang Wang, Weiming Lu 0001, Renjie Lou, Baogang Wei
J. Grid Comput.3