Saved in:
Bibliographic Details
Main Authors: Yang, Wenzhe, Huang, Shixun, Wang, Sheng, Peng, Zhiyong
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2412.04853
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866916727733878784
author Yang, Wenzhe
Huang, Shixun
Wang, Sheng
Peng, Zhiyong
author_facet Yang, Wenzhe
Huang, Shixun
Wang, Sheng
Peng, Zhiyong
contents Data is undoubtedly becoming a commodity like oil, land, and labor in the 21st century. Although there have been many successful marketplaces for data trading, the existing data marketplaces lack consideration of the case where buyers want to acquire a collection of datasets (instead of one), and the overall spatial coverage and connectivity matter. In this paper, we take the first attempt to formulate this problem as Budgeted Maximum Coverage with Connectivity Constraint (BMCC), which aims to acquire a dataset collection with the maximum spatial coverage under a limited budget while maintaining spatial connectivity. To solve the problem, we propose two approximate algorithms with detailed theoretical guarantees and time complexity analysis, followed by two acceleration strategies to further improve the efficiency of the algorithm. Experiments are conducted on five real-world spatial dataset collections to verify the efficiency and effectiveness of our algorithms.
format Preprint
id arxiv_https___arxiv_org_abs_2412_04853
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Budgeted Spatial Data Acquisition: When Coverage and Connectivity Matter
Yang, Wenzhe
Huang, Shixun
Wang, Sheng
Peng, Zhiyong
Databases
Data is undoubtedly becoming a commodity like oil, land, and labor in the 21st century. Although there have been many successful marketplaces for data trading, the existing data marketplaces lack consideration of the case where buyers want to acquire a collection of datasets (instead of one), and the overall spatial coverage and connectivity matter. In this paper, we take the first attempt to formulate this problem as Budgeted Maximum Coverage with Connectivity Constraint (BMCC), which aims to acquire a dataset collection with the maximum spatial coverage under a limited budget while maintaining spatial connectivity. To solve the problem, we propose two approximate algorithms with detailed theoretical guarantees and time complexity analysis, followed by two acceleration strategies to further improve the efficiency of the algorithm. Experiments are conducted on five real-world spatial dataset collections to verify the efficiency and effectiveness of our algorithms.
title Budgeted Spatial Data Acquisition: When Coverage and Connectivity Matter
topic Databases
url https://arxiv.org/abs/2412.04853