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

Qinsi Zhong

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

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

Databases, 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
Database system architecture and tuning · 61% Query processing and optimization · 30% Data models and query languages · 9%

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

TopicWeightPapersLastEvidence papers
Query processing and optimization › query planning
access path selection		 0.011986
An Approximation Algorithm for the Physical Access Path Selection in the CODASYL Environment · ICDE 1986
Database system architecture and tuning › database design › physical database design
index selection		 0.011986
An Approximation Algorithm for the Physical Access Path Selection in the CODASYL Environment · ICDE 1986
Database system architecture and tuning › database design
physical database design		 0.011986
An Approximation Algorithm for the Physical Access Path Selection in the CODASYL Environment · ICDE 1986
Data models and query languages › data modeling
network data model		 0.011986
An Approximation Algorithm for the Physical Access Path Selection in the CODASYL Environment · ICDE 1986

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

heuristic approximation algorithm · 0.0
YearPublicationVenuePosition
1986 An Approximation Algorithm for the Physical Access Path Selection in the CODASYL Environment
abstract
A heuristic algorithm for the selection of an optimal access path configuration for CODASYL databases is presented. This algorithm is based on the idea of extending index selection techniques proposed for relational systems to COD ASYL systems. The proposed approach has the worth effacing the physical design problem in a unified way; moreover, it allows for covering a large spectrum of physical decision variables, namely, location modes, set implementations, set orders and search keys.
Pasquale Rullo, Domenico Saccà, Qinsi Zhong
 ICDE3