An Optimal Strategy for Evaluating Continuous Top-k Monitoring on Document Streams

Authors

  • V. Hema Priya  MCA Department, Vignan's Lara Institute of Technology and Science, Vadlamudi, Guntur, Andhra Pradesh, India
  • Ponduri Siva Parvathi  

Keywords:

Top-k query, continuous query, document stream

Abstract

The proficient preparing of report streams assumes a vital part in numerous data separating frameworks. Developing applications, for example, news refresh sifting and informal community warnings, request to give end-clients the most significant substance to their inclinations. In this work, client inclinations are demonstrated by an arrangement of watchwords. A focal server screens the record stream and consistently reports to every client the best k archives that are most pertinent to her catchphrases. Our goal is to help substantial quantities of clients and high stream rates while invigorating the best k comes about quickly. Our answer forsakes the conventional recurrence requested ordering approach. Rather, it takes after an identifier-requesting worldview that suits better the idea of the issue. At the point when supplemented with a novel, locally versatile strategy, our technique offers (I) demonstrated optimality w.r.t. the quantity of considered questions per stream occasion, and (ii) a request for extent shorter reaction time (i.e., time to invigorate the inquiry comes about) than the present best in class.

References

  1. P. Haghani, S. Michel, and K. Aberer, “The gist of everything new: Personalized top-k processing over web 2.0 streams,” in Proc. 19th ACM Int. Conf. Inf. Knowl. Manage., 2010, pp. 489–498.
  2. K. Mouratidis and H. Pang, “Efficient evaluation of continuous text search queries,” IEEE Trans. Knowl. Data Eng., vol. 23, no. 10, pp. 1469–1482, Oct. 2011.
  3. N. Vouzoukidou, B. Amann, and V. Christophides,“Processing continuous text queries featuring non-homogeneous scoring functions,” in Proc. 21st ACM Int.Conf. Inf. Knowl. Manage., 2012, pp. 1065–1074.
  4. A. Hoppe, “Automatic ontology-based user profile learning from heterogeneous web resources in a big data context,”Proc. VLDB Endowment, vol. 6, pp. 1428–1433, 2013.
  5. A. Lacerda and N. Ziviani, “Building user profiles to improve user experience in recommender systems,” in Proc. 6th ACM Int. Conf. Web Search Data Mining, 2013, pp. 759–764.
  6. M. Busch, K. Gade, B. Larson, P. Lok, S. Luckenbill, and J.J. Lin, “Earlybird: Real-time search at twitter,” inProc. IEEE 28th Int. Conf. Data Eng., 2012, pp. 1360–1369.
  7. L. Wu, W. Lin, X. Xiao, and Y. Xu, “LSII: an indexing structure for exact real-time search on microblogs,” in Proc.IEEE 29th Int. Conf. Data Eng., 2013, pp. 482–493.
  8. J. Zobel and A. Moffat, “Inverted files for text search engines,”ACM Comput. Surv., vol. 38, no. 2, 2006, Art. no. 6.
  9. R. Fagin, A. Lotem, and M. Naor, “Optimal aggregation algo- rithms for middleware,” J. Comput. Syst. Sci., vol. 66, no. 4, pp. 614–656, 2003.

IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology

Downloads

Published

2018-04-30

Issue

Volume 4, Issue 2, March-April-2018

Section

Research Articles

License

Copyright (c) IJSRCSEIT

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
V. Hema Priya, Ponduri Siva Parvathi, " An Optimal Strategy for Evaluating Continuous Top-k Monitoring on Document Streams, IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology(IJSRCSEIT), ISSN : 2456-3307, Volume 4, Issue 2, pp.115-121, March-April-2018.