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

Tetsuo Mizoguchi

dblp:21/2452 · DBLP profile ↗
← Back
4ranked-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 · 3Theory of computation · 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
3 papers
Database system architecture and tuning · 75% Data models and query languages · 16% Indexing and storage engines · 10%
Theoretical computer science
1 paper
Algorithms and data structures · 87% Mathematical optimization · 13%

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

TopicWeightPapersLastEvidence papers
Database system architecture and tuning › engineering data management
engineering databases
0.011984
An Advanced Database System ADAM - Towards Integrated Management of Engineering Data · ICDE 1984
Database system architecture and tuning
engineering data management
0.011984
An Advanced Database System ADAM - Towards Integrated Management of Engineering Data · ICDE 1984
Algorithms and data structures
selection
0.011978
Selecting the Kth element in X + Y and X_1 + X_2 + ... + X_m · SIAM J. Comput. 1978
Data models and query languages
relational model
0.011986
An Extended Relational Database System and It's Application to Management of Logic Diagrama · VLDB 1986
Data models and query languages › conceptual modeling
semantic data model
0.011984
An Advanced Database System ADAM - Towards Integrated Management of Engineering Data · ICDE 1984
Mathematical optimization
combinatorial optimization
0.011978
Selecting the Kth element in X + Y and X_1 + X_2 + ... + X_m · SIAM J. Comput. 1978

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

relational model · 0.0computer graphics · 0.0heap-based selection · 0.0divide-and-conquer · 0.0
YearPublicationVenuePosition
1986 An Extended Relational Database System and It's Application to Management of Logic Diagrama
Yosihisa Udagawa, Tetsuo Mizoguchi
VLDB2
1984 An Advanced Database System ADAM - Towards Integrated Management of Engineering Data
abstract
In order to achieve consistent management of design and analysis of engineering objects, data in engineering applications are required to be manipulated in an integrated manner. Engineering data comprise attributes, structural and pictorial information. ADAM uses the relational model as a basis for representing attributes information and structures of engineering data. As for pictorial information, ADAM data definition language provides figure specification parts where pictorial notations of instances are represented in terms of functions in computer graphics. In this paper, we observe engineering data and give some considerations on them. Four essential features of engineering data are discussed. Data definition and manipulation facilities of ADAM are presented. Instances with arguments are introduced for managing complex structures of engineering data and repeated appearances of similar objects. A graphic algorithm is discussed, which allows users to retrieve pictures in any intended details.
Yosihisa Udagawa, Tetsuo Mizoguchi
ICDE2
1978 An Analysis of Storage Utilization Factor in Block Split Data Structuring Scheme
Toshiyuki Nakamura, Tetsuo Mizoguchi
VLDB2
1978 Selecting the Kth element in X + Y and X_1 + X_2 + ... + X_m
abstract
An algorithm is given which selects the Kth element in $X + Y$ in $O(n\log n)$ time and $O(n)$ space, where $X + Y$ is the multiset $\{ x_i + y_j | x_i \in X\text{ and } y_j \in Y\} $ for $X = (x_1 ,x_2 , \cdots ,x_n )$ and $Y = (y_1 ,y_2 , \cdots ,y_n )$, n-tuples of real numbers. The results are extended to $\sum_{i = 1}^m {X_i } $ for $m > 2$. There is strong evidence that this more general problem is difficult if m and K may be selected arbitrarily. However, algorithms can be shown which are fast for small K and arbitrary m.
Donald B. Johnson 0001, Tetsuo Mizoguchi
SIAM J. Comput.2