data reorganization
Recently Published Documents


TOTAL DOCUMENTS

50
(FIVE YEARS 7)

H-INDEX

9
(FIVE YEARS 0)

2021 ◽  
Vol 24 (2) ◽  
pp. 275-288
Author(s):  
Ruiyun Zhu ◽  
Yuji Misaki ◽  
Marcus Walldén ◽  
Fumihiko Ino

2021 ◽  
Vol 17 (1) ◽  
pp. 1-32
Author(s):  
Anastasios Papagiannis ◽  
Giorgos Saloustros ◽  
Giorgos Xanthakis ◽  
Giorgos Kalaentzis ◽  
Pilar Gonzalez-Ferez ◽  
...  

Persistent key-value stores have emerged as a main component in the data access path of modern data processing systems. However, they exhibit high CPU and I/O overhead. Nowadays, due to power limitations, it is important to reduce CPU overheads for data processing. In this article, we propose Kreon , a key-value store that targets servers with flash-based storage, where CPU overhead and I/O amplification are more significant bottlenecks compared to I/O randomness. We first observe that two significant sources of overhead in key-value stores are: (a) The use of compaction in Log-Structured Merge-Trees (LSM-Tree) that constantly perform merging and sorting of large data segments and (b) the use of an I/O cache to access devices, which incurs overhead even for data that reside in memory. To avoid these, Kreon performs data movement from level to level by using partial reorganization instead of full data reorganization via the use of a full index per-level. Kreon uses memory-mapped I/O via a custom kernel path to avoid a user-space cache. For a large dataset, Kreon reduces CPU cycles/op by up to 5.8×, reduces I/O amplification for inserts by up to 4.61×, and increases insert ops/s by up to 5.3×, compared to RocksDB.


2020 ◽  
Vol 16 (4) ◽  
pp. 1-31
Author(s):  
Qing Zheng ◽  
Charles D. Cranor ◽  
Ankush Jain ◽  
Gregory R. Ganger ◽  
Garth A. Gibson ◽  
...  

2020 ◽  
Vol 12 (11) ◽  
pp. 1724
Author(s):  
Alfred Mayalu ◽  
Kevin Kochersberger ◽  
Barry Jenkins ◽  
François Malassenet

This paper introduces a novel protocol for managing low altitude 3D aeronautical chart data to address the unique navigational challenges and collision risks associated with populated urban environments. Based on the Open Geospatial Consortium (OGC) 3D Tiles standard for geospatial data delivery, the proposed extension, called 3D Tiles Nav., uses a navigation-centric packet structure which automatically decomposes the navigable regions of space into hyperlocal navigation cells and encodes environmental surfaces that are potentially visible from each cell. The developed method is sensor agnostic and provides the ability to quickly and conservatively encode visibility directly from a region by enabling an expanded approach to viewshed analysis. In this approach, the navigation cells themselves are used to represent the intrinsic positional uncertainty often needed for navigation. Furthermore, we present in detail this new data format and its unique features as well as a candidate framework illustrating how an Unmanned Traffic Management (UTM) system could support trajectory-based operations and performance-based navigation in the urban canyon. Our results, experiments, and simulations conclude that this data reorganization enables 3D map streaming using less bandwidth and efficient 3D map-matching systems with limited on-board compute, storage, and sensor resources.


2018 ◽  
Vol 79 ◽  
pp. 618-629 ◽  
Author(s):  
Anton Spivak ◽  
Andrew Razumovskiy ◽  
Denis Nasonov ◽  
Alexander Boukhanovsky ◽  
Anton Redice
Keyword(s):  

2016 ◽  
Vol 27 (12) ◽  
pp. 3687-3700 ◽  
Author(s):  
Guangyan Zhang ◽  
Guiyong Wu ◽  
Yu Lu ◽  
Jie Wu ◽  
Weimin Zheng
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document