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

Hidetoshi Monoi

dblp:43/4187 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1989
—ORCID · none

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

Databases, data management, data science and information retrieval · 2 · 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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Hardware accelerators and domain-specific architectures · 77% Parallel and multicore computing · 23%
Databases, data mining, and information retrieval
1 paper
Query processing and optimization · 100%

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

TopicWeightPapersLastEvidence papers
Query processing and optimization
join processing
0.011988
Parallel Control Technique and Performance of an MPPM Knowledge-Base Machine · ICDE 1988
Parallel and multicore computing
parallel query processing
0.011988
Parallel Control Technique and Performance of an MPPM Knowledge-Base Machine · ICDE 1988

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

unification engine · 0.0parallel control · 0.0multiport page-memory · 0.0
YearPublicationVenuePosition
1989 Knowledge Base System in a Logic Programming Paradigm
Hidenori Itoh, Hidetoshi Monoi, Hirohisa Seki
DASFAA2
1988 Parallel Control Technique and Performance of an MPPM Knowledge-Base Machine
abstract
A description is given of parallel control techniques and performance evaluations by simulation for the knowledge-base machine (KBM) using the multiport page-memory (MPPM) and the unification engine (UE). Relational knowledge base retrieval requires repeated application of the unification-join (U-join) operations on term relations. It also requires each U-join to be dynamically scheduled, observing the result of the previously executed U-join. Control techniques to execute the query process of the relational knowledge base effectively in the KBM using the MPPM and the UE have been investigated. For parallel execution of coarse-grain operations, each operation is decomposed to concurrently executable fine-grain operations by partitioning input data sets. A number of features that depend on processor-allocation strategies have been identified. In particular, it was found that query processing resulting in repetitions of the retrieval operation, by a certain control strategy, increases the amount of the total data transfer to the highly parallel UEs and lowers processing efficiency.>
Hidetoshi Monoi, Yukihiro Morita, Hidenori Itoh, Hiroshi Sakai, Shigeki Shibayama
ICDE1