政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/75791
English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  全文笔数/总笔数 : 112704/143671 (78%)
造访人次 : 49723362      在线人数 : 509
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧：
  • 您可在西文检索词汇前后加上"双引号"，以获取较精准的检索结果
  • 若欲以作者姓名搜寻，建议至进阶搜寻限定作者字段，可获得较完整数据
    •  进阶搜寻
    政大機構典藏 > 資訊學院 > 資訊科學系 > 會議論文 >  Item 140.119/75791


    请使用永久网址来引用或连结此文件: https://nccur.lib.nccu.edu.tw/handle/140.119/75791


    题名: On continuous spatial skyline queries over a line segment
    作者: Tai, W.H.;Wang, E.T.;Chen, Arbee L. P.
    陳良弼
    贡献者: 資科系
    关键词: Beaches;Constraint satisfaction problems;Experiments;Expert systems;Indexing (of information);Distance constraints;Dynamic attributes;Line segment;Location constraints;Location data;Similarity functions;Skyline;Two dimensional spaces;Query processing
    日期: 2014-09
    上传时间: 2015-06-15 16:05:25 (UTC+8)
    摘要: Traditional skyline queries consider data points with static attributes, e.g., the distance to a beach of a hotel. However, some attributes considered for a skyline query can be dynamic, e.g., the distance to a beach of a moving vehicle. Consider a scenario as follows. A person in a moving vehicle issues a skyline query to find restaurants, taking into account the static attributes of the restaurants as well as the distance to them. This scenario motives us to address a novel skyline query considering both static and dynamic attributes of data points. Given a data set D (e.g., restaurants) with a set of static attributes in a two-dimensional space, a query line segment l (e.g., the route for driving), and a distance constraint of r (for choosing a restaurant), we want to find out the skylines along l considering the static and dynamic attributes of the data points, satisfying the location constraint of r. We propose two methods to solve the problem. In the first method, we find some special location points which partition l into sub-segments and also make the skylines in the adjacent sub-segments different. In the second method, we apply some properties to identify data points which need not be considered for computing skylines. Moreover, to reduce the number of sub-segments, we propose an approximate method to compute skylines and define a similarity function to measure the similarity between the exact and approximate results. A series of experiments are performed to evaluate the exact methods and the results show that the second method is more efficient. We also perform experiments to compare the exact and approximate results and it shows that there is a trade-off between the reduction of the number of sub-segments and the accuracy of the results. © 2014 Springer International Publishing Switzerland.
    關聯: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Volume 8644 LNCS, Issue PART 1, 2014, Pages 171-187, 25th International Conference on Database and Expert Systems Applications, DEXA 2014; Munich; Germany; 1 September 2014 到 4 September 2014; 代碼 107150
    数据类型: conference
    DOI 連結: http://dx.doi.org/10.1007/978-3-319-10073-9-14
    DOI: 10.1007/978-3-319-10073-9-14
    显示于类别:[資訊科學系] 會議論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    index.html0KbHTML21076检视/开启


    在政大典藏中所有的数据项都受到原著作权保护.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回馈