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

Jacob Odgård Tørring

dblp:288/0033 · also Jacob O. Tørring · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2025
0000-0002-9385-7948ORCID · reported

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

Systems, architecture and hardware · 1 · 1 since 2021Databases, data management, data science and information retrieval · 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
Information retrieval · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Storage systems · 100%

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

TopicWeightPapersLastEvidence papers
Information retrieval › search engines
full-text search
0.912025
LogCloud: Fast Search of Compressed Logs on Object Storage · Proc. VLDB Endow. 2025
Information retrieval
search engines
0.912025
LogCloud: Fast Search of Compressed Logs on Object Storage · Proc. VLDB Endow. 2025
Storage systems
log management
0.912025
LogCloud: Fast Search of Compressed Logs on Object Storage · Proc. VLDB Endow. 2025
Storage systems
object storage
0.312025
LogCloud: Fast Search of Compressed Logs on Object Storage · Proc. VLDB Endow. 2025

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

inverted index · 1.7FM-index · 1.7
YearPublicationVenuePosition
2025 LogCloud: Fast Search of Compressed Logs on Object Storage
abstract
Large organizations emit terabytes of logs every day in their cloud environment. Efficient data science on these logs via text search is crucial for gleaning operational insights and debugging production outages. Current log management systems either perform full-text indexing on a cluster of dedicated servers to provide efficient search at the expense of high storage cost, or store unindexed compressed logs on object storage at the expense of high search cost. We propose LogCloud, a new object-storage based log management system that supports both cheap compressed log storage and efficient search. LogCloud constructs inverted indices on compressed logs using a novel FM-index implementation that supports efficient querying from object storage directly, removing the need for dedicated indexing servers. Experiments on five public and five production log datasets show that LogCloud can achieve both cheap storage and search, scaling to TB-scale datasets.
Junyu Wei, Alex Aiken, Guangyan Zhang, Jacob Odgård Tørring, Rain Jiang
Proc. VLDB Endow.5
2024 A methodology for comparing optimization algorithms for auto-tuning
abstract
Adapting applications to optimally utilize available hardware is no mean feat: the plethora of choices for optimization techniques are infeasible to maximize manually. To this end, auto-tuning frameworks are used to automate this task, which in turn use optimization algorithms to efficiently search the vast searchspaces. However, there is a lack of comparability in studies presenting advances in auto-tuning frameworks and the optimization algorithms incorporated. As each publication varies in the way experiments are conducted, metrics used, and results reported, comparing the performance of optimization algorithms among publications is infeasible. The auto-tuning community identified this as a key challenge at the 2022 Lorentz Center workshop on auto-tuning. The examination of the current state of the practice in this paper further underlines this. We propose a community-driven methodology composed of four steps regarding experimental setup, tuning budget, dealing with stochasticity, and quantifying performance. This methodology builds upon similar methodologies in other fields while taking into account the constraints and specific characteristics of the auto-tuning field, resulting in novel techniques. The methodology is demonstrated in a simple case study that compares the performance of several optimization algorithms used to auto-tune CUDA kernels on a set of modern GPUs. We provide a software tool to make the application of the methodology easy for authors, and simplifies reproducibility of results.
Floris-Jan Willemsen, Richard Schoonhoven, Jiri Filipovic, Jacob Odgård Tørring, Rob van Nieuwpoort, Ben van Werkhoven
Future Gener. Comput. Syst.4