压缩数据上top-K矢量栅格查询的高效处理

2018 Data Compression Conference Pub Date : 2018-03-27 DOI:10.1109/DCC.2018.00063

Gilberto Gutiérrez, Susana Ladra, Juan R. Lopez, J. Paramá, Fernando Silva-Coira

{"title":"压缩数据上top-K矢量栅格查询的高效处理","authors":"Gilberto Gutiérrez, Susana Ladra, Juan R. Lopez, J. Paramá, Fernando Silva-Coira","doi":"10.1109/DCC.2018.00063","DOIUrl":null,"url":null,"abstract":"In this work, we propose an efficient algorithm for retrieving K polygons of a vector dataset that overlap cells of a raster dataset, such that the K polygons are those overlapping the highest (or lowest) cell values among all polygons.","PeriodicalId":137206,"journal":{"name":"2018 Data Compression Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Efficient Processing of top-K Vector-Raster Queries Over Compressed Data\",\"authors\":\"Gilberto Gutiérrez, Susana Ladra, Juan R. Lopez, J. Paramá, Fernando Silva-Coira\",\"doi\":\"10.1109/DCC.2018.00063\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this work, we propose an efficient algorithm for retrieving K polygons of a vector dataset that overlap cells of a raster dataset, such that the K polygons are those overlapping the highest (or lowest) cell values among all polygons.\",\"PeriodicalId\":137206,\"journal\":{\"name\":\"2018 Data Compression Conference\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-03-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 Data Compression Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DCC.2018.00063\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 Data Compression Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DCC.2018.00063","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

在这项工作中，我们提出了一种有效的算法，用于检索向量数据集的K个多边形，这些多边形与栅格数据集的单元重叠，使得K个多边形是所有多边形中重叠最高(或最低)单元值的多边形。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Efficient Processing of top-K Vector-Raster Queries Over Compressed Data

In this work, we propose an efficient algorithm for retrieving K polygons of a vector dataset that overlap cells of a raster dataset, such that the K polygons are those overlapping the highest (or lowest) cell values among all polygons.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2018 Data Compression Conference

自引率

0.00%

发文量