An Efficient Strategy for Monitoring Top-k Queries in Document Streaming

Authors(3) :-P. Venu, N. Himabindhu, P. Bhargavi

The proficient processing of document streams assumes an essential part in numerous data separating frameworks. Developing applications, for example, news refresh separating and social network notices, request giving end-clients the most pertinent substance to their inclinations. In this work, client inclinations are shown by an arrangement of keywords. A focal server screens the document stream and ceaselessly reports to every client the best k records that are most pertinent to her keywords. Our goal is to help extensive quantities of clients and high stream rates, while reviving the best k comes about quickly. Our answer relinquishes the customary frequency 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 procedure, our technique offers (I) demonstrated optimality w.r.t. the quantity of considered queries per stream occasion, and (ii) a request of extent shorter reaction time (i.e., time to revive the query comes about) than the present state-of-the-art.

Authors and Affiliations

P. Venu
Department of MCA, Narayana Engineering College Nellore, India
N. Himabindhu
Department of MCA, Narayana Engineering College Nellore, India
P. Bhargavi
Department of MCA, Narayana Engineering College Nellore, India

Top-k Query, Document stream, CTQD, Continuous Query.

  1. 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.
  2. 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.
  3. J Zobel and A. Moffat, “Inverted files for text search engines,”ACMComput.Surv., vol. 38, no. 2, 2006, Art. no. 6.
  4. 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.
  5. 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.
  6. N Vouzoukidou, B. Amann, and V. Christophides, “Processing continuous text queries featuring nonhomogeneous scoring functions,” in Proc. 21st ACM Int. Conf. Inf. Knowl.Manage., 2012, pp. 1065–1074.
  7. 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.
  8. 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.
  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.
  10. D. Yang, E. A. Rundensteiner, and M. O. Ward. A shared execution strategy for multiple pattern mining requests over streaming data. PVLDB, 2(1):874–885, 2009.
  11. I. INETATS. Stock trade traces. http://www.inetats.com/.
  12. C. Jin, K. Yi, L. Chen, J. X. Yu, and X. Lin. Sliding-window top-k queries on uncertain streams. PVLDB, 1(1):301–312, 2008.
  13. C. Jin, K. Yi, L. Chen, J. X. Yu, and X. Lin. Sliding-window top-k queries on uncertain streams. VLDB J., 19(3):411–435, 2010.
  14. S. Krishnamurthy, C. Wu, and M. J. Franklin. On-the-fly sharing for streamed aggregation. In SIGMOD Conference, pages 623–634, 2006.
  15. M. Theobald, G. Weikum, and R. Schenkel. Top-k query evaluation with probabilistic guarantees. In VLDB, pages 648–659, 2004.
  16. D. Yang, E. A. Rundensteiner, and M. O. Ward. Neighbor-based pattern detection for windows over streaming data. In EDBT, pages 529–540, 2009

Publication Details

Published in : Volume 3 | Issue 4 | March-April 2018
Date of Publication : 2018-04-30
License:  This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 1266-1271
Manuscript Number : CSEIT1833664
Publisher : Technoscience Academy

ISSN : 2456-3307

Cite This Article :

P. Venu, N. Himabindhu, P. Bhargavi, "An Efficient Strategy for Monitoring Top-k Queries in Document Streaming", International Journal of Scientific Research in Computer Science, Engineering and Information Technology (IJSRCSEIT), ISSN : 2456-3307, Volume 3, Issue 4, pp.1266-1271, March-April-2018.
Journal URL : http://ijsrcseit.com/CSEIT1833664

Article Preview