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

Zhicheng Yin

dblp:166/8406 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
0since 2021 · last 2019
—ORCID · unresolved

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

Databases, data management, data science and information retrieval · 3 · 1 first-authorArtificial intelligence and machine learning · 1Systems, 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
3 papers
Query processing and optimization · 60% Distributed and cloud data management · 17% Data stream processing · 17%
Computer architecture, parallel and distributed computing, and storage systems
3 papers
Cloud and datacenter computing · 100%

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

TopicWeightPapersLastEvidence papers
Query processing and optimization › result reuse
computation reuse
0.312018
Computation Reuse in Analytics Job Service at Microsoft · SIGMOD Conference 2018
Query processing and optimization › materialized view
materialized view selection
0.312018
Computation Reuse in Analytics Job Service at Microsoft · SIGMOD Conference 2018
Cloud and datacenter computing › cloud data management
cloud query execution
0.312018
Bubble Execution: Resource-aware Reliable Analytics at Cloud Scale · Proc. VLDB Endow. 2018
Distributed and cloud data management
distributed query processing
0.212015
JetScope: Reliable and Interactive Analytics at Cloud Scale · Proc. VLDB Endow. 2015
Data stream processing
fault tolerance
0.212015
JetScope: Reliable and Interactive Analytics at Cloud Scale · Proc. VLDB Endow. 2015
Cloud and datacenter computing
cluster resource management and scheduling
0.112018
Computation Reuse in Analytics Job Service at Microsoft · SIGMOD Conference 2018

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

gang scheduling · 0.7feedback loop optimization · 0.7compile-time and run-time statistics · 0.7bubble execution · 0.7scheduling optimization · 0.4fine-grained fault tolerance · 0.4access methods · 0.4
YearPublicationVenuePosition
2019 Peregrine: Workload Optimization for Cloud Query Engines
abstract
Database administrators (DBAs) were traditionally responsible for optimizing the on-premise database workloads. However, with the rise of cloud data services, where cloud providers offer fully managed data processing capabilities, the role of a DBA is completely missing. At the same time, optimizing query workloads is becoming increasingly important for reducing the total costs of operation and making data processing economically viable in the cloud. This paper revisits workload optimization in the context of these emerging cloud-based data services. We observe that the missing DBA in these newer data services has affected both the end users and the system developers: users have workload optimization as a major pain point while the system developers are now tasked with supporting a large base of cloud users.
Alekh Jindal, Hiren Patel, Abhishek Roy 0008, Shi Qiao 0001, Zhicheng Yin, Rathijit Sen, Subru Krishnan
SoCC5
2018 Computation Reuse in Analytics Job Service at Microsoft
abstract
Analytics-as-a-service, or analytics job service, is emerging as a new paradigm for data analytics, be it in a cloud environment or within enterprises. In this setting, users are not required to manage or tune their hardware and software infrastructure, and they pay only for the processing resources consumed per job. However, the shared nature of these job services across several users and teams leads to significant overlaps in partial computations, i.e., parts of the processing are duplicated across multiple jobs, thus generating redundant costs. In this paper, we describe a computation reuse framework, coined CLOUDVIEWS, which we built to address the computation overlap problem in Microsoft's SCOPE job service. We present a detailed analysis from our production workloads to motivate the computation overlap problem and the possible gains from computation reuse. The key aspects of our system are the following: (i) we reuse computations by creating materialized views over recurring workloads, i.e., periodically executing jobs that have the same script templates but process new data each time, (ii) we select the views to materialize using a feedback loop that reconciles the compile-time and run-time statistics and gathers precise measures of the utility and cost of each overlapping computation, and (iii) we create materialized views in an online fashion, without requiring an offline phase to materialize the overlapping computations.
Alekh Jindal, Shi Qiao 0001, Hiren Patel, Zhicheng Yin, Jieming Di, Malay Bag, Marc T. Friedman, Yifung Lin, Konstantinos Karanasos, Sriram Rao
SIGMOD Conference4
2018 Bubble Execution: Resource-aware Reliable Analytics at Cloud Scale
abstract
Enabling interactive data exploration at cloud scale requires minimizing end-to-end query execution latency, while guaranteeing fault tolerance, and query execution under resource-constraints. Typically, such a query execution involves orchestrating the execution of hundreds or thousands of related tasks on cloud scale clusters. Without any resource constraints, all query tasks can be scheduled to execute simultaneously (gang scheduling) while connected tasks stream data between them. When the data size referenced by a query increases, gang scheduling may be resource-wasteful or un-satisfiable with a limited, per-query resource budget. This paper introduces B ubble E xecution , a new query processing framework for interactive workloads at cloud scale, that balances cost-based query optimization, fault tolerance, optimal resource management, and execution orchestration. Bubble execution involves dividing a query execution graph into a collection of query sub-graphs (bubbles), and scheduling them within a per-query resource budget. The query operators (tasks) inside a bubble stream data between them while fault tolerance is handled by persisting temporary results at bubble boundaries. Our implementation enhances our JetScope service, for interactive workloads, deployed in production clusters at Microsoft. Experiments with TPC-H queries show that bubble execution can reduce resource usage significantly in the presence of failures while maintaining performance competitive with gang execution.
Zhicheng Yin, Jaliya Ekanayake, Marc T. Friedman, José A. Blakeley, Clemens A. Szyperski, Nikhil R. Devanur
Proc. VLDB Endow.1
2016 Evolutionary semi-supervised rough categorization of brain signals from a wearable headband
abstract
This paper explores the possibility of using distance based semi-supervised learning for creating lower and upper approximations of biometric signals. An evolutionary approach applied to both crisp and rough clustering optimizes both the within cluster scatter and the precision of the classification. The proposed approach is demonstrated through data collected from a wearable headband that recorded EEG brain signals. The brain signals are recorded for a number of participants performing various tasks. The approach identifies medoids that can best identify the participants. The evolutionary semi-supervised crisp and rough clustering is shown to favorably compare with the conventional unsupervised algorithms such as K-means.
Glavin Wiechert, Matthew Triff, Zhixing Liu, Zhicheng Yin, Ziyun Zhong, Pawan Lingras
CEC4
2015 JetScope: Reliable and Interactive Analytics at Cloud Scale
abstract
Interactive, reliable, and rich data analytics at cloud scale is a key capability to support low latency data exploration and experimentation over terabytes of data for a wide range of business scenarios. Besides the challenges in massive scalability and low latency distributed query processing, it is imperative to achieve all these requirements with effective fault tolerance and efficient recovery, as failures and fluctuations are the norm in such a distributed environment. We present a cloud scale interactive query processing system, called JetScope, developed at Microsoft. The system has a SQL-like declarative scripting language and delivers massive scalability and high performance through advanced optimizations. In order to achieve low latency, the system leverages various access methods, optimizes delivering first rows, and maximizes network and scheduling efficiency. The system also provides a fine-grained fault tolerance mechanism which is able to efficiently detect and mitigate failures without significantly impacting the query latency and user experience. JetScope has been deployed to hundreds of servers in production at Microsoft, serving a few million queries every day.
Eric Boutin, Paul Brett, Jaliya Ekanayake, Anna Korsun, Zhicheng Yin, Jingren Zhou 0001
Proc. VLDB Endow.7