• English
    • Ελληνικά
    • Deutsch
    • français
    • italiano
    • español
  • italiano 
    • English
    • Ελληνικά
    • Deutsch
    • français
    • italiano
    • español
  • Login
Mostra Item 
  •   DSpace Home
  • Επιστημονικές Δημοσιεύσεις Μελών ΠΘ (ΕΔΠΘ)
  • Δημοσιεύσεις σε περιοδικά, συνέδρια, κεφάλαια βιβλίων κλπ.
  • Mostra Item
  •   DSpace Home
  • Επιστημονικές Δημοσιεύσεις Μελών ΠΘ (ΕΔΠΘ)
  • Δημοσιεύσεις σε περιοδικά, συνέδρια, κεφάλαια βιβλίων κλπ.
  • Mostra Item
JavaScript is disabled for your browser. Some features of this site may not work without it.
Tutto DSpace
  • Archivi & Collezioni
  • Data di pubblicazione
  • Autori
  • Titoli
  • Soggetti

LB-Grid: An SSD efficient Grid File

Thumbnail
Autore
Fevgas A., Bozanis P.
Data
2019
Language
en
DOI
10.1016/j.datak.2019.04.002
Soggetto
Bandwidth
Drives
Efficiency
Indexing (of information)
Information management
Indexing methods
Latest development
Non-volatile memory technology
Performance analysis
Solid state drives
Solid state drives (SSD)
Spatial database
Spatial query processing
Flash-based SSDs
Elsevier B.V.
Mostra tutti i dati dell'item
Abstract
Recent advances in non-volatile memory technology have led to the introduction of solid state drives (SSD). NVMe SSDs are the latest development in flash based solid state drives and they were designed as a means of low latency and high bandwidth. Many research studies seek for taking advantage of this new technology to accelerate data management. Multidimensional indexes are fundamental for the efficiency of spatial query processing. In this work, we study the implication of high performance NVMe drives on spatial indexing. More specifically, we present an in-depth performance analysis of the Grid File in flash storage and we introduce LB-Grid, a write efficient variant of Grid File for flash based solid state drives. We present new query algorithms for both LB-Grid and Grid File that exploit the high internal parallelism and I/O bandwidth of NVMe SSDs. Experimental results unveil the efficiency of the proposed algorithms. Utilizing a test set of 500M points, LB-Grid appears to be up to 2.26 times faster than Grid File, up to 5.5 times faster than the R∗-tree, and up to 3.3 times faster than the FAST-Rtree in update intensive workloads. On the other hand, the Grid File presents better performance in read intensive workloads; exploiting a batch read operation, it achieves a speedup up to 10.2x in range queries, up to 1.56x in kNN and 4.6x in group point queries. © 2019 Elsevier B.V.
URI
http://hdl.handle.net/11615/71544
Collections
  • Δημοσιεύσεις σε περιοδικά, συνέδρια, κεφάλαια βιβλίων κλπ. [19743]
htmlmap 

 

Ricerca

Tutto DSpaceArchivi & CollezioniData di pubblicazioneAutoriTitoliSoggettiQuesta CollezioneData di pubblicazioneAutoriTitoliSoggetti

My Account

LoginRegistrazione
Help Contact
DepositionAboutHelpContattaci
Choose LanguageTutto DSpace
EnglishΕλληνικά
htmlmap