Multicriteria Data Retrieval in Database using Advanced Database Operator

 Multicriteria Data Retrieval in Database using Advanced Database Operator

  IJCOT-book-cover
 		 International Journal of Computer & Organization Trends  (IJCOT)          
 
© 2014 by IJCOT Journal
Volume - 4 Issue - 2
Year of Publication : 2014
Authors :  Dr. Anil Rajput , Ms. Sunita Dwivedi
DOI :  10.14445/22492593/IJCOT-V6P301

Citation

Dr. Anil Rajput , Ms. Sunita Dwivedi. "Multicriteria Data Retrieval in Database using Advanced Database Operator", International Journal of Computer & organization Trends (IJCOT), V4(2):1-6 Mar - Apr 2014, ISSN:2249-2593, www.ijcotjournal.org. Published by Seventh Sense Research Group.

Abstract

Database management systems have been increasingly used in decision support applications. One of the features of such application is query with multiple, and sometimes conflicting, goals. People recently are interested in an advanced query operator for such queries named skyline which returns the objects that are not dominated by any other objects with regard to certain measures in a multi-dimensional space. The skyline query is frequently used to find a set of dominating data points (called skyline points) in a multidimensional dataset and finds a set of interesting objects, satisfying a set of possibly conflicting conditions. In this paper we present a study of this interesting and still evolving research area so that readers can easily obtain an overview of Skyline query. We presented history of this concept and then evaluation of Skyline query in database.

References

1. Balke, W., Guuntzer, U., Zheng, J.X., “ Efficient distributed skylining for web information systems.”, Proceedings of International Conference on Extending Database Technology (EDBT), pp. 256-273 , 2004
2. Bartolini I., Ciaccia P., and Patella M. “Salsa: computing the skylinewithout scanning the whole sky.”,In CIKM, pages 405–414, 2006.
3. Bayross Ivan. (2008): SQL, PL/SQL The Programming Language of Oracle. 3rd Revised Edition, BPB Publications. [ISBN: 81- 7656-964-X].
4. Borzsonyi S.,Kossmann D. and Stocker K., “The skyline operator.", Proceedings of the 17th International Conference on Data Engineering (ICDE), pages 421-430, 2001.
5. Chan, C., Eng, P., Tan, K. “Stratied Computation of Skylines with Partially-Ordered Domains.” Proceedings of International Conference on Management of Data (SIGMOD), pp. 203-214, 2005.
6. Chan C., Jagadish H., Tan K., Tung A., Zhang Z. “Finding k-dominant skylines in high dimensional space.”, Proceedings of International Conference on Management of Data (SIGMOD), pp. 503-514 2006 .
7. Chomicki J. , Godfrey P., Gryz J., and Liang D. “Skyline with presorting.” Technical Report, Computer Science, York University, Toronto, ON, Canada, Oct. 2002.
8. Cui B., Lu H., Xu Q., Chen L., Dai Y., Zhou Y. “Parallel distributed processing of constrained skyline queries by ltering.”, Proceedings of International Conference on Data Engineering (ICDE), pp. 546-555 ,2008.
9. Dalvi N., Choudhary S., and Kaushik R., “Robust cardinality and cost estimation for skyline operator.”, Proceedings of the 22ndt International Conference on Data Engineering (ICDE), pp. 64-74, 2006.
10. Dellis, E., Seeger, B., “ Efficient computation of reverse skyline queries.” ,Proceedings of International Conference on Very Large Data Bases (VLDB), pp. 291-302 ,2007.
11. Eder H., “On extending PostgreSQL with the skyline operator.” Master’s Thesis Vienna University of Technology, 2009.
12. Godfrey P., Shipley R., Gryz J. “ Maximal vector computation in large data sets.” , Proceedings of International Conference on Very Large Data Bases (VLDB), pp. 229-240 ,2005.
13. Guttman A., “R-trees: A dynamic index structure for spatial searching.” Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 47-57, 1984.
14. Hua M., Pei J., and Zhang W., “Ranking Queries on Uncertain Data A Probabilistic Threshold Approach,” Proceedings of ACM SIGMOD, ACM, New York, pp. 673-686., 2008.
15. Huang Z., Jensen C.S., Lu H., and Ooi.B. C., “ Skyline queries against mobile lightweight devices in manets.”, Proceedings of the 22nd IEEE International Conference on Data Engineering (ICDE) , 2006.
16. Khalefa M., Mokbel M. and Levandoski J., “Skyline Query Processing for Incomplete Data.”, Proceedings of International Conference on Data Engineering (ICDE), pp. 556- 565 ,2008.
17. Kiessling W. “Foundations of preferences in database systems.”, Proceedings of the 28th International Conference on Very Large Data Bases Hong Kong, China. MorganKaufmann, San Francisco, CA, pp.311–322,2002
18. Kiessling W. and Koestler G., “Preference SQL: Design, implementation, experiences.” In VLDB, Aug. 2002.
19. Kossmann D., Ramsak F., and Rost S., “Shooting stars in the sky: an online algorithm for skyline queries.”, Proceedings of 28th International Conference on Very Large Data Bases (VLDB), pp. 275-286, 2002.
20. Kung H. T, Luccio F., and Preparata F. P. J. “On finding the maxima of a set of vectors.”, ACM, 22(4):469–476, 1975.
21. Lo, E., Yip, K.Y., Lin, K.I., Cheung, D.W. “Progressive skylining over web-accessible databases.” Data Knowledge Engineering (DKE) 57(2), 122-147 ,2006.
22. Lin, X., Yuan, Y., Wang, W., Lu, H., “Stabbing the sky: Effcient skyline computation over sliding windows.”, Proceedings of International Conference on Data Engineering (ICDE), pp. 502-513 ,2005.
23. Papadias D., Tao Y., Fu G., Seeger B. “ An optimal and progressive algorithm for skyline queries.” , Proceedings of International Conference on Management of Data (SIGMOD), pp. 467-478 ,2003.
24. Pei J., Jin W., Ester M., Tao Y., “ Catching the best views of skyline: A semantic approach based on decisive subspaces.”, Proceedings of International Conference on Very Large Data Bases (VLDB), pp. 253-264 ,2005.
25. Preparata F. P. and M. I. Shamos. “Computational Geometry: An Introduction.” Springer-Verlag, New York, Berlin, etc., 1985.
26. Sun, S., Huang, Z., Zhong, H., Dai, D., Liu, H., Li, J,.”Efficient monitoring of skyline queries over distributed data streams.” Knowledge and Information System25,575-606 ,2010.
27. Tan K.L., Eng P.K., Ooi B.C. “ Efficiecient progressive skyline computation.” Proceedings of International Conference on Very Large Data Bases (VLDB), pp. 301{310 (2001)
28. Tao Y., Xiao X., Pei J. “ Subsky: Efficient computation of skylines in subspaces.”, Proceedings of International Conferience on Data Engineering (ICDE), p. 65 ,2006.
29. Vlachou, A., Nrvag, K.,”Bandwidth-constrained distributed skyline computation. In: Proceedings of the International Workshop on Data Engineering for Wireless and Mobile Access (MobiDE), “pp. 17-24 ,2009.
30. Wu P., Zhang C., Feng Y., Zhao B., Agrawal D., Abbadi,A. "Parallelizing skyline queries for scalable distribution.”, Proceedings of International Conference on Extending Database Technology (EDBT), pp. 112-130 ,2006.
31. Yuan Y., Lin X., Liu Q., Wang W., Yu J.X., Zhang Q. “ Efficient computation of the skyline cube. “, Proceedings of International Conference on Very Large Data Bases (VLDB), pp. 241-252 ,2005.
32. .http://en.wikipedia.org/wiki/SQL.