English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 95940/126530 (76%)
Visitors : 31809061      Online Users : 316
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    政大機構典藏 > 理學院 > 資訊科學系 > 會議論文 >  Item 140.119/75989
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/75989

    Title: Dynamic skylines considering range queries
    Authors: Wang, W.-C.;Wang, E.T.;Chen, Arbee L. P.
    Contributors: 資科系
    Keywords: 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
    Date: 2011
    Issue Date: 2015-06-22 14:02:38 (UTC+8)
    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.
    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
    Data Type: conference
    DOI 連結: http://dx.doi.org/10.1007/978-3-642-20152-3_18
    DOI: 10.1007/978-3-642-20152-3_18
    Appears in Collections:[資訊科學系] 會議論文

    Files in This Item:

    File Description SizeFormat

    All items in 政大典藏 are protected by copyright, with all rights reserved.

    社群 sharing

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback