Name
Abstract | ||
|---|---|---|
We address the problem of maintaining the correct answer-sets to the Conditional Maximizing Range-Sum (C-MaxRS) query in spatial data streams. Given a set of (possibly weighted) 2D point objects, the traditional MaxRS problem determines an optimal placement for an axes-parallel rectangle r so that the number -- or, the weighted sum -- of objects in its interior is maximized. In many practical settings, the objects from a particular set -- e.g., restaurants -- can be of distinct types -- e.g., fast-food, Asian, etc. The C-MaxRS problem deals with maximizing the overall sum, given class-based existential constraints, i.e., a lower bound on the count of objects of interests from particular classes. We first propose an efficient algorithm to the static C-MaxRS query, and extend the solution to handle dynamic (data streams) settings. Our experiments over datasets of up to 100,000 objects show that the proposed solutions provide significant efficiency benefits. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1145/3085504.3085517 | SSDBM |
Keywords | Field | DocType |
Maximizing Range Sum Query,Constrained Query Processing,Spatial Data Streams,C-MaxRS,Conditional MaxRS | Spatial analysis,Data mining,Data stream mining,Computer science,Upper and lower bounds,Rectangle,Theoretical computer science,STREAMS,Database | Conference |
Citations | PageRank | References |
0 | 0.34 | 19 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mir Imtiaz Mostafiz | 1 | 0 | 0.34 |
| S. M. Farabi Mahmud | 2 | 0 | 0.34 |
| Muhammed Mas-ud Hussain | 3 | 12 | 3.43 |
| Mohammed Eunus Ali | 4 | 260 | 31.28 |
| Goce Trajcevski | 5 | 1732 | 141.26 |