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

Yingwei Cui

dblp:06/3051 · DBLP profile ↗
← Back
8ranked-venue papers
7as first author
0since 2021 · last 2004
—ORCID · none

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

Databases, data management, data science and information retrieval · 6 · 5 first-authorComputer networks · 1 · 1 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
6 papers
Data integration and cleaning · 75% Query processing and optimization · 18% Database system architecture and tuning · 7%
Computer networks
1 paper
Cellular and mobile networks · 67% Routing and switching · 33%

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

TopicWeightPapersLastEvidence papers
Data integration and cleaning
data provenance
0.252003
Lineage tracing for general data warehouse transformations · VLDB J. 2003
Lineage Tracing for General Data Warehouse Transformations · VLDB 2001
Tracing the lineage of view data in a warehousing environment · ACM Trans. Database Syst. 2000
Data integration and cleaning
data warehouse
0.142000
Tracing the lineage of view data in a warehousing environment · ACM Trans. Database Syst. 2000
Performance Issues in Incremental Warehouse Maintenance · VLDB 2000
Lineage Tracing in a Data Warehousing System · ICDE 2000
Data integration and cleaning › data warehouse
data warehouse maintenance
0.012000
Performance Issues in Incremental Warehouse Maintenance · VLDB 2000
Query processing and optimization › view maintenance
incremental view maintenance
0.012000
Performance Issues in Incremental Warehouse Maintenance · VLDB 2000
Query processing and optimization › provenance query processing
lineage tracing
0.012000
Tracing the lineage of view data in a warehousing environment · ACM Trans. Database Syst. 2000
Routing and switching
call setup
0.011998
Efficient PCS Call Setup Protocols · INFOCOM 1998
Cellular and mobile networks › mobility management
location management
0.011998
Efficient PCS Call Setup Protocols · INFOCOM 1998
Cellular and mobile networks
mobility management
0.011998
Efficient PCS Call Setup Protocols · INFOCOM 1998

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

lineage tracing algorithm · 0.1auxiliary view · 0.1drill-through · 0.0simulation · 0.0analytical modeling · 0.0
YearPublicationVenuePosition
2004 Design of a novel digital-IF receiver based on software radio
abstract
Based on software radio, a novel digital-IF receiver is introduced from the engineering point of view. Through the cooperation between programmable logic device (PLD) and high performance digital signal processor (DSP), all functions of receiver can be reconfigured online. As long as the bandwidth of the input IF signal is within an allowed range, the different signals can be received by reconfiguring the receiver online via PCI or Ethernet, without any hardware modification.
Yingwei Cui, Xiaolin Zhang 0002
PIMRC1
2003 Lineage tracing for general data warehouse transformations
Yingwei Cui, Jennifer Widom
VLDB J.1
2001 Lineage Tracing for General Data Warehouse Transformations
Yingwei Cui, Jennifer Widom
VLDB1
2000 Practical Lineage Tracing in Data Warehouses
abstract
We consider the view data lineage problem in a warehousing environment: for a given data item in a materialized warehouse view, we want to identify the set of source data items that produced the view item. We formalize the problem and we present a lineage tracing algorithm for relational views with aggregation. Based on our tracing algorithm, we propose a number of schemes for storing auxiliary views that enable consistent and efficient lineage tracing in a multi-source data warehouse. We report on a performance study of the various schemes, identifying which schemes perform best in which settings. Based on our results, we have implemented a lineage tracing package in the WHIPS data warehousing system prototype at Stanford. With this package, users can select view tuples of interest, then efficiently "drill through" to examine the exact source tuples that produced the view tuples of interest.
Yingwei Cui, Jennifer Widom
ICDE1
2000 Lineage Tracing in a Data Warehousing System
abstract
Some commercial data warehousing systems support schema-level lineage tracing, or provide specialized drill-down and/or drill-through facilities for multi-dimensional warehouse views. Our lineage tracing system supports more fine-grained instance-level lineage tracing for arbitrarily complex relational views, including aggregation. At view definition time, our system automatically generates lineage tracing procedures and supporting auxiliary views. At lineage tracing time, the system applies the tracing procedures to the source tables and/or auxiliary views to obtain the lineage results and to illustrate the specific view data derivation process.
Yingwei Cui, Jennifer Widom
ICDE1
2000 Performance Issues in Incremental Warehouse Maintenance
Wilburt Labio, Jun Yang 0001, Yingwei Cui, Hector Garcia-Molina, Jennifer Widom
VLDB3
2000 Tracing the lineage of view data in a warehousing environment
abstract
We consider the view data lineage problem in a warehousing environment: For a given data item in a materialized warehouse view, we want to identify the set of source data items that produced the view item. We formally define the lineage problem, develop lineage tracing algorithms for relational views with aggregation, and propose mechanisms for performing consistent lineage tracing in a multisource data warehousing environment. Our result can form the basis of a tool that allows analysts to browse warehouse data, select view tuples of interest, and then “drill-through” to examine the exact source tuples that produced the view tuples of interest.
Yingwei Cui, Jennifer Widom, Janet L. Wiener
ACM Trans. Database Syst.1
1998 Efficient PCS Call Setup Protocols
abstract
Increasing demand for wireless mobile communications, coupled with limited network resources, has motivated investigation into alternative efficient mobility management solutions. We consider wireless PCS call setup protocols. We propose a lightweight location lookup protocol, which significantly reduces the network signaling and setup delay during call setup. As an alternative, we consider a reverse connection setup protocol that also performs efficient call setup, while minimizing the cost of failed call attempts. The two protocols have different advantages, in particular when combined with location management techniques including HLR/VLR, HLR/VLR with partial replication, and HLR/VLR with caching. We study the combinations of call setup protocols with location management techniques and compare their performance to find the most efficient call setup schemes. Both analytical and simulation results are presented.
Yingwei Cui, Derek Lam, Jennifer Widom, Donald C. Cox
INFOCOM1