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

Mitsuru Sato

dblp:16/407 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
1since 2021 · last 2023
—ORCID · conflict

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

Databases, data management, data science and information retrieval · 2Artificial intelligence and machine learning · 1Systems, architecture and hardware · 1 · 1 since 2021

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 · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Memory systems · 100%

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

TopicWeightPapersLastEvidence papers
Indexing and storage engines › storage management
non-volatile memory integration
0.312018
Managing Non-Volatile Memory in Database Systems · SIGMOD Conference 2018
Memory systems
non-volatile memory
0.312018
Managing Non-Volatile Memory in Database Systems · SIGMOD Conference 2018

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

page-based DRAM caching · 0.7byte-addressable storage · 0.7
YearPublicationVenuePosition
2023 Towards Less Operating System Noise: An Approach with Data Processing Unit
abstract
High performance computing (HPC) cloud, which is a fusion of HPC and cloud, is receiving much attention due to growing demand for large-scale computing. The HPC cloud is targeted for running HPC-derived applications, but it requires solving an HPC-specific challenge, namely operating system (OS) noise. Herein, we focus on the OS noise caused by asynchronous I/O processing and propose offloading it to data processing unit (DPU).
Jun Kato 0007, Koki Kusunoki, Mitsuru Sato
SYSTOR3
2018 Managing Non-Volatile Memory in Database Systems
abstract
Non-volatile memory (NVM) is a new storage technology that combines the performance and byte addressability of DRAM with the persistence of traditional storage devices like flash (SSD). While these properties make NVM highly promising, it is not yet clear how to best integrate NVM into the storage layer of modern database systems. Two system designs have been proposed. The first is to use NVM exclusively, i.e., to store all data and index structures on it. However, because NVM has a higher latency than DRAM, this design can be less efficient than main-memory database systems. For this reason, the second approach uses a page-based DRAM cache in front of NVM. This approach, however, does not utilize the byte addressability of NVM and, as a result, accessing an uncached tuple on NVM requires retrieving an entire page.
Alexander van Renen, Viktor Leis, Alfons Kemper, Thomas Neumann 0001, Takushi Hashida, Kazuichi Oe, Yoshiyasu Doi, Lilian Harada, Mitsuru Sato
SIGMOD Conference9
2008 Answering Any Class of Japanese Non-factoid Question by Using the Web and Example Q&A Pairs from a Social Q&A Website
abstract
In this paper, we propose a method of non-factoid Web question-answering that can uniformly deal with any class of Japanese non-factoid question by using a large number of example Q&A pairs. Instead of preparing classes of questions beforehand, the method retrieves already asked question examples similar to a submitted question from a set of Q&A pairs. Then, instead of preparing clue expressions for the writing style of answers according to each question class beforehand, it dynamically extracts clue expressions from the answer examples corresponding to the retrieved question examples. This clue expression information is combined with topical content information from the question to extract appropriate answer candidates. The experimental results showed that the clue expressions obtained from the set of examples improved the accuracy of answer candidate extraction.
Tatsunori Mori, Mitsuru Sato, Madoka Ishioroshi
Web Intelligence2