Evaluating Continuous Monitoring of Top-k Queries Using Sliding Window

Authors(2) :-Thulabandula Rajyalakshmi, P S Naveen Kumar

Preference questions are utilized as a part of multi criteria basic leadership applications where various opposing criteria are included to choose the most commodious responses to the client. Numerous advanced applications consent to the streaming model of algorithm and in this way consistent inquiry handling algorithms are required to invigorate the question result. Cases of such rising applications are specialized information examination, information association in sensor systems, article separating in data recovery, electronic cautions, issue/buy in administrations. Continuous preparing of the preference questions is performed by utilizing the sliding window strategy which creates genuinely precise response to information stream inquiry by assessing the current information.

Authors and Affiliations

Thulabandula Rajyalakshmi
PG Student, Department of MCA, St. Ann's College of Engineering & Technology, Chirala, Andhra Pradesh, India
P S Naveen Kumar
Assistant Professor, Department of MCA, St. Ann's College of Engineering & Technology, Chirala, Andhra Pradesh, India

Top-k, Skyline, Top-k Dominating, Data Streams, Algorithms.

  1. C. Jin, K. Yi, L. Chen, J. X. Yu, and X. Lin. Sliding-window top-k queries on uncertain streams. VLDB J., 19(3):411435, 2010.
  2. S. Krishnamurthy, C. Wu, and M. J. Franklin. On-the-fly sharing for streamed aggregation. In SIGMOD Conference, pages 623634, 2006.
  3. K. Mouratidis, S. Bakiras, and D. Papadias. Continuous monitoring of top-k queries over sliding windows. In SIGMOD, pages 635646, 2006.
  4. M. Theobald, G. Weikum, and R. Schenkel. Top-k query evaluation with probabilistic guarantees. In VLDB, pages 648659, 2004.
  5. SHAIK ASHA,P. S. NAVEEN KUMAR Taxo-Finder to Build a Graph, Cgraph and Representing Domain Corpus and Their Associative Strengths Pages 1810-1814,2017 Publisher simhapuri publications
  6. D. Yang, E. A. Rundensteiner, and M. O. Ward. A shared execution strategy for multiple pattern mining requests over streaming data. PVLDB, 2(1):874885, 2009.
  7. K. Yi, H. Yu, J. Y. 0001, G. Xia, and Y. Chen. Efficient maintenance of materialized top-k views. In ICDE, pages 189200, 2003.
  8. W. Kiessling, “Foundations of Preferences in Database Systems,”Proc. 28th Int’l Conf. Very Large Data Bases (VLDB), pp. 311-322,2002.
  9. Y. Tao and D. Papadias, “Maintaining Sliding Window Skylines on Data Streams,” IEEE Trans. Knowledge and Data Eng., vol. 18, no. 3, pp. 377-391, Mar. 2006.
  10. K. Mouratidis and S. Bakiras, , “Continuous Monitoring of Top-k Queries over Sliding Windows,” Proc. ACMSIGMOD Conf. Management of Data ,pp. 635-646, 2006.
  11. M. Kontaki, A.N. Papadopoulos, and Y. Manolopoul “Continuous Top-k Dominating Queries in Subspaces, ” Proc. Panhellenic Conf. Informatics (PCI), pp. 675-689, 2008.
  12. D. Papadias, Y. Tao, G. Fu, and B. Seeger, “Progressive Skyline Computation in Database Systems” ACM Trans. Database Systems, vol. 30, no. 1, pp. 41-82, 2005.
  13. M.L. Yiu and N. Mamoulis, “Multidimensional Top-k Dominating Queries,” VLDB J., vol. 18, pp. 695-718, 2009.
  14. B. Babcock, M. Datar, R. Motwani, and J. Widom, “Models and Issues in Data Stream Systems,” Proc. ACM SIGMOD Symp. Principles of Database Systems ), pp. 1-16, 2002.

Publication Details

Published in : Volume 3 | Issue 2 | January-February 2018
Date of Publication : 2018-02-28
License:  This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 174-179
Manuscript Number : CSEIT1831494
Publisher : Technoscience Academy

ISSN : 2456-3307

Cite This Article :

Thulabandula Rajyalakshmi, P S Naveen Kumar, "Evaluating Continuous Monitoring of Top-k Queries Using Sliding Window", International Journal of Scientific Research in Computer Science, Engineering and Information Technology (IJSRCSEIT), ISSN : 2456-3307, Volume 3, Issue 2, pp.174-179, January-February-2018.
Journal URL : http://ijsrcseit.com/CSEIT1831494

Article Preview

Follow Us

Contact Us