arrow
返回

Parallel processing of spatial batch-queries using xBR+-trees in solid-state drives

delete2019-11-09
delete8
PRE
AI
G
George Roumelis
P
Polychronis Velentzas
M
Michael Vassilakopoulos *
A
Antonio Corral
A
Athanasios Fevgas
Y
Yannis Manolopoulos
DOI:10.1007/s10586-019-03013-0delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Efficient query processing in spatial databases is of vital importance for numerous modern applications. In most cases, such processing is accomplished by taking advantage of spatial indexes. The xBR+-tree is an index for point data which has been shown to outperform indexes belonging to the R-tree family. On the other hand, Solid-State Drives (SSDs) are secondary storage devices that exhibit higher (especially read) performance than Hard Disk Drives and nowadays are being used in database systems. Regarding query processing, the higher performance of SSDs is maximized when large sequences of queries (batch queries) are executed by exploiting the massive I/O advantages of SSDs. Moreover, nowadays each CPU contains multiple cores which can be utilized to perform calculations in parallel and further improve performance of query processing. In this paper, we present algorithms for processing common spatial (point-location, window and distance-range) batch queries using xBR+-trees in SSDs. Next, we transform these algorithms to additionally take advantage of the multiple CPU cores. Moreover, utilizing small and large datasets, we experimentally study the performance of these new, SSD based, algorithms against processing of batch queries by repeatedly applying existing algorithms for these queries. We further study the performance of the algorithms that utilize parallelism against the ones taking advantage of SSDs only. Our experiments show that the new algorithms taking advantage of SSDs and even further the ones that also utilize multiple cores prevail performance-wise. Nevertheless, we discuss how these new parallel algorithms can be extended to work in a distributed environment, taking advantage of parallelism between machines, while processing data of larger scales.
Keyword:
Spatial indexes
xBR(+)-trees
Query processing
Solid-state drives
Multi-core CPUs
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

C
Cluster Computing-The Journal of Networks Software Tools and Applications
IF:
4.1
论文数:
5.1K
被引数:
7.5K

机构

O
Open University of Cyprus
学者数:
293
论文数: 357
被引数: 311
U
universidad de almeria
学者数:
4.4K
论文数: 4.0K
被引数: 1
U
University of Thessaly
学者数:
7.8K
论文数: 6.0K
被引数: 5.7K
学者 查看更多机构
引用论文

引用论文

Multidimensional access methods
err1998-06-01
err895
errOAAI
errGaede, V; Gunther, O
err分享
err收藏
err分享
err收藏
On Being ‘Shy like a Fox’
err1986-01-01
err0
PREAI
errC. R. Snyder; Timothy W. Smith
err分享
err收藏
Metal Recovery from E-wastes
err2022-11-15
err0
PREAI
errAgathe Hubau; Christopher George Bryan
err分享
err收藏
err分享
err收藏
Efficient query processing on large spatial databases: A performance study
err2017-10-01
err12
errOAAI
errRoumelis, George; Vassilakopoulos, Michael; Corral, Antonio; Manolopoulos, Yannis
err分享
err收藏
学者 查看更多内容