COMTiles: a case study of a Cloud optimized tile archive format for deploying Planet-Scale Tilesets in the Cloud
This is a modal window.
The media could not be loaded, either because the server or network failed or because the format is not supported.
Formal Metadata
Title |
| |
Alternative Title |
| |
Title of Series | ||
Number of Parts | 266 | |
Author | ||
License | CC Attribution 3.0 Germany: You are free to use, adapt and copy, distribute and transmit the work or content in adapted or unchanged form for any legal purpose as long as the work is attributed to the author in the manner specified by the author or licensor. | |
Identifiers | 10.5446/66329 (DOI) | |
Publisher | ||
Release Date | ||
Language |
Content Metadata
Subject Area | ||
Genre | ||
Abstract |
|
00:00
Graphical user interfaceCASE <Informatik>ResultantObservational studyComputer animation
00:09
Observational studyCASE <Informatik>File formatMultiplication signFile archiverScaling (geometry)Mathematical optimizationResultantSet (mathematics)Automatic differentiationLevel (video gaming)Tessellation
00:44
Coordinate systemSystem programmingPrice indexRootRevision controlEmailScale (map)Metric systemData storage deviceGraph (mathematics)NumberApproximationReduction of orderVector spaceTesselationExtension (kinesiology)Sparse matrixSheaf (mathematics)NumberObject (grammar)Random accessTesselationDifferent (Kate Ryan album)Data storage deviceBitvektorMassSubject indexingSchwerpunktsystemMetric systemTessellationSheaf (mathematics)Term (mathematics)DivisorSpacetimeScaling (geometry)Observational studyReduction of orderGraphical user interfaceFile archiverCoordinate systemCurveDirected graphComputer fileSkeleton (computer programming)File formatField (computer science)Performance appraisalCASE <Informatik>Level (video gaming)Sound effectSlide ruleMereologyAdditionData compressionData structureLatent heatResultantSoftware testingPhysical systemBitContent (media)Total S.A.Group actionCodeCodierung <Programmierung>Graphics tabletPattern languageHeat transferMetadataInteractive televisionSinc functionVector spaceComputer animation
05:14
Price indexReduction of orderTesselationExtension (kinesiology)Sheaf (mathematics)Vector spaceComputer animation
Transcript: English(auto-generated)
00:08
Hello everyone, my name is Markus Remmel and today I want to present the results of a case study called COMTILES.
00:27
This case study deals with the optimization of cloud-optimized tile archive formats for large or planet-scale tilesets and should significantly reduce the access charges and simplify their workflow for deploying large tilesets in the cloud, known from sleeping map ads.
00:43
For deploying large geospatial data in the cloud, different cloud-optimized formats have been invented in recent years. Also, for storing massive tilesets, different cloud-optimized formats have been created, like for example PMTiles, which is the most widely used and leading one in this field.
01:02
In this case study, I tried to first improve these cloud-optimized container formats on the following topics shown on this slide by choosing a different file layout. The first requirement or goal is to support different tile-coordinate reference systems. Then also, the transferred amount of data and the number of requests should be minimized, compared to other formats.
01:25
Also, every tile in the archive should be requested with at most one additional request. As performance is crucial, fast decoding of the index should be achieved. To fulfill these requirements, a larger size of the total index has to be accepted, based
01:44
on the assumption that cloud storage is in general cheap and additional storage costs are negligible. To fulfill the specified requirements, I have experimented with different file layouts and then ended up with the following file structure.
02:02
First of all, there is a metadata section, which is based on an OGC specification, which enables the usage of different tile-coordinate systems. For specifying the offset and the size of specific tiles in the data section, an index is used. To minimize the number of transferred data and the number of requests, the index is basically divided into two parts.
02:26
The first part is a compressed group pyramid, which contains an overview of the most frequent access tiles, and in general is initially loaded. The second part is called index fragments and is used for lazy loading portions of the index.
02:44
Fragments offer random access to portions of the index as they have equal size. To evaluate the efficiency of the layout, I compared COM tiles with PM tiles based on three different metrics, which significantly impacted the user experience and cloud access charges.
03:08
For the transferred amounts of data from an object storage and the number of requests to a cloud object storage, two different realistic map interaction patterns have been selected. The first one is more zoom-focused, while the second one is more focused on a panning-based navigation pattern.
03:26
In both test cases, COM tiles outperform PM tiles by about factor 3 less downloaded amounts of data. In terms of the number of requests, both approaches showed no significant difference.
03:43
Another evaluation was comparing the decoding performance of the index. In that case, COM tiles outperform PM tiles by approximately 19 for a country-scale tileset and by approximately factor 63 for a planet-scale tileset. The performance advantages are basically based on the fact that COM tiles only uses
04:04
a lightweight bitpacking encoding, while PM tiles is using an advanced heavy byte compression. This results in a by approximately factor of 10 smaller size of the total index of a PM tiles archive compared to COM tiles. But as said before, since cloud storage costs are cheap, we are assuming that additional about 800 MB on necklace label.
04:30
To further reduce the access charges approach where individual tile requests are batched together were evaluated. This is possible since all tiles are ordered on a space filling curve.
04:41
In the test, this could reduce the number of requests by approximately 77%. Future work may include further reduction of the index size while continuing to meet the specified requirements. One approach is to specify the presence of an empty fragment and encode this based on a bit vector encoding.
05:05
This could reduce the total index size by about 50%. Thank you for your attention and I wish you all a nice FOSFETi conference.