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

Kerttu Pollari-Malmi

dblp:p/KPollariMalmi · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
1since 2021 · last 2022
0000-0003-2635-255XORCID · verified

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

Databases, data management, data science and information retrieval · 3 · 3 first-authorHuman-computer interaction and ubiquitous computing · 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 · 75% Transaction processing and concurrency control · 25%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Storage systems · 100%

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

TopicWeightPapersLastEvidence papers
Indexing and storage engines
batch update
0.011996
Concurrency Control in B-Trees with Batch Updates · IEEE Trans. Knowl. Data Eng. 1996
Indexing and storage engines
b-tree
0.011996
Concurrency Control in B-Trees with Batch Updates · IEEE Trans. Knowl. Data Eng. 1996
Transaction processing and concurrency control
concurrency control
0.011996
Concurrency Control in B-Trees with Batch Updates · IEEE Trans. Knowl. Data Eng. 1996
Indexing and storage engines › b-tree
concurrent b-tree
0.011996
Concurrency Control in B-Trees with Batch Updates · IEEE Trans. Knowl. Data Eng. 1996

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

concurrent search · 0.0batch insertion · 0.0
YearPublicationVenuePosition
2022 A Study of Worked Examples for SQL Programming
abstract
The paper focuses on a new type of interactive learning content for SQL programming - worked examples of SQL code. While worked examples are popular in learning programming, their application for learning SQL is limited. Using a novel tool for presenting interactive worked examples, Database Query Analyzer (DBQA), we performed a large-scale randomized controlled study assessing the value of worked examples as a new type of practice content in a database course. We report the results of the classroom study examining the usage and the impact of DBQA. Among other aspects, we explored the effect of textual step explanations provided by DBQA.
Kamil Akhuseyinoglu, Ryan Hardt, Jordan Barria-Pineda, Peter Brusilovsky, Kerttu Pollari-Malmi, Teemu Sirkiä, Lauri Malmi
ITiCSE (1)5
2004 Concurrency Control and I/O-Optimality in Bulk Insertion
Kerttu Pollari-Malmi, Eljas Soisalon-Soininen
SPIRE1
2000 Concurrency Control for B-Trees with Differential Indices
abstract
We present an indexing system where a database index is divided into two parts: the main index located on disk and the differential index in the main memory. Both indices are implemented as B-trees. All updates performed by active transactions are written in the differential index. Periodically, writes of committed transactions are transferred from differential index to the main index as a batch-update operation. Thus, updates falling into the same leaf of the tree can be performed simultaneously. In addition, the system offers a simple recovery scheme. After a system crash, no undo operations are needed and redo operations need only write to the main memory.
Kerttu Pollari-Malmi, Jarmo Ruuth, Eljas Soisalon-Soininen
IDEAS1
1996 Concurrency Control in B-Trees with Batch Updates
abstract
In many applications it is important to be able to insert (or delete) keys into a B-tree as a batch, instead of inserting them one by one. Moreover, it may be necessary to search the B-tree concurrently with the batch update. An example of this is a text database system supporting a newspaper house: all words (keys) of each article obtained from a news agency should be inserted at once, and, at the same time, searches for documents containing certain words should be allowed as efficiently as possible. We have designed two solutions to the problem of concurrent batch update. The first solution-implemented in our commercial text database system-optimizes the speed of the batch update, and the second solution optimizes the average search time during the batch update.
Kerttu Pollari-Malmi, Eljas Soisalon-Soininen, Tatu Ylönen
IEEE Trans. Knowl. Data Eng.1