Determining Top-K Candidates by Reverse Constrained Skyline Queries

Ruei Sian Jheng, En Tzu Wang, Arbee L. P. Chen

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 series 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.

References

  1. Bartolini, I., Ciaccia, P., Patella, M.: SaLSa, 2006. Computing the skyline without scanning the whole sky. In: Proceedings of the ACM International Conference on Information and Knowledge Management. CIKM.
  2. Borzsonyi, S., Kossmann, D., Stocker, K., 2001. The skyline operator. In: Proceedings of the International Conference on Data Engineering. ICDE.
  3. Chomicki, J., Godfrey, P., Gryz, J., Liang, D., 2003. Skyline with presorting. In: Proceedings of the International Conference on Data Engineering. ICDE.
  4. Chen, L., Lian, X., 2009. Efficient processing of metric skyline queries. In: Proceedings of the IEEE Trans. Knowl. Data Eng. TKDE.
  5. Dellis, E. and Seeger, B., 2007. Efficient Computation of Reverse Skyline Queries. In: Proceedings of the International Conference on Very Large Data Bases. VLDB.
  6. Deng, K., Zhou, X., Shen, H.T., 2007. Multi-source skyline query processing in road networks. In: Proceedings of the International Conference on Data Engineering. ICDE.
  7. Fuhry, D., Jin, R., Zhang, D., 2009. Efficient skyline computation in metric space. In: Proceedings of the International Conference on Extending Database Technology. EDBT.
  8. Gargantini, I, 1982. An effective way to represent quadtrees. In: Proceedings of the Communications of the ACM. CACM.
  9. Guttman, A., 1984. R-Trees: A Dynamic Index Structure for Spatial Searching. In: Proceedings of the ACM's Special Interest Group on Management Of Data. SIGMOD.
  10. Godfrey, P., Shipley, R., Gryz, J., 2005. Maximal vector computation in large data sets. In: Proceedings of the International Conference on Very Large Data Bases. VLDB.
  11. Stanoi, I., Agrawal, D., Abbadi, A.E., 2000. Reverse nearest neighbour queries for dynamic databases. In: Proceedings of the ACM's Special Interest Group on Management of Data. SIGMOD.
  12. Korn, F., Muthukrishnan, S., 2000. Influence sets based on reverse nearest neighbor queries. In: Proceedings of the ACM's Special Interest Group on Management Of Data. SIGMOD.
  13. Lin, K.I., Nolen, M., Yang, C., 2003. Applying bulk insertion techniques for dynamic reverse nearest neighbor problems. In: Proceedings of IDEAS. IDEAS.
  14. Kang, J. M., Mokbel, M.F., Shekhar, S., Xia, T., Zhang, D., 2007. Continuous evaluation of monochromatic and bichromatic reverse nearest neighbors. In: Proceedings of the International Conference on Data Engineering. ICDE.
  15. Lin, X., Yuan Y., Zhang, Q., Zhang, Y., 2007. Selecting Stars: The k Most Representative Skyline Operator. In: Proceedings of the International Conference on Data Engineering. ICDE.
  16. Lee, K. C. K., Zheng, B., Li, H., Lee, W.C., 2007. Approaching the skyline in Z order. In: Proceedings of the International Conference on Very Large Data Bases. VLDB.
  17. Papadias, D., Tao, Y., Fu, G., Seeger, B., 2005. Progressive skyline computation in database systems. In: Proceedings of the ACM Transactions on Database Systems. TODS.
  18. Papadias, D., Zhang, J., Mamoulis, N., Tao, Y., 2003. Query Processing in Spatial Network Databases. In: Proceedings of the International Conference on Very Large Data Bases. VLDB.
  19. Stanoi, I., Riedewald, M., Agrawal, D., Abbadi, A.E., 2001. Discovery of influence sets in frequently updated databases. In: Proceedings of the International Conference on Very Large Data Bases. VLDB.
  20. Sharifzadeh, M., Shahabi, C., 2006. The Spatial Skyline Queries. In: Proceedings of the International Conference on Very Large Data Bases. VLDB.
  21. Tan, K.L., Eng, P.K., Ooi, B.C., 2001. Efficient progressive skyline computation. In: Proceedings of the International Conference on Very Large Data Bases. VLDB.
  22. Tao, Y., Papadias, D., Lian, X., 2004. Reverse knn search in arbitrary dimensionality. In: Proceedings of the International Conference on Very Large Data Bases. VLDB.
  23. Wu,W.,Yang, F., Chan, C.Y., Tan,K.-L., 2008. Finch: Evaluating reverse k-nearest-neighbor queries on location data. In: Proceedings of the International Conference on Very Large Data Bases. VLDB.
  24. Yang, C., Lin, K.-I., 2001. An index structure for efficient reverse nearest neighbor queries. In: Proceedings of the International Conference on Data Engineering. ICDE.
  25. Zhang, S., Mamoulis, N., Cheung, D.W., 2009. Scalable skyline computation using object-based space partitioning. In: Proceedings of the ACM's Special Interest Group on Management Of Data. SIGMOD.
Download


Paper Citation


in Harvard Style

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


in Bibtex Style

@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},
}


in EndNote Style

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