메뉴 건너뛰기




Volumn , Issue , 2008, Pages 127-138

Top-k/w publish/subscribe: Finding k most relevant publications in sliding time window w

Author keywords

Algorithms; Experimentation; Performance

Indexed keywords

ARSENIC;

EID: 57549100475     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1385989.1386006     Document Type: Conference Paper
Times cited : (27)

References (36)
  • 1
    • 0036042175 scopus 로고    scopus 로고
    • Models and issues in data stream systems
    • New York, NY, USA, ACM
    • B. Babcock, S. Babu, M. Datar, R. Motwani, and J. Widom. Models and issues in data stream systems. In PODS, pages 1-16, New York, NY, USA, 2002. ACM.
    • (2002) PODS , pp. 1-16
    • Babcock, B.1    Babu, S.2    Datar, M.3    Motwani, R.4    Widom, J.5
  • 3
    • 57549087610 scopus 로고    scopus 로고
    • R. Baldoni and A. Virgillito. Distributed Event, Routing in Publish/Subscribe Communication Systems: a Survey (revised version). Technical report, Dipartimento di Informatica e Sistemistica A. Ruberti, Universitá di Roma la Sapienza, 2006.
    • R. Baldoni and A. Virgillito. Distributed Event, Routing in Publish/Subscribe Communication Systems: a Survey (revised version). Technical report, Dipartimento di Informatica e Sistemistica "A. Ruberti", Universitá di Roma la Sapienza, 2006.
  • 4
    • 34548732521 scopus 로고    scopus 로고
    • Efficiently processing continuous k-nn queries on data streams
    • IEEE
    • C. Böhm, B. C. Ooi, C. Plant, and Y. Yan. Efficiently processing continuous k-nn queries on data streams. In ICDE, pages 156-165. IEEE, 2007.
    • (2007) ICDE , pp. 156-165
    • Böhm, C.1    Ooi, B.C.2    Plant, C.3    Yan, Y.4
  • 5
    • 0347649247 scopus 로고    scopus 로고
    • Top-k selection queries over relational databases: Mapping strategies and performance evaluation
    • N. Bruno, S. Chaudhuri, and L. Gravano. Top-k selection queries over relational databases: Mapping strategies and performance evaluation. ACM Trans. Database Syst., 27(2):153-187, 2002.
    • (2002) ACM Trans. Database Syst , vol.27 , Issue.2 , pp. 153-187
    • Bruno, N.1    Chaudhuri, S.2    Gravano, L.3
  • 6
    • 0034214590 scopus 로고    scopus 로고
    • Sum the odds to one and stop
    • F. Brass. Sum the odds to one and stop. Annals of Probability, 28(3):1384-1391, 2000.
    • (2000) Annals of Probability , vol.28 , Issue.3 , pp. 1384-1391
    • Brass, F.1
  • 7
    • 0034339363 scopus 로고    scopus 로고
    • Selecting a sequence of last successes in independent trials
    • F. Brass and D. Paindaveine. Selecting a sequence of last successes in independent trials. Journal of Applied Probability, 37:389-399, 2000.
    • (2000) Journal of Applied Probability , vol.37 , pp. 389-399
    • Brass, F.1    Paindaveine, D.2
  • 8
    • 35248820385 scopus 로고    scopus 로고
    • M. Caporuscio and P. Inverardi. Uncertain event-based model for egocentric context sensing. In SEM, pages 25-32, New York, NY, USA, 2005. ACM.
    • M. Caporuscio and P. Inverardi. Uncertain event-based model for egocentric context sensing. In SEM, pages 25-32, New York, NY, USA, 2005. ACM.
  • 9
    • 0034503965 scopus 로고    scopus 로고
    • Achieving scalability and expressiveness in an internet-scale event notification service
    • New York, NY, USA, ACM Press
    • A. Carzaniga, D. S. Rosenblum, and A. L. Wolf. Achieving scalability and expressiveness in an internet-scale event notification service. In PODC, pages 219-227, New York, NY, USA, 2000. ACM Press.
    • (2000) PODC , pp. 219-227
    • Carzaniga, A.1    Rosenblum, D.S.2    Wolf, A.L.3
  • 10
    • 16244369099 scopus 로고    scopus 로고
    • R. Chand and P. Felber. Xnet: A reliable content-based publish/subscribe system. In SRDS, pages 264-273, Washington, DC, USA, 2004. IEEE Computer Society.
    • R. Chand and P. Felber. Xnet: A reliable content-based publish/subscribe system. In SRDS, pages 264-273, Washington, DC, USA, 2004. IEEE Computer Society.
  • 11
    • 27144484183 scopus 로고    scopus 로고
    • Semantic peer-to-peer overlays for publish/subscribe networks
    • R. Chand and P. Felber. Semantic peer-to-peer overlays for publish/subscribe networks. In Euro-Par, pages 1194-1204, 2005.
    • (2005) Euro-Par , pp. 1194-1204
    • Chand, R.1    Felber, P.2
  • 13
    • 85011110669 scopus 로고    scopus 로고
    • Ad-hoc top-k query answering for data streams
    • VLDB Endowment
    • G. Das, D. Gunopulos, N. Koudas, and N. Sarkas. Ad-hoc top-k query answering for data streams. In VLDB, pages 183-194. VLDB Endowment, 2007.
    • (2007) VLDB , pp. 183-194
    • Das, G.1    Gunopulos, D.2    Koudas, N.3    Sarkas, N.4
  • 15
    • 0038969993 scopus 로고    scopus 로고
    • Filtering algorithms and implementation for very fast publish/subscribe systems
    • F. Fabret, H. A. Jacobsen, F. Llirbat, J. Pereira, K. A. Ross, and D. Shasha. Filtering algorithms and implementation for very fast publish/subscribe systems. SIGMOD Rec., 30(2):115-126, 2001.
    • (2001) SIGMOD Rec , vol.30 , Issue.2 , pp. 115-126
    • Fabret, F.1    Jacobsen, H.A.2    Llirbat, F.3    Pereira, J.4    Ross, K.A.5    Shasha, D.6
  • 16
    • 0033075316 scopus 로고    scopus 로고
    • Combining fuzzy information from multiple systems
    • R. Fagin. Combining fuzzy information from multiple systems. J. Comput. Syst. Sci., 58(1):83-99, 1999.
    • (1999) J. Comput. Syst. Sci , vol.58 , Issue.1 , pp. 83-99
    • Fagin, R.1
  • 17
    • 0036372565 scopus 로고    scopus 로고
    • L. Gao and X. S. Wang. Continually evaluating similarity-based pattern queries on a streaming time series. In SIGMOD, pages 370-381, New York, NY, USA, 2002. ACM.
    • L. Gao and X. S. Wang. Continually evaluating similarity-based pattern queries on a streaming time series. In SIGMOD, pages 370-381, New York, NY, USA, 2002. ACM.
  • 18
    • 57549109296 scopus 로고    scopus 로고
    • S. Kale, E. Hazan, F. Cao, and J. P. Singh. Analysis and algorithms for content-based event matching. In ICDCSW, pages 363-369, Washington, DC, USA, 2005. IEEE Computer Society.
    • S. Kale, E. Hazan, F. Cao, and J. P. Singh. Analysis and algorithms for content-based event matching. In ICDCSW, pages 363-369, Washington, DC, USA, 2005. IEEE Computer Society.
  • 19
    • 28444458945 scopus 로고    scopus 로고
    • Approximate nn queries on streams with guaranteed error/performance bounds
    • VLDB Endowment
    • N. Koudas, B. C. Ooi, K.-L. Tan, and R. Zhang. Approximate nn queries on streams with guaranteed error/performance bounds. In VLDB, pages 804-815. VLDB Endowment, 2004.
    • (2004) VLDB , pp. 804-815
    • Koudas, N.1    Ooi, B.C.2    Tan, K.-L.3    Zhang, R.4
  • 20
    • 35248824649 scopus 로고    scopus 로고
    • A. Lekova, K. Skjelsvik, T. Plagemann, and V. Goebel. Fuzzy logic-based event notification in sparse manets. In AINAW, pages 296-301, Washington, DC, USA, 2007. IEEE Computer Society.
    • A. Lekova, K. Skjelsvik, T. Plagemann, and V. Goebel. Fuzzy logic-based event notification in sparse manets. In AINAW, pages 296-301, Washington, DC, USA, 2007. IEEE Computer Society.
  • 21
    • 28444439519 scopus 로고    scopus 로고
    • X. Lin, Y. Yuan, W. Wang, and H. Lu. Stabbing the sky: Efficient skyline computation over sliding windows. In ICDE, pages 502-513, Washington, DC, USA, 2005. IEEE Computer Society.
    • X. Lin, Y. Yuan, W. Wang, and H. Lu. Stabbing the sky: Efficient skyline computation over sliding windows. In ICDE, pages 502-513, Washington, DC, USA, 2005. IEEE Computer Society.
  • 22
    • 35248874756 scopus 로고    scopus 로고
    • A-topss - a publish/subscribe system supporting approximate matching
    • H. Liu and H.-A. Jacobsen. A-topss - a publish/subscribe system supporting approximate matching. In VLDB, pages 1107-1110, 2002.
    • (2002) VLDB , pp. 1107-1110
    • Liu, H.1    Jacobsen, H.-A.2
  • 23
    • 35248874756 scopus 로고    scopus 로고
    • A-topss - a publish/subscribe system supporting imperfect information processing
    • August
    • H. Liu and H.-A. Jacobsen. A-topss - a publish/subscribe system supporting imperfect information processing. In VLDB, pages 281-1284, August 2004.
    • (2004) VLDB , pp. 281-1284
    • Liu, H.1    Jacobsen, H.-A.2
  • 24
    • 2442561339 scopus 로고    scopus 로고
    • H. Liu and H.-A. Jacobsen. Modeling uncertainties in publish/subscribe systems. In ICDE, page 510, Washington, DC, USA, 2004. IEEE Computer Society.
    • H. Liu and H.-A. Jacobsen. Modeling uncertainties in publish/subscribe systems. In ICDE, page 510, Washington, DC, USA, 2004. IEEE Computer Society.
  • 25
    • 84945708697 scopus 로고
    • On relevance, probabilistic indexing and information retrieval
    • M. E. Maron and J. L. Kuhns. On relevance, probabilistic indexing and information retrieval. J. ACM, 7(3):216-244, 1960.
    • (1960) J. ACM , vol.7 , Issue.3 , pp. 216-244
    • Maron, M.E.1    Kuhns, J.L.2
  • 26
    • 33744898753 scopus 로고    scopus 로고
    • Klee: A framework for distributed top-k query algorithms
    • VLDB Endowment
    • S. Michel, P. Triantafillou, and G. Weikum. Klee: a framework for distributed top-k query algorithms. In VLDB, pages 637-648. VLDB Endowment, 2005.
    • (2005) VLDB , pp. 637-648
    • Michel, S.1    Triantafillou, P.2    Weikum, G.3
  • 27
    • 34250656636 scopus 로고    scopus 로고
    • Continuous monitoring of top-k queries over sliding windows
    • New York, NY, USA, ACM
    • K. Mouratidis, S. Bakiras. and D. Papadias. Continuous monitoring of top-k queries over sliding windows. In SIGMOD, pages 635-646, New York, NY, USA, 2006. ACM.
    • (2006) SIGMOD , pp. 635-646
    • Mouratidis, K.1    Bakiras, S.2    Papadias, D.3
  • 28
    • 84928265482 scopus 로고    scopus 로고
    • Filter similarities in content-based publish/subscribe systems
    • London, UK, Springer-Verlag
    • G. Mühl, L. Fiege, and A. P. Buchmann. Filter similarities in content-based publish/subscribe systems. In ARCS, pages 224-240, London, UK, 2002. Springer-Verlag.
    • (2002) ARCS , pp. 224-240
    • Mühl, G.1    Fiege, L.2    Buchmann, A.P.3
  • 30
    • 3042585759 scopus 로고    scopus 로고
    • Disseminating information to mobile clients using publish-subscribe
    • G. Mühl, A. Ulbrich, K. Herrmann, and T. Weis. Disseminating information to mobile clients using publish-subscribe. IEEE Internet Computing, 8(3):46-53, 2004.
    • (2004) IEEE Internet Computing , vol.8 , Issue.3 , pp. 46-53
    • Mühl, G.1    Ulbrich, A.2    Herrmann, K.3    Weis, T.4
  • 31
    • 33644521557 scopus 로고    scopus 로고
    • G. P. Picco, D. Balzarotti, and P. Costa. Lights: a lightweight, customizable tuple space supporting context-aware applications. In SAC, pages 413-419, New York, NY, USA, 2005. ACM.
    • G. P. Picco, D. Balzarotti, and P. Costa. Lights: a lightweight, customizable tuple space supporting context-aware applications. In SAC, pages 413-419, New York, NY, USA, 2005. ACM.
  • 32
    • 84994361444 scopus 로고    scopus 로고
    • P. R. Pietzuch and J. M. Bacon. Hermes: A distributed event-based middleware architecture. ICDCSW, 00:611, 2002.
    • P. R. Pietzuch and J. M. Bacon. Hermes: A distributed event-based middleware architecture. ICDCSW, 00:611, 2002.
  • 33
    • 44949153411 scopus 로고    scopus 로고
    • C. Raiciu, D. S. Rosenblum, and M. Handley. Revisiting content-based publish/subscribe. In ICDCSW, page 19, Washington, DC, USA, 2006. IEEE Computer Society.
    • C. Raiciu, D. S. Rosenblum, and M. Handley. Revisiting content-based publish/subscribe. In ICDCSW, page 19, Washington, DC, USA, 2006. IEEE Computer Society.
  • 35
    • 79959883118 scopus 로고
    • Computer evaluation of indexing and text processing
    • G. Salton and M. E. Lesk. Computer evaluation of indexing and text processing. J. ACM, 15(1):8-36, 1968.
    • (1968) J. ACM , vol.15 , Issue.1 , pp. 8-36
    • Salton, G.1    Lesk, M.E.2
  • 36
    • 33646692492 scopus 로고    scopus 로고
    • Green: A configurable and re-configurable publish-subscribe middleware for pervasive computing
    • T. Sivaharan, G. S. Blair, and G. Coulson. Green: A configurable and re-configurable publish-subscribe middleware for pervasive computing. In OTM Conferences (1), pages 732-749, 2005.
    • (2005) OTM Conferences (1) , pp. 732-749
    • Sivaharan, T.1    Blair, G.S.2    Coulson, G.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.