Abstract
Given a set of positive weighted points, the Maximizing Range Sum (maxRS) problem finds the placement of a query region r of given size such that the weight sum of points covered by r is maximized. This problem has long been studied since its wide application in spatial data mining, facility locating, and clustering problems. However, most of the existing work focus on Euclidean space, which is not applicable in many real-life cases. For example, in location-based services, the spatial data points can only be accessed by following certain underlying (road) network, rather than straight-line access. Thus in this paper, we study the maxRS problem with road network constraint, and propose an index-based method that solves the online queries highly efficiently.
| Original language | English |
|---|---|
| Title of host publication | Databases Theory and Applications - 27th Australasian Database Conference, ADC 2016, Proceedings |
| Editors | Muhammad Aamir Cheema, Wenjie Zhang, Lijun Chang |
| Publisher | Springer Verlag |
| Pages | 95-109 |
| Number of pages | 15 |
| ISBN (Print) | 9783319469218 |
| DOIs | |
| Publication status | Published - 2016 |
| Externally published | Yes |
| Event | 27th Australasian Database Conference on Databases Theory and Applications, ADC 2016 - Sydney, United States Duration: 28 Sept 2016 → 29 Sept 2016 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 9877 LNCS |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Conference
| Conference | 27th Australasian Database Conference on Databases Theory and Applications, ADC 2016 |
|---|---|
| Country/Territory | United States |
| City | Sydney |
| Period | 28/09/16 → 29/09/16 |
Bibliographical note
Publisher Copyright:© Springer International Publishing AG 2016.
Keywords
- Maximizing range sum
- Query processing
- Road network