Jun Yang

Jun Yang

Auto-generated profile, based on publicly available information

Jun Yang

Duke University, Durham, NC, USA

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
14 December 2012 in Foundations and Trends® in Databases
Verified
Journal Article
Open access
PDF file
RCRada Chirkova
Rada Chirkova
JYJun Yang
Jun Yang
Materialized views are queries whose results are stored and maintained in order to facilitate access to data in their underlying base tables. In the SQL setting, they are now considered a mature technology implemented by most commercial database systems and tightly integrated into query optimization. They have also helped lay the foundation for important topics such as information integration and data warehousing. This monograph provides an introduction and reference to materialized views. We cover three fundamental problems: (1) maintaining materialized views efficiently when the base tables change, (2) using materialized views effectively to improve performance and availability, and (3) selecting which views to materialize. We also point out their connections to a few other areas in database research, illustrate the benefit of cross-pollination of ideas with these areas, and identify several directions for research on materialized views.

1 October 2003 in The VLDB Journal
Verified
Journal Article
Closed access
PDF file
JYJun Yang
Jun Yang
JWJennifer Widom
Jennifer Widom

1 April 2007
Verified
Conference Paper
Closed access
ASAdam Silberstein
Adam Silberstein
JYJun Yang
Jun Yang
Wireless sensor networks have enormous potential to aid data collection in a number of areas, such as environmental and wildlife research. In this paper, we address the challenges of supporting many-to-many aggregation in a sensor network. An application of many-to-many aggregation is in-network control of sensors. For expensive sensing tasks such as sap flux measurements and camera repositioning, we use low-cost information obtained at multiple other nodes in the network to control such tasks, e.g., decreasing sampling rates when readings are predictable or unimportant, while increasing sampling rates when there are interesting activities. In general, there is a many-to-many relationship between sources (nodes providing control inputs) and destinations (nodes requiring control outputs). We present a method for implementing many-to-many aggregation in a sensor network that minimizes the communication cost by optimally balancing a combination of multicast and in-network aggregation. Our optimization technique is efficient in finding the initial solution and handling dynamic updates.

1 April 2008
Verified
Conference Paper
Closed access
JXJunyi Xie
Junyi Xie
JYJun Yang
Jun Yang
YCYuguo Chen
Yuguo Chen
HWHaixun Wang
Haixun Wang
PYPhilip S. Yu
Philip S. Yu
There has been a recent resurgence of interest in research on noisy and incomplete data. Many applications require information to be recovered from such data. Ideally, an approach for information recovery should have the following features. First, it should be able to incorporate prior knowledge about the data, even if such knowledge is in the form of complex distributions and constraints for which no close-form solutions exist. Second, it should be able to capture complex correlations and quantify the degree of uncertainty in the recovered data, and further support queries over such data. The database community has developed a number of approaches for information recovery, but none is general enough to offer all above features. To overcome the limitations, we take a significantly more general approach to information recovery based on sampling. We apply sequential importance sampling, a technique from statistics that works for complex distributions and dramatically outperforms naive sampling when data is constrained. We illustrate the generality and efficiency of this approach in two application scenarios: cleansing RFID data, and recovering information from published data that has been summarized and randomized for privacy.

3 April 2007
Verified
Book Chapter
Closed access
PDF file
JXJunyi Xie
Junyi Xie
JYJun Yang
Jun Yang

19 April 2023
Verified
Conference Paper
Open access
RSRickard Stureborg
Rickard Stureborg
BDBhuwan Dhingra
Bhuwan Dhingra
JYJun Yang
Jun Yang
Human data labeling is an important and expensive task at the heart of supervised learning systems. Hierarchies help humans understand and organize concepts. We ask whether and how concept hierarchies can inform the design of annotation interfaces to improve labeling quality and efficiency. We study this question through annotation of vaccine misinformation, where the labeling task is difficult and highly subjective. We investigate 6 user interface designs for crowdsourcing hierarchical labels by collecting over 18,000 individual annotations. Under a fixed budget, integrating hierarchies into the design improves crowdsource workers’ F1 scores. We attribute this to (1) Grouping similar concepts, improving F1 scores by +0.16 over random groupings, (2) Strong relative performance on high-difficulty examples (relative F1 score difference of +0.40), and (3) Filtering out obvious negatives, increasing precision by +0.07. Ultimately, labeling schemes integrating the hierarchy outperform those that do not — achieving mean F1 of 0.70.