Proficient Ordering Strategy for Horizon Calculation by Incompletely Requested Areas

Authors(2) :-G. Nandini, M. Sarada

Given a dataset containing multidimensional data points, a skyline query retrieves a set of data points that are not be dominated by any other points. Skyline queries are useful in multi-preference analysis and decision making applications, and there has been a lot of research interest in the efficient processing of skyline queries. While many skyline evaluation methods have been developed on totally ordered domains for numerical attributes, the efficient evaluation of skyline queries on a combination of totally ordered domains for numerical attributes and partially ordered domains for categorical attributes, which is a more general and challenging problem, is only beginning to be studied. The difficulty in handling skyline queries involving partially ordered domains mainly comes from the more complex dominance relationship among values in partially ordered domains. In this thesis, i present a new indexing method named ZINC (for Z-order Indexing with Nested Code) that supports efficient skyline computation for data with both totally and partially ordered attribute domains. The key innovation in ZINC is based on combining the strengths of the ZB-tree, which is the state-of-the-art index method for computing skylines involving totally ordered domains, with a novel, nested coding scheme that succinctly maps partial orders into total orders. An extensive performance evaluation demonstrates that ZINC significantly outperforms the state-of-the-art indexing schemes for skyline queries.

Authors and Affiliations

G. Nandini
PG Scholar, Department of MCA, St.Ann's College of Engineering and Technology, Chirala, Andhra Pradesh, India
M. Sarada
Assistant Professor, Department of MCA, St.Ann's College of Engineering and Technology, Chirala, Andhra Pradesh, India

  1. I.Bartolini, P.Ciacia, and M.Patella.Efficient sort-based skyline evaluation.In TODS, volume 33(4), pages 1-49, 2008.
  2. S.Borzs ¨ onyi, D.Kossmann, and K.Stocker.The skyline operator.In ¨ ICDE, pages 421-430, 2001.
  3. Y.Caseau.Efficient handling of multiple inheritance hierarchies.In OOPSLA, pages 271-287, 1993.
  4. C.Y.Chan, P.K.Eng, and K.L.Tan.Stratified computation of skylines with partially-ordered domains.In SIGMOD, pages 203-214, 2005.
  5. P.Godfrey, R.Shipley, and J.Gryz.Maximal vector computation in large data sets.In VLDB, pages 229-240, 2005.
  6. J.Chomicki, P.Godfrey, and J.Kryz.Skyline with presorting.In ICDE, pages 717-719, 2003.
  7. D.Kossmann, F.Ramsak, and S.Rost.Shooting stars in the sky: An online algorithm for skyline queries.In VLDB, pages 275-286, 2002.
  8. H.T.Kung, F.Luccio, and F.P.Preparata.On finding the maxima of a set of vectors.In Journal of the ACM, pages 469-476, 1975.
  9. K.Lee, B.Zheng, H.Li, and W.C.Lee.Approaching the skyline in z order.In VLDB, pages 279-290, 2007.
  10. M.Morse, J.M.Patel, and H.V.Jagadish.Efficient skyline computation over low-cardinality domains.In VLDB, pages 267-278, 2007.
  11. D.Papadias, Y.Tao, G.Fu, and B.Seeger.An optimal and progressive algorithm for skyline queries.In SIGMOD Conference, pages 467-478, 2003.
  12. D.Papadias, Y.Tao, G.Fu, and B.Seeger.Progressive skyline computation in database systems.In SIGMOD, volume 30, pages 41-82, 2005.
  13. D.Sacharidis, S.Papadopoulos, and D.Papadias.Topologically-sorted skyline for partially-ordered domains.In ICDE, pages 1072-1083, 2009.
  14. K.Tan, P.Eng, and B.Ooi.Efficient progressive skyline computation.In VLDB, pages 301-310, 2001.
  15. S.Zhang, N.Mamoulis, and D.W.Cheung.Scalable skyline computation using object-based space partitioning.In SIGMOD, pages 483-494, 2009.

Publication Details

Published in : Volume 3 | Issue 2 | January-February 2018
Date of Publication : 2018-04-30
License:  This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 221-226
Manuscript Number : CSEIT18337
Publisher : Technoscience Academy

ISSN : 2456-3307

Cite This Article :

G. Nandini, M. Sarada, "Proficient Ordering Strategy for Horizon Calculation by Incompletely Requested Areas", International Journal of Scientific Research in Computer Science, Engineering and Information Technology (IJSRCSEIT), ISSN : 2456-3307, Volume 3, Issue 2, pp.221-226, January-February-2018.
Journal URL : http://ijsrcseit.com/CSEIT18337

Article Preview

Follow Us

Contact Us