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

Dai Tan

dblp:149/5923 · DBLP profile ↗
← Back
6ranked-venue papers
0as first author
0since 2021 · last 2019
—ORCID · none

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

Databases, data management, data science and information retrieval · 3Computer networks · 2Applied, interdisciplinary, general and emerging computing · 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.

Computer architecture, parallel and distributed computing, and storage systems
3 papers
Storage systems · 86% Cloud and datacenter computing · 14%
Databases, data mining, and information retrieval
2 papers
Information retrieval · 28% Indexing and storage engines · 28% Data integration and cleaning · 22%
Computer networks
1 paper
Network measurement and analytics · 77% Content delivery and video streaming · 23%

Topics — the 11 heaviest of 14, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Indexing and storage engines › index maintenance
index update
0.412019
DirectLoad: A Fast Web-Scale Index System Across Large Regional Centers · ICDE 2019
Information retrieval › indexing
search engine indexing
0.412019
DirectLoad: A Fast Web-Scale Index System Across Large Regional Centers · ICDE 2019
Storage systems › data reduction
data deduplication
0.412019
DirectLoad: A Fast Web-Scale Index System Across Large Regional Centers · ICDE 2019
Storage systems › flash and SSD
solid-state drive
0.412019
DirectLoad: A Fast Web-Scale Index System Across Large Regional Centers · ICDE 2019
Storage systems › flash and SSD
write amplification reduction
0.412019
DirectLoad: A Fast Web-Scale Index System Across Large Regional Centers · ICDE 2019
Data integration and cleaning › heterogeneous data sources
heterogeneous data source querying
0.312017
Feisu: Fast Query Execution over Heterogeneous Data Sources on Large-Scale Clusters · ICDE 2017
Query processing and optimization
query execution
0.312017
Feisu: Fast Query Execution over Heterogeneous Data Sources on Large-Scale Clusters · ICDE 2017
Storage systems
archival storage
0.212014
Fatman: Cost-saving and reliable archival storage based on volunteer resources · Proc. VLDB Endow. 2014
Storage systems
storage reliability
0.212014
Fatman: Cost-saving and reliable archival storage based on volunteer resources · Proc. VLDB Endow. 2014
Cloud and datacenter computing › cluster resource management and scheduling
cluster resource management
0.112017
Feisu: Fast Query Execution over Heterogeneous Data Sources on Large-Scale Clusters · ICDE 2017
Cloud and datacenter computing
datacenter storage
0.112014
Fatman: Cost-saving and reliable archival storage based on volunteer resources · Proc. VLDB Endow. 2014

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

log-structured merge tree replacement · 0.8lazy garbage collection · 0.8deduplication · 0.8query similarity exploitation · 0.6data integration · 0.6machine learning based log analysis · 0.2disk failure prediction · 0.2
YearPublicationVenuePosition
2019 DirectLoad: A Fast Web-Scale Index System Across Large Regional Centers
abstract
The freshness of web page indices is the key to improving searching quality of search engines. In Baidu, the major search engine in China, we have developed DirectLoad, an index updating system for efficiently delivering the webscale indices to nationwide data centers. However, the web-scale index updating suffers from increasingly high data volumes during network transmission and inefficient I/O transactions due to slow disk operations. DirectLoad accelerates the index updating streams from two aspects: 1) DirectLoad effectively cuts down the overwhelmingly high volume of indices in transmission by removing the redundant data across versions, and mutates regular operations in a key-value storage system for successful accesses to the deduplicated datasets. 2) DirectLoad significantly improves the I/O efficiency by replacing the LSMTree with a memory-resident table (memtable) and appendingonly-files (AOFs) on disk. Specifically, the write amplification stemming from sorting operations on disk is eliminated, and a lazy garbage collection policy further improves the I/O performance at the software level. In addition, DirectLoad directly manipulates the SSD native interfaces to remove the write amplification at the hardware level. In practice, 63% updating bandwidth has been saved due to the deduplication, and the write throughput to SSDs is increased by 3x. The index updating cycle of our production workloads has been compressed from 15 days to 3 days after deploying DirectLoad. In this paper, we show the effectiveness and efficiency of an in-memory index updating system, which is disruptive to the framework in a conventional memory hierarchy. We hope that this work contributes a strong case study in the system research literature.
An Qin 0001, Mengbai Xiao, Dai Tan, Rubao Lee, Xiaodong Zhang 0001
ICDE4
2017 Feisu: Fast Query Execution over Heterogeneous Data Sources on Large-Scale Clusters
abstract
Fast data analytics at an increasingly large scale has become a critical task in any Internet service company. For example, in Baidu, the major search engine company in China, large volumes of Web and business data in PB-scale are timely and constantly acquired and analyzed for the purposes of evaluating product revenue, tracking product demanding activities on market, predicting user behavior, upgrading product rankings, and diagnosing spam cases, and many others. Response time for queries of various data analytics not only affects user experiences, but also has a serious impact on productivity of business operations. In this paper, to meet the challenge of fast data analytics, we present Feisu (meaning fast in Chinese), a data integration system over heterogeneous storage systems, which has been widely used in Baidu's critical and daily business analytics applications after our R&D efforts. Feisu is designed and implemented to co-work together with several heterogeneous storage systems, and exploit the query similarity embedded in complex query workloads. Our experiments using real world workloads show that Feisu can significantly improve query performance in Baidu. Feisu has been in production use in Baidu for two years to effectively manage over dozens of petabytes of data for various applications.
An Qin 0001, Yuan Yuan 0014, Dai Tan, Rubao Lee, Xiaodong Zhang 0001
ICDE3
2016 FOCUS: Shedding light on the high search response time in the wild
abstract
Response time plays a key role in Web services, as it significantly impacts user engagement, and consequently the Web providers' revenue. Using a large search engine as a case study, we propose a machine learning based analysis framework, called FOCUS, as the first step to automatically debug high search response time (HSRT) in search logs. The output of FOCUS offers a promising starting point for operators' further investigation. FOCUS has been deployed in one of the largest search engines for 2.5 months and analyzed about one billion search logs. Compared with a previous approach, FOCUS generates 90% less items for investigation and achieves both higher recall and higher precision. The results of FOCUS enable us to make several interesting observations. For example, we find that popular queries are more image-intensive (e.g., TV series and shopping), but they have relatively low SRT because they are cached well by servers. Additionally, as suggested by the first-month analysis results of FOCUS, we conduct an optimization on image transmission time. A one-month real-world deployment shows that we successfully reduce the 80th percentile of search response time by 253ms, and reduce the fraction of HSRT by one third.
Youjian Zhao, Kaixin Sui, Dan Pei, Qingqian Tao, Xiyang Chen, Dai Tan
INFOCOM8
2015 Narrowing down the debugging space of slow search response time
abstract
When using search engines, users often care about search response time (SRT) in addition to result accuracy. It is thus the operators' responsibility to closely monitor and improving SRT. The first critical step of improving SRT is to pinpoint the root causes of slow SRT. However, this task is very challenging because SRT can be impacted by many factors, e.g., networks, data centers, browsers, and the page content. In this paper, we propose FOCUS, a systematic framework to narrow down the debugging space of slow SRT by identifying the bottleneck of slow SRT regarding various factors. The bottleneck provides operators more specific direction for further investigation. We deployed FOCUS in a global top search engine. Based on the output of FOCUS, operators successfully identified four potential causes which would not have been easy to find without FOCUS. Our what-if simulation analysis shows that, the proposed solutions, focusing on these bottlenecks, can improve SRT significantly, and they are more effective than some ad hoc solutions.
Youjian Zhao, Dan Pei, Chengbin Quan, Qingqian Tao, Xiyang Chen, Dai Tan, Xiaowei Jing, Mei Feng
IPCCC8
2015 Fatman: Building Reliable Archival Storage Based on Low-Cost Volunteer Resources
An Qin 0001, Dianming Hu, Dai Tan
J. Comput. Sci. Technol.5
2014 Fatman: Cost-saving and reliable archival storage based on volunteer resources
abstract
We present Fatman, an enterprise-scale archival storage based on volunteer contribution resources from underutilized web servers, usually deployed on thousands of nodes with spare storage capacity. Fatman is specifically designed for enhancing the utilization of existing storage resources and cutting down the hardware purchase cost. Two major concerned issues of the system design are maximizing the resource utilization of volunteer nodes without violating Service Level Objectives (SLOs) and minimizing the cost without reducing the availability of archival system. Fatman has been widely deployed on tens of thousands of server nodes across several datacenters, provided more than 100PB storage capacity and served dozens of internal mass-data applications. The system realizes an efficient storage quota consolidation by strong isolation and budget limitation, to maximally support resources contribution without any degradation on host-level SLOs. It firstly improves data reliability by applying disk failure prediction to minish failure recovery cost, named fault-aware data management, dramatically reduces the MTTR by 76.3% and decreases file crash ratio by 35% on real-life product workload.
An Qin 0001, Dianming Hu, Dai Tan
Proc. VLDB Endow.5