Name
Abstract | ||
|---|---|---|
Skyline query is important in the circumstances that require the support of decision making. The existing work on skyline queries is based mainly on the assumption that the datasets are static. Querying skylines over moving objects, however, is also important and requires more attention. In this paper, we propose a framework, namely PRISMO, for processing predictive skyline queries over moving objects that not only contain spatio-temporal information, but also include non-spatial dimensions, such as other dynamic and static attributes. We present two schemes, RBBS (branch-and-bound skyline with rescanning and repacking) and TPBBS (time-parameterized branch-and-bound skyline), each with two alternative methods, to handle predictive skyline computation. The basic TPBBS is further extended to TPBBSE (TPBBS with expansion) to enhance the performance of memory space consumption and CPU time. Our schemes are flexible and thus can process point, range, and subspace predictive skyline queries. Extensive experiments show that our proposed schemes can handle predictive skyline queries effectively, and that TPBBS significantly outperforms RBBS. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1631/jzus.C10a0728 | Journal of Zhejiang University: Science C |
Keywords | Field | DocType |
moving object,spatio-temporal database,skyline | Skyline,Data mining,Subspace topology,CPU time,Computer science,Skyline computation | Journal |
Volume | Issue | ISSN |
13 | 2 | 1869196X |
Citations | PageRank | References |
2 | 0.40 | 28 |
Authors | ||
9 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nan Chen | 1 | 16 | 2.03 |
| Nan Chen | 2 | 16 | 2.03 |
| Lidan Shou | 3 | 370 | 48.66 |
| Lidan Shou | 4 | 370 | 48.66 |
| Gang Chen | 5 | 712 | 75.60 |
| yunjun | 6 | 2 | 0.40 |
| Yunjun Gao | 7 | 862 | 89.71 |
| Jinxiang Dong | 8 | 311 | 65.36 |
| Jinxiang Dong | 9 | 311 | 65.36 |