Spatial Data Management over Flash Memory

Transcription

1 Spatial Data Management over Flash Memory Ioannis Koltsidas 1 and Stratis D. Viglas 2 1 IBM Research, Zurich, Switzerland iko@zurich.ibm.com 2 School of Informatics, University of Edinburgh, UK sviglas@inf.ed.ac.uk Abstract. We present desiderata for improved i/o performance of spatial data structures over flash memory and hybrid flash-magnetic storage configurations. We target the organization of the data structures and the management of the in-memory buffer pool when dealing with spatial data. Our proposals are based on the fundamentals of flash memory, thereby increasing the likelihood of being immune to future trends. 1 Introduction Flash memory has moved from being used for short-term, low-volume storage and data transfer, to becoming the primary alternative to magnetic disks for longterm, high-volume and persistent storage. Appearing in systems as disparate as pdas, handheld tablets, laptops and desktops, enterprise servers and clusters, it is one of the most ubiquitous storage media on the market. At the same time, the proliferation of location-based services means that spatial data management techniques acquire increasing traction. As a result, access to and processing of spatial data moves from highly customized application scenarios to commodity ones. The combination of these two trends necessitates revisiting spatial data management for flash memory both at the server and at the client levels. In this paper we will present ideas that we posit are imperatives when it comes to high-performing techniques for flash-resident spatial data. Solid state drives, orssds, are arrays of flash memory chips packaged in a single enclosure with a controller. An ssd is presented to the operating system as a single storage device using the same interface as traditional hdds (e.g., sata). The similarities between the two types of storage medium, however, stop here. The key characteristics of ssds are(a) the lack of mechanical moving parts; (b) the asymmetry between their read and write latencies; and (c) theirerasebefore-write limitation. The first characteristic means that there is no difference between sequential and random access latencies. erformance is not penalized by being dependent on the seek time or the rotational delay, as is the case for hdds. The second characteristic has to do with the physical characteristics of flash memory, which make reading the value of a flash memory cell faster than changing it; therefore, reads are in general faster than writes. The discrepancy between read and write latencies is further influenced by the underlying technology of flash memory and, in particular, by how many bits are stored in each D. foser et al. (Eds.): SSTD 2011, NCS 6849, pp , c Springer-Verlag Berlin Heidelberg 2011

2 450 I. Koltsidas and S.D. Viglas cell: a single-level cell (slc) device can store a single bit, while a multi-level cell (mlc) can store two bits. slc devices inherently have higher performance but lower density; on the other hand, mlc devices have higher density but lower performance. Finally, the third characteristic stems for the inherent properties of ssds: to update an already written flash page, the controller must first erase it and then overwrite it. Erasures are performed at an erase unit granularity, where each erase unit is a flash block, i.e., a number of contiguous flash pages. A garbage collection mechanism is required to reclaim flash blocks as pages become invalid due to user overwrites. This is especially detrimental to the performance of random write workloads: random writes result in continuously erasing blocks and moving data at the flash level. It is not uncommon for the random write throughput to be five times less than the random read throughput for slc devices; or even up to two orders of magnitude less for mlc devices. Though approaches for efficient spatial data structures have been proposed [1,5], clearly, data management over flash memory requires rethinking our priorities and not improving performance in specific cases. To complicate the situation, existing hdd-based hardware is not going to disappear any time soon; the trend is towards augmenting hdd storage with flash memory. It is therefore imperative to design towards hybrid storage configurations employing both ssds and hdds. We propose ways to tackle spatial data management in flash and hybrid setups for the applications of the foreseeable future. We cannot claim that these ideas will be future-proof; however, we solidly ground them on the inherent characteristics of flash memory, thereby increasing their potential for applicability. We do not require any flash features be exposed apart from a standard i/o interface. Our proposals revolve around two axes: the organization of spatial data structures in ssd-only as well as in hybrid configurations, and the management of pages belonging to spatial data structures once the pages have been brought in main memory. In what follows we will present each axis in turn. 2 Data Structure Organization One of the key goals of secondary storage data structures is performance guarantees. For instance, the best performing spatial data structures are balanced trees. Their guarantee is that all paths from root to leaves are of equal length. This is achieved through bottom-up management algorithms: insertions and deletions cause splits and merges at the leaves; these splits and merges are recursively applied in the bottom-up traversal and propagate higher up in the tree; resulting in the tree having its height increased or decreased. Such algorithms make perfect sense for structures over hdds where the read and write costs are uniform. Consider, however, the read/write discrepancy of ssds and an insertion like the one of Fig. 1. Typically, as shown in the left part, an insertion to a full leaf will cause a split of the leaf into itself and a sibling S; and an update at the original leaf s parent with the new bounding box for ; and the insertion of the bounding box for S. To balance the tree we must perform three disk writes. An alternative, instead of splitting into and S, is to allow to overflow into

3 Spatial Data Management over Flash Memory 451 balanced insertion unbalanced insertion S original setup S Fig. 1. Balanced vs. unbalanced insertions S and we not update,since s bounding box has not changed (right part of Fig. 1). Thus, instead of performing three writes, we perform one: only for S. Assume now that the ratio between write and read is x, i.e., reading is x times faster than writing. Depending on the application, the cost associated with each type of operation may be any combination of the latency and throughput of the ssd for that type of operation. Saving two writes during insertion and causing the imbalance means that we have saved 2x time units: any operation that will read would have read it anyway; any operation having to access S too, would have accessed it anyway, but going through a direct child pointer from.thus, the structure overall has x time units to spare with respect to its optimal form (i.e., the fully balanced one). Then, we allow this imbalance and maintain a counter c at that measures how many times the overflow pointer to S has been traversed. As long as c<x, the data structure still is more efficient; once c = x we can rebalance it by propagating the bounding box from S to,thereby expensing the write we saved in the first place. This idea can work across all levels of the tree, though one must be careful to avoid long overflow chains. In such cases rebalancing can be prioritized using global rather than local metrics. In a typical scenario, the savings will be substantial. As the tree structure grows, the likelihood of a single leaf being bombarded with read or write requests decreases for all typical scenarios. Thus, the likelihood of the tree s imbalance paying off increases. Though generally applicable to all tree structures, catering for imbalance is more likely to pay off for spatial data and location-based applications: the update rate of the spatial data is low, while the point queries themselves are highly volatile as users move about the area. Observations like the one that lead to unbalanced structures can be generalized for hybrid configurations. In more detail, and for a tree structure, the likelihood of having to write data increases as we descend the tree. One might then consider placing the different parts of the tree structure on different media. The top levels of the tree have a read-intensive workload, used to direct searches. Whereas the bottom levels of the tree might have an update-intensive workload; moreover, the likelihood of an update being propagated upstream decreases with the height of the tree. It might then be conducive to place the write-intensive leavesofthetreeonthehdd and the read-intensive index nodes on the ssd [3].

4 452 I. Koltsidas and S.D. Viglas Coupled with the previous idea of keeping the flash-resident portion of the tree unbalanced, this will result in further performance boosts. 3 Buffer Management The next issue to focus on is buffering spatial data from the ssd into main memory. As is usually the case, we assume demand paging: data pages can only be processed in main memory and they are brought from the ssd into main memory only on reference. Main memory is of limited capacity and smaller than the capacity of the ssd; thus, only a subset of the flash-resident data pages can be kept in main memory at any point in time. Once the memory is full, data pages will be evicted to make room for new ones. There has been a substantial body of research targeting general buffer management for ssds [2,4]. Tailoring the approaches to spatial data, in conjunction with the i/o asymmetry of ssds, offers further room for improvement. Consider a location-based application which continuously accesses a spatial data index for information (e.g., points of interest close to the user s location). Such an application will generate multiple hot paths in the index, tracking the user s motion. As the user moves about, the paths followed from the root of the tree to the leaves will be constantly changing. Therefore, using simple reference counts as the eviction decision metric, though correct, can be further improved. By predicting the motion we can make more informed decisions regarding which pages to keep in the buffer pool and which have a lower probability of being referenced in the future. By selectively caching the parts of the indexed space that are more likely to receive updates, a lot of flash writes, and thereby, erasures can be avoided. Coupled with cost-based replacement policies [3], such an approach can improve i/o performance. One might even envision horizontal or vertical tree partitioning and placement based on access frequency and storage capabilities. 4 Conclusions and Outlook While ssds are attracting more traction from the research community and industry alike, surprisingly enough, one of the areas that is under-represented is spatial data management over flash memory. We have presented some initial ideas on improving the performance of flash-resident spatial data structures. One of the aspects we did not address is endurance and wear-leveling. More precisely, each flash cell can only be written to a fixed number of times. Thus, the controller spreads writes evenly throughout the flash chips and maintains a mapping between logical block identifiers and physical ones, through a software layer called the flash translation layer, orftl. While ftl algorithms are typically inaccessible to the user, some ssd manufacturers are now pushing more of that functionality to the os driver level; in addition, ssd-specific commands have lately been introduced, giving direct control to the filesystem for some flash operations (e.g., the trim command for explicitly erasing blocks). In light of that, the ideas presented in the previous sections can be more efficiently coupled with the ssd andresultinfurtheri/o savings.

5 Spatial Data Management over Flash Memory 453 References 1. Emrich, T., et al.: On the impact of flash SSDs on spatial indexing. In: DAMON 2010 (2010) 2. Kim, H., Ahn, S.: BRU: a buffer management scheme for improving random writes in flash storage. In: FAST (2008) 3. Koltsidas, I., Viglas, S.D.: Flashing up the storage layer. roc. VDB Endow. 1(1), (2008) 4. ark, S.-Y., et al.: CFRU: a replacement algorithm for flash memory. In: CASES (2006) 5. Wu, C.-H., et al.: An efficient R-tree implementation over flash-memory storage systems. In: GIS (2003)