• Login
    View Item 
    •   Home
    • Research
    • Articles
    • View Item
    •   Home
    • Research
    • Articles
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of KAUSTCommunitiesIssue DateSubmit DateThis CollectionIssue DateSubmit Date

    My Account

    Login

    Quick Links

    Open Access PolicyORCID LibguideTheses and Dissertations LibguideSubmit an Item

    Statistics

    Display statistics

    Flexible Aggregate Nearest Neighbor Queries and its Keyword-Aware Variant on Road Networks

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Type
    Article
    Authors
    Chen, Zhongpu cc
    Yao, Bin cc
    Wang, Zhi-Jie cc
    Gao, Xiaofeng cc
    Shang, Shuo cc
    Ma, Shuai cc
    Guo, Minyi cc
    KAUST Department
    Computer, Electrical and Mathematical Science and Engineering (CEMSE) Division
    Date
    2020-02-25
    Online Publication Date
    2020-02-25
    Print Publication Date
    2021-12-01
    Submitted Date
    2018-07-19
    Permanent link to this record
    http://hdl.handle.net/10754/673759
    
    Metadata
    Show full item record
    Abstract
    Aggregate nearest neighbor (Ann) query in both the euclidean space and road networks has been extensively studied, and the flexible aggregate nearest neighbor (Fann) problem further generalizes Ann by introducing an extra flexibility parameter \phi φ that ranges in (0, 1] (0,1]. In this article, we focus on Fann on road networks, denoted as Fann-\mathcal {R} R, and its keyword-aware variant, denoted as KFann-\mathcal {R} R. To solve these problems, we propose a series of universal (i.e., suitable for both max and sum) algorithms, including a Dijkstra-based algorithm that enumerates P P instead of \phi |Q|φ|Q|-combinations of Q Q, a queue-based approach that processes data points from-near-to-far, and a framework that combines incremental euclidean restriction (IER) and k kNN. We also propose a specific exact solution to max-Fann-\mathcal {R} R and a constant-factor ratio approximate solution to sum-Fann-\mathcal {R} R. These specific algorithms are easy to implement and can achieve excellent performance in some scenarios. Besides, we further extend this problem to top-k k and multiple Fann-\mathcal {R} R (resp., KFann-\mathcal {R} R) queries. We conduct a comprehensive experimental evaluation for the proposed algorithms on real datasets to demonstrate their superior efficiency and high quality.
    Citation
    Chen, Z., Yao, B., Wang, Z.-J., Gao, X., Shang, S., Ma, S., & Guo, M. (2021). Flexible Aggregate Nearest Neighbor Queries and its Keyword-Aware Variant on Road Networks. IEEE Transactions on Knowledge and Data Engineering, 33(12), 3701–3715. doi:10.1109/tkde.2020.2975998
    Sponsors
    This work (Bin Yao) was supported by the NSFC (U1636210)
    Publisher
    Institute of Electrical and Electronics Engineers (IEEE)
    Journal
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
    DOI
    10.1109/TKDE.2020.2975998
    Additional Links
    https://ieeexplore.ieee.org/document/9007415/
    ae974a485f413a2113503eed53cd6c53
    10.1109/TKDE.2020.2975998
    Scopus Count
    Collections
    Articles; Computer, Electrical and Mathematical Science and Engineering (CEMSE) Division

    entitlement

     
    DSpace software copyright © 2002-2022  DuraSpace
    Quick Guide | Contact Us | KAUST University Library
    Open Repository is a service hosted by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items. For anonymous users the allowed maximum amount is 50 search results.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.