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
Demo Data from EDBT 2026 / reviewers in the wild / expert

Chih-Hung Wei

dblp:05/4182 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2000
—ORCID · none

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

Systems, architecture and hardware · 1Databases, data management, data science and information retrieval · 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
1 paper
Indexing and storage engines · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Embedded and real-time systems · 100%

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

TopicWeightPapersLastEvidence papers
Indexing and storage engines
b+-tree		 0.011999
Real-Time Data Access Control on B-Tree Index Structures · ICDE 1999
Embedded and real-time systems › real-time scheduling › resource sharing protocols
priority inheritance		 0.011999
Real-Time Data Access Control on B-Tree Index Structures · ICDE 1999
Embedded and real-time systems
real-time scheduling		 0.011999
Real-Time Data Access Control on B-Tree Index Structures · ICDE 1999

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

priority inheritance · 0.0b-tree rebalancing · 0.0
YearPublicationVenuePosition
2000 Real-Time Access Control and Reservation on B-Tree Indexed Data
Tei-Wei Kuo, Chih-Hung Wei, Kam-yiu Lam
 Real Time Syst.2
1999 Real-Time Data Access Control on B-Tree Index Structures
abstract
The paper proposes methodologies to control the access of B-tree-indexed data in a batch and real time fashion. Algorithms are proposed to insert, query, delete, and rebalance B-tree-indexed data based on non real time algorithms (P.M. Kerttu et al., 1996) and the idea of priority inheritance (L. Sha et al., 1990). We propose methodologies to reduce the number of disk I/Os to improve the system performance without introducing more priority inversion. The performance of our methodologies was evaluated by a series of experiments, for which we have some encouraging results.
Tei-Wei Kuo, Chih-Hung Wei, Kam-yiu Lam
 ICDE2