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

Yi Zhang 0011

dblp:64/6544-11 · DBLP profile ↗
← Back
5ranked-venue papers
5as first author
0since 2021 · last 2013
—ORCID · conflict

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

Databases, data management, data science and information retrieval · 5 · 5 first-author

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
Indexing and storage engines · 48% Query processing and optimization · 26% Database system architecture and tuning · 20%
Computer networks
1 paper
Internet of things and sensor networks · 50% Network measurement and analytics · 50%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Storage systems · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational science and engineering · 100%

Topics — the 8 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Network measurement and analytics
missing data recovery
0.212013
Failure-Aware Cascaded Suppression in Wireless Sensor Networks · IEEE Trans. Knowl. Data Eng. 2013
Internet of things and sensor networks
wireless sensor network
0.212013
Failure-Aware Cascaded Suppression in Wireless Sensor Networks · IEEE Trans. Knowl. Data Eng. 2013
Query processing and optimization › query optimization
declarative query optimization
0.112012
Optimizing I/O for Big Array Analytics · Proc. VLDB Endow. 2012
Indexing and storage engines
i/o optimization
0.112012
Optimizing I/O for Big Array Analytics · Proc. VLDB Endow. 2012
Indexing and storage engines › storage management
data layout
0.112011
Storing Matrices on Disk: Theory and Practice Revisited · Proc. VLDB Endow. 2011
Computational science and engineering
statistical computing
0.112010
I/O-efficient statistical computing with RIOT · ICDE 2010
Storage systems › i/o architecture › i/o subsystem
i/o sharing
0.012012
Optimizing I/O for Big Array Analytics · Proc. VLDB Endow. 2012
Data integration and cleaning
database integration
0.012010
I/O-efficient statistical computing with RIOT · ICDE 2010

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

nested-loop representation · 0.3declarative optimization · 0.3query optimization · 0.2array storage manager · 0.2coding theory · 0.2cascaded suppression · 0.2bayesian inference · 0.2
YearPublicationVenuePosition
2013 Failure-Aware Cascaded Suppression in Wireless Sensor Networks
abstract
Wireless sensor networks are widely used to continuously collect data from the environment. Because of energy constraints on battery-powered nodes, it is critical to minimize communication. Suppression has been proposed as a way to reduce communication by using predictive models to suppress reporting of predictable data. However, in the presence of communication failures, missing data are difficult to interpret because these could have been either suppressed or lost in transmission. There is no existing solution for handling failures for general, spatiotemporal suppression that uses cascading. While cascading further reduces communication, it makes failure handling difficult, because nodes can act on incomplete or incorrect information and in turn affect other nodes. We propose a cascaded suppression framework that exploits both temporal and spatial data correlation to reduce communication, and applies coding theory and Bayesian inference to recover missing data resulted from suppression and communication failures. Experiment results show that cascaded suppression significantly reduces communication cost and improves missing data recovery compared to existing approaches.
Yi Zhang 0011, Kristian Lum, Jun Yang 0001
IEEE Trans. Knowl. Data Eng.1
2012 Optimizing I/O for Big Array Analytics
abstract
Big array analytics is becoming indispensable in answering important scientific and business questions. Most analysis tasks consist of multiple steps, each making one or multiple passes over the arrays to be analyzed and generating intermediate results. In the big data setting, I/O optimization is a key to efficient analytics. In this paper, we develop a framework and techniques for capturing a broad range of analysis tasks expressible in nested-loop forms, representing them in a declarative way, and optimizing their I/O by identifying sharing opportunities. Experiment results show that our optimizer is capable of finding execution plans that exploit nontrivial I/O sharing opportunities with significant savings.
Yi Zhang 0011, Jun Yang 0001
Proc. VLDB Endow.1
2011 Storing Matrices on Disk: Theory and Practice Revisited
Yi Zhang 0011, Kamesh Munagala, Jun Yang 0001
Proc. VLDB Endow.1
2010 I/O-efficient statistical computing with RIOT
abstract
Statistical analysis of massive data is becoming indispensable to science, commerce, and society today. Such analysis requires efficient, flexible storage support and special optimization techniques. In this demo, we present RIOT (R with I/O Transparency), a system that extends R, a popular computing environment for statistical data analysis. RIOT makes R programs I/O-efficient in a way transparent to users. It features a flexible array storage manager and an optimization engine suitable for statistical and numerical operations. RIOT also seamlessly integrates with external database systems, offering additional opportunities for processing data that reside in databases by blurring the boundary between database and host-language processing. This demo will show how statistical computation can be effectively and efficiently handled by RIOT.
Yi Zhang 0011, Jun Yang 0001
ICDE1
2009 RIOT: I/O-Efficient Numerical Computing without SQL
Yi Zhang 0011, Herodotos Herodotou, Jun Yang 0001
CIDR1