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 VLDB 2026 / reviewers in the wild / expert

J. H. Mommens

dblp:41/4386 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1975
—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
Database system architecture and tuning · 77% Data models and query languages · 23%

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

TopicWeightPapersLastEvidence papers
Database system architecture and tuning › database design
physical database design		 0.011975
Automatic Generation of Physical Data Base Structures · SIGMOD Conference 1975
Data models and query languages › data modeling
hierarchical data model		 0.011975
Automatic Generation of Physical Data Base Structures · SIGMOD Conference 1975

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

state diagram · 0.0depth-first tree search · 0.0
YearPublicationVenuePosition
1975 Automatic Generation of Physical Data Base Structures
abstract
This paper addresses a problem which arises during the design of an integrated data base: this is to generate a set of physical data structures capable of supporting a desired set of logical data structures. A prototype design aid which generates physical data structures for IMS is described. A state diagram is used to represent the constraints imposed by IMS, and a modified depth first tree search is used to find the physical data structures. One can force the solution to either satisfy bounds on one or more objective functions, and/or optimize a single objective function.
J. H. Mommens, Stephen E. Smith
 SIGMOD Conference1