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.

Oleh-Yevhen Khavrona

dblp:411/0925 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
0009-0009-6650-6630ORCID · reported

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

Databases, 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
Spatial and temporal data management · 50% Indexing and storage engines · 50%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Reconfigurable computing and FPGAs · 77% Parallel and multicore computing · 23%

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

TopicWeightPapersLastEvidence papers
Indexing and storage engines › spatial index
r-tree traversal
0.912025
SwiftSpatial: Spatial Joins on Modern Hardware · Proc. ACM Manag. Data 2025
Spatial and temporal data management › spatial query processing
spatial join
0.912025
SwiftSpatial: Spatial Joins on Modern Hardware · Proc. ACM Manag. Data 2025
Reconfigurable computing and FPGAs
FPGA accelerator
0.912025
SwiftSpatial: Spatial Joins on Modern Hardware · Proc. ACM Manag. Data 2025
Parallel and multicore computing › parallelization strategies
hybrid parallelism
0.312025
SwiftSpatial: Spatial Joins on Modern Hardware · Proc. ACM Manag. Data 2025

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

r-tree · 1.7PBSM · 1.7FPGA · 1.7
YearPublicationVenuePosition
2025 SwiftSpatial: Spatial Joins on Modern Hardware
abstract
Spatial joins are among the most time-consuming spatial queries, remaining costly even in parallel and distributed systems. In this paper, we explore hardware acceleration for spatial joins by proposing SwiftSpatial, an FPGA-based accelerator that can be deployed in data centers and at the edge. SwiftSpatial contains multiple high-performance join units with innovative hybrid parallelism, several efficient memory management units, and an extensible on-chip join scheduler that supports the popular R-tree synchronous traversal and partition-based spatial-merge (PBSM) algorithms. Benchmarked against various CPU and GPU-based spatial data processing systems, SwiftSpatial demonstrates a latency reduction of up to 41.03x relative to the best-performing baseline, while requiring 6.16x less power. The performance and energy efficiency of SwiftSpatial demonstrate its potential to be used in a variety of configurations (e.g., as an accelerator, near storage, in-network) as well as on different devices (e.g., data centers where FPGAs are widely available or mobile devices, which also contain FPGAs for specialized processing).
Wenqi Jiang 0001, Oleh-Yevhen Khavrona, Martin Parvanov, Gustavo Alonso
Proc. ACM Manag. Data2