loading
Papers

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Ruei Sian Jheng 1 ; En Tzu Wang 2 and Arbee L. P. Chen 3

Affiliations: 1 National Tsing-Hua University, Taiwan ; 2 Industrial Technology Research Institute, Taiwan ; 3 National Chengchi University, Taiwan

ISBN: 978-989-758-103-8

Keyword(s): Top-K Queries, Range Queries, Skyline Queries, Reverse Skyline Queries, Quad-tree Index.

Related Ontology Subjects/Areas/Topics: Data Engineering ; Data Management and Quality ; Data Structures and Data Management Algorithms

Abstract: Given a set of criteria, an object o is defined to dominate another object o' if o is no worse than o' in each criterion and has better outcomes in at least a specific criterion. A skyline query returns each object that is not dominated by any other objects. Consider a scenario as follows. Given three types of datasets, including residents in a city, existing restaurants in the city, and candidate places for opening new restaurants in the city, where each restaurant and candidate place has its respective rank on a set of criteria, e.g., convenience of parking, we want to find the top-k candidate places that have the most potential customers. The potential customers of a candidate place is defined as the number of residents whose distance to this candidate is no larger than a given distance r and also regard this candidate as their skyline restaurants. In this paper, we propose an efficient method based on the quad-tree index and use four pruning strategies to solve this problem. A ser ies of experiments are performed to compare the proposed method with a straightforward method using the R-tree index. The experiment results demonstrate that the proposed method is very efficient, and the pruning strategies very powerful. (More)

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 35.172.217.40

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Jheng, R.; Wang, E. and Chen, A. (2015). Determining Top-K Candidates by Reverse Constrained Skyline Queries.In Proceedings of 4th International Conference on Data Management Technologies and Applications - Volume 1: DATA, ISBN 978-989-758-103-8, pages 101-110. DOI: 10.5220/0005498601010110

@conference{data15,
author={Ruei Sian Jheng. and En Tzu Wang. and Arbee L. P. Chen.},
title={Determining Top-K Candidates by Reverse Constrained Skyline Queries},
booktitle={Proceedings of 4th International Conference on Data Management Technologies and Applications - Volume 1: DATA,},
year={2015},
pages={101-110},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005498601010110},
isbn={978-989-758-103-8},
}

TY - CONF

JO - Proceedings of 4th International Conference on Data Management Technologies and Applications - Volume 1: DATA,
TI - Determining Top-K Candidates by Reverse Constrained Skyline Queries
SN - 978-989-758-103-8
AU - Jheng, R.
AU - Wang, E.
AU - Chen, A.
PY - 2015
SP - 101
EP - 110
DO - 10.5220/0005498601010110

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.