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

Tatu Ylönen

dblp:22/2260 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
1since 2021 · last 2022
0000-0003-4180-1229ORCID · verified

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

Databases, data management, data science and information retrieval · 3Artificial intelligence and machine learning · 1 · 1 first-author · 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 Wiktextract: Wiktionary as Machine-Readable Structured Data
abstract
We present a machine-readable structured data version of Wiktionary. Unlike previous Wiktionary extractions, the new extractor, Wiktextract, fully interprets and expands templates and Lua modules in Wiktionary. This enables it to perform a more complete, robust, and maintainable extraction. The extracted data is multilingual and includes lemmas, inflected forms, translations, etymology, usage examples, pronunciations (including URLs of sound files), lexical and semantic relations, and various morphological, syntactic, semantic, topical, and dialectal annotations. We extract all data from the English Wiktionary. Comparing against previous extractions from language-specific dictionaries, we find that its coverage for non-English languages often matches or exceeds the coverage in the language-specific editions, with the added benefit that all glosses are in English. The data is freely available and regularly updated, enabling anyone to add more data and correct errors by editing Wiktionary. The extracted data is in JSON format and designed to be easy to use by researchers, downstream resources, and application developers.
Tatu Ylönen
LREC1
2004 On Classification of Strings
Eljas Soisalon-Soininen, Tatu Ylönen
SPIRE2
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.3
1995 Partial Strictness in Two-Phase Locking
Eljas Soisalon-Soininen, Tatu Ylönen
ICDT2