| dc.contributor | 資科系 | |
| dc.creator (作者) | Wang, W.-C.;Wang, E.T.;Chen, Arbee L. P. | |
| dc.creator (作者) | 陳良弼 | zh_TW |
| dc.date (日期) | 2011 | |
| dc.date.accessioned | 22-Jun-2015 14:02:38 (UTC+8) | - |
| dc.date.available | 22-Jun-2015 14:02:38 (UTC+8) | - |
| dc.date.issued (上傳時間) | 22-Jun-2015 14:02:38 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/75989 | - |
| dc.description.abstract (摘要) | Dynamic skyline queries are practical in many applications. For example, if no data exist to fully satisfy a query q in an information system, the data "closer" to the requirements of q can be retrieved as answers. Finding the nearest neighbors of q can be a solution; yet finding the data not dynamically dominated by any other data with respect to q, i.e. the dynamic skyline regarding q can be another solution. A data point p is defined to dynamically dominate another data point s, if the distance between each dimension of p and the corresponding dimension of q is no larger than the corresponding distance regarding s and q and at least in one dimension, the corresponding distance regarding p and q is smaller than that regarding s and q. Some approaches for answering dynamic skyline queries have been proposed. However, the existing approaches only consider the query as a point rather than a range in each dimension, also frequently issued by users. We make the first attempt to solve a problem of computing dynamic skylines considering range queries in this paper. To deal with this problem, we propose an efficient algorithm based on the grid index and a novel variant of the well-known Z-order curve. Moreover, a series of experiments are performed to evaluate the proposed algorithm and the experiment results demonstrate that it is effective and efficient. © 2011 Springer-Verlag. | |
| dc.format.extent | 176 bytes | - |
| dc.format.mimetype | text/html | - |
| dc.relation (關聯) | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Volume 6588 LNCS, Issue PART 2, 2011, Pages 235-250, 16th International Conference on Database Systems for Advanced Applications, DASFAA 2011; Hong Kong; China; 22 April 2011 到 25 April 2011; 代碼 84609 | |
| dc.subject (關鍵詞) | Data points; Dynamic skyline query; Efficient algorithm; Grid index; Nearest neighbors; One dimension; Range queries; Range query; Z-order curve; Algorithms; Database systems; Experiments; Search engines | |
| dc.title (題名) | Dynamic skylines considering range queries | |
| dc.type (資料類型) | conference | en |
| dc.identifier.doi (DOI) | 10.1007/978-3-642-20152-3_18 | |
| dc.doi.uri (DOI) | http://dx.doi.org/10.1007/978-3-642-20152-3_18 | |
