Top-k/w publish/subscribe: A publish/subscribe model for continuous top-k processing over data streams

Information Systems

Volumn 39, Issue 1, 2014, Pages 256-276

  Pripužić, Krešimir ^a   Podnar Žarko, Ivana ^a   Aberer, Karl ^b  

^a UNIVERSITY OF ZAGREB   (Croatia)

^b EPFL   (Switzerland)

Author keywords

Data stream; Event based systems; Sliding window queries

Indexed keywords

COMMUNICATION PARADIGM; CONTINUOUS PROCESSING; DATA STREAM; DATA STREAM PROCESSING; EVENT-BASED SYSTEM; INFORMATION OVERLOADS; PUBLISH/SUBSCRIBE SYSTEM; SLIDING-WINDOW;

DECODING; FUNCTION EVALUATION; ROUTING ALGORITHMS;

DATA COMMUNICATION SYSTEMS;

EID: 84888300412     PISSN: 03064379     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.is.2012.03.003     Document Type: Article

References (50)

1. M. Balazinska, A. Deshpande, M.J. Franklin, P.B. Gibbons, J. Gray, M. Hansen, M. Liebhold, S. Nath, A. Szalay, and V. Tao Data management in the worldwide sensor (Pubitemid 46645070)
2. R.K. Ganti, F. Ye, and H. Lei Mobile crowdsensing: current state and future challenges IEEE Communications Magazine 49 11 2011 32 39
3. P.T. Eugster, P.A. Felber, R. Guerraoui, and A.-M. Kermarrec The many faces of publish/subscribe ACM Computing Surveys 35 2003 114 131
4. Y. Zhou, K.-L. Tan, F. Yu, Leveraging distributed publish/subscribe systems for scalable stream query processing, in: Lecture Notes in Computer Science, vol. 4365, 2007, pp. 20-33.
5. G. Mühl, L. Fiege, A.P. Buchmann, Filter similarities in content-based publish/subscribe systems, in: ARCS, 2002.
6. K. Mouratidis, and D. Papadias Continuous nearest neighbor queries over sliding windows IEEE Transactions on Knowledge and Data Engineering 19 2007 789 803 (Pubitemid 46685656)
7. C. Jin, K. Yi, L. Chen, J. Yu, and X. Lin Sliding-window top-k queries on uncertain streams The VLDB Journal 19 2010 411 435
8. K. Mouratidis, S. Bakiras, D. Papadias, Continuous monitoring of top-k queries over sliding windows, in: SIGMOD, 2006.
9. C. Böhm, B. C. Ooi, C. Plant, Y. Yan, Efficiently processing continuous k-NN queries on data streams, in: ICDE, 2007.
10. K. Pripužić, I. Podnar Žarko, K. Aberer, Top-k/w publish/subscribe: finding k most relevant publications in sliding time window w, in: DEBS, 2008, pp. 127-138.
11. A. Machanavajjhala, E. Vee, M. Garofalakis, J. Shanmugasundaram, Scalable ranked publish/subscribe, in: VLDB, 2008.
12. M. Drosou, E. Pitoura, K. Stefanidis, Preferential publish/subscribe, in: PersDB, 2008.
13. K. Pripužić, I. Podnar Žarko, and K. Aberer Distributed processing of continuous sliding-window k-NN queries for data stream filtering World Wide Web 14 5-6 2011 465 494
14. L. Lamport Proving the correctness of multiprocess programs IEEE Transactions on Software Engineering 3 1977 125 143
15. Z.M. Edward Chang, and A. Pnueli The Safety-Progress Classification. Logic and Algebra of Specifications 1991 Springer-Verlag
16. I.F. Ilyas, G. Beskales, and M.A. Soliman A survey of top-k query processing techniques in relational database systems ACM Computing Survey 40 2008 1 58
17. S. Tarkoma, and J. Kangasharju Optimizing content-based routers: posets and forests Distributed Computing 19 2006 62 77 (Pubitemid 44290698)
18. A.M. Ouksel, O. Jurca, I. Podnar, K. Aberer, Efficient probabilistic subsumption checking for content-based publish/subscribe systems, in: Lecture Notes in Computer Science, vol. 4290, 2006, pp. 121-140. (Pubitemid 46030563)
19. K. Pripužić, Top-k Publish/Subscribe Matching Model Based on Sliding Window, Ph.D. Thesis, University of Zagreb, 2010.
20. K. Mouratidis, H. Pang, An incremental threshold method for continuous text search queries, in: ICDE, 2009.
21. P. Haghani, S. Michel, K. Aberer, The gist of everything new: personalized top-k processing over web 2.0 streams, in: CIKM, 2010, pp. 489-498.
22. Y. Huang, and H. Garcia-Molina Parameterized subscriptions in publish/subscribe systems Data & Knowledge Engineering 60 2007 435 450 (Pubitemid 46209345)
23. R. Baldoni, L. Querzoni, S. Tarkoma, A. Virgillito, Distributed event routing in publish/subscribe systems, in: MiNEMA, 2009.
24. M. Drosou, Ranked publish/subscribe delivery, in: DEBS PhD, 2009.
25. K.S.D. Souravlias, M. Drosou, E. Pitoura, On novelty in publish/subscribe delivery, in: DBRank, 2010.
26. M. Drosou, K. Stefanidis, E. Pitoura, Preference-aware publish/subscribe delivery with diversity, in: DEBS, 2009.
27. A. Carzaniga, D. S. Rosenblum, A. L. Wolf, Achieving scalability and expressiveness in an internet-scale event notification service, in: PODC, 2000.
28. X. Lu, X. Li, T. Yang, Z. Liao,W. Liu, H.Wang, RRPS: a ranked real-time publish/subscribe using adaptive QoS, in: Lecture Notes in Computer Science, vol. 5593, 2009, pp. 835-850
29. N. Koudas, B.C. Ooi, K.-L. Tan, R. Zhang, Approximate nn queries on streams with guaranteed error/performance bounds, in: VLDB, 2004.
30. G. Das, D. Gunopulos, N. Koudas, N. Sarkas, Ad-hoc top-k query answering for data streams, in: VLDB, 2007.
31. Y. Zhang, Computing Order Statistics Over Data Streams, Ph.D. Thesis, University of New South Wales, 2008.
32. B. Oki, M. Pfluegl, A. Siegel, and D. Skeen The information bus: an architecture for extensible distributed systems SIGOPS Operating Systems Review 27 1993 58 68
33. A. Carzaniga, Architectures for an Event Notification Service Scalable to Wide-Area Networks, Ph.D. Thesis, Politecnico di Milano, 1998.
34. G. Cugola, E.D. Nitto, and A. Fuggetta The JEDI event-based infrastructure and its application to the development of the OPSS WFMS IEEE Transactions on Software Engineering 27 2001 827 850 (Pubitemid 32945660)
35. G. Banavar, T. Chandra, B.M. Jay Nagarajarao, R.E. Strom, D.C. Sturman, An efficient multicast protocol for content-based publish-subscribe systems, in: ICDCS, 1999.
36. A. Carzaniga, D.S. Rosenblum, and A.L. Wolf Design and evaluation of a wide-area event notification service ACM Transactions on Computer Systems 19 2001 332 383 (Pubitemid 33619857)
37. G. Mühl, Large-Scale Content-Based Publish/Subscribe Systems, Ph.D.Thesis, Darmstadt University of Technology, 2002.
38. O.K. Sahingoz, N. Erdogan, RUBDES: a rule based distributed event system, in: Lecture Notes in Computer Science, vol. 2869, 2003, pp. 284-291.
39. F. Cao, J.P. Singh, Medym: match-early and dynamic multicast for content-based publish-subscribe service networks, in: ICDCSW, 2005.
40. A. Carzaniga, M.J. Rutherford, A.L. Wolf, A routing scheme for content-based networking, in: INFOCOM, 2004.
41. G. Li, H.-A. Jacobsen, Composite subscriptions in content-based publish/subscribe systems, in: Lecture Notes in Computer Science, vol. 3790, 2005, pp. 249-269. (Pubitemid 43763638)
42. R. Baldoni, R. Beraldi, L. Querzoni, and A. Virgillito Efficient publish/subscribe through a self-organizing broker overlay and its application to siena The Computer Journal 50 2007 444 459 (Pubitemid 47082663)
43. G. Li, V. Muthusamy, H.-A. Jacobsen, Adaptive content-based routing in general overlay topologies, in: Lecture Notes in Computer Science, vol. 5346, 2008, pp. 1-21.
44. A.I.T. Rowstron, A.-M. Kermarrec, M. Castro, P. Druschel, Scribe: the design of a large-scale event notification infrastructure, in: NGC, 2001.
45. S.Q. Zhuang, B.Y. Zhao, A.D. Joseph, R.H. Katz, J.D. Kubiatowicz, Bayeux: an architecture for scalable and fault-tolerant wide-area data dissemination, in: NOSSDAV, 2001.
46. P.R. Pietzuch, J.M. Bacon, Hermes: a distributed event-based middleware architecture, in: ICDCSW, 2002.
47. A. Gupta, O.D. Sahin, D. Agrawal, A.E. Abbadi, Meghdoot: contentbased publish/subscribe over p2p networks, in: Lecture Notes in Computer Science, vol. 3231, 2004, pp. 254-273. (Pubitemid 39738583)
48. P. Costa, M. Migliavacca, G.P. Picco, G. Cugola, Epidemic algorithms for reliable content-based publish-subscribe: an evaluation, in: ICDCS, 2004.
49. G. Chockler, R. Melamed, Y. Tock, R. Vitenberg, Spidercast: a scalable interest-aware overlay for topic-based pub/sub communication, in: DEBS, 2007.
50. R. Baldoni, R. Beraldi, V. Quema, L. Querzoni, S. Tucci-Piergiovanni, Tera: topic-based event routing for peer-to-peer architectures, in: DEBS, 2007.