Kaizheng Du

dblp:56/652 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 1995
—ORCID · none

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

Databases, data management, data science and information retrieval · 4 · 1 first-authorArtificial intelligence and machine learning · 2 · 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
2 papers
Query processing and optimization · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Embedded and real-time systems · 100%

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

TopicWeightPapersLastEvidence papers
Query processing and optimization › online query processing
time-constrained query processing
0.021995
Time-Constrained Query Processing in CASE-DB · IEEE Trans. Knowl. Data Eng. 1995
Processing Real-Time, Non-Aggregate Queries with Time-Constraints in CASE-DB · ICDE 1992
Query processing and optimization
iterative query processing
0.011995
Time-Constrained Query Processing in CASE-DB · IEEE Trans. Knowl. Data Eng. 1995
Query processing and optimization › incremental computation
incremental query processing
0.011992
Processing Real-Time, Non-Aggregate Queries with Time-Constraints in CASE-DB · ICDE 1992
Query processing and optimization › online query processing
real-time query processing
0.011992
Processing Real-Time, Non-Aggregate Queries with Time-Constraints in CASE-DB · ICDE 1992
Query processing and optimization
approximate query processing
0.011995
Time-Constrained Query Processing in CASE-DB · IEEE Trans. Knowl. Data Eng. 1995

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

risk control · 0.0iterative query evaluation · 0.0incremental evaluation · 0.0
YearPublicationVenuePosition
1995 Time-Constrained Query Processing in CASE-DB
abstract
CASE-DB is a real-time, single-user, relational prototype DBMS that permits the specification of strict time constraints for relational algebra queries. Given a time constrained nonaggregate relational algebra query and a "fragment chain" for each relation involved in the query, CASE-DB initially obtains a response to a modified version of the query and then uses an "iterative query evaluation" technique to successively improve and evaluate the modified version of the query, CASE-DB controls the risk of overspending the time quota at each step using a "risk control technique".
Gultekin Özsoyoglu, Sujatha Guru Swamy, Kaizheng Du, Wen-Chi Hou
IEEE Trans. Knowl. Data Eng.3
1993 Modifying Datbase Queries and Error Constraints
Kaizheng Du, Gultekin Özsoyoglu
DEXA1
1992 Processing Real-Time, Non-Aggregate Queries with Time-Constraints in CASE-DB
abstract
The problem of time-constrained query evaluation in a single-user database management system (DBMS) is considered. CASE-DB is a real-time, single user, relational prototype DBMS that uses the relational algebra as its query language. Given a nonaggregate query and a fragment chain for each input relation of the query. CASE-DB uses iterative query evaluation techniques to obtain a response first to a modified version of the query, and then to successively improved versions of the query. CASE-DB controls the risk of overspending the time quota at each step using a risk control technique. For periodically occurring queries, CASE-DB uses incremental query evaluation techniques that make sure that each operator in the query has at least one operand relation which contains the changes in the last period, and is expected to be very small compared to the actual database relation.>
Gultekin Özsoyoglu, Kaizheng Du, Sujatha Guru Swamy, Wen-Chi Hou
ICDE2
1991 On Estimating COUNT, SUM, and AVERAGE
Gultekin Özsoyoglu, Kaizheng Du, A. Tjahjana, Wen-Chi Hou, D. Y. Rowland
DEXA2