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

Ragaa Ishak

dblp:22/342 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1992
—ORCID · none

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

Databases, data management, data science and information retrieval · 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
1 paper
Indexing and storage engines · 62% Transaction processing and concurrency control · 19% Query processing and optimization · 19%

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

TopicWeightPapersLastEvidence papers
Indexing and storage engines
b-tree		 0.011992
Semantically Consistent Schedules for Efficient and Concurrent B-Tree Restructuring · ICDE 1992
Transaction processing and concurrency control
concurrency control		 0.011992
Semantically Consistent Schedules for Efficient and Concurrent B-Tree Restructuring · ICDE 1992
Query processing and optimization › query execution
concurrent query execution		 0.011992
Semantically Consistent Schedules for Efficient and Concurrent B-Tree Restructuring · ICDE 1992

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

semantic scheduling · 0.0
YearPublicationVenuePosition
1992 Semantically Consistent Schedules for Efficient and Concurrent B-Tree Restructuring
abstract
A concurrent B-tree algorithm can achieve more parallelism than a standard concurrency control method. The author presents a semantically based method for B-tree restructuring which allows efficient and concurrent traversals and fetches. The concurrent operations compare favorably with earlier solutions because they avoid wasted input/output (I/O). In addition, the concurrent B-tree algorithms considerably reduce the need to repeatedly traverse the tree in order to recover from the effect of in-progress restructuring. The method increases the performance of a high-volume database management system.>
Ragaa Ishak
 ICDE1