메뉴 건너뛰기




Volumn 233, Issue , 2007, Pages 226-237

The arbitrary Boolean publish/subscribe model: Making the case

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; CONTENT BASED RETRIEVAL; DECISION SUPPORT SYSTEMS; KNOWLEDGE BASED SYSTEMS;

EID: 34548019998     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1266894.1266938     Document Type: Conference Paper
Times cited : (5)

References (33)
  • 2
    • 84994268368 scopus 로고    scopus 로고
    • Predicate Matching and Subscription Matching in Publish/Subscribe Systems
    • Austria, July
    • G. Ashayer, H.-A. Jacobsen, and H. Leung. Predicate Matching and Subscription Matching in Publish/Subscribe Systems. In ICDCSW '02, Austria, July 2002.
    • (2002) ICDCSW '02
    • Ashayer, G.1    Jacobsen, H.-A.2    Leung, H.3
  • 3
    • 33646685019 scopus 로고    scopus 로고
    • A Detailed Investigation of Memory Requirements for Publish/Subscribe Filtering Algorithms
    • Cyprus, November
    • S. Bittner and A. Hinze. A Detailed Investigation of Memory Requirements for Publish/Subscribe Filtering Algorithms. In CoopIS 2005, Cyprus, November 2005.
    • (2005) CoopIS 2005
    • Bittner, S.1    Hinze, A.2
  • 4
    • 34548016490 scopus 로고    scopus 로고
    • Dimension-Based Subscription Pruning for Pub/Sub
    • S. Bittner and A. Hinze. Dimension-Based Subscription Pruning for Pub/Sub. In ICDCSW '06, 2006.
    • (2006) ICDCSW '06
    • Bittner, S.1    Hinze, A.2
  • 5
    • 33845425756 scopus 로고    scopus 로고
    • Event Distributions in Online Book Auctions
    • Technical Report 03/2006, Computer Science Department, Waikato University, Feb
    • S. Bittner and A. Hinze. Event Distributions in Online Book Auctions. Technical Report 03/2006, Computer Science Department, Waikato University, Feb 2006.
    • (2006)
    • Bittner, S.1    Hinze, A.2
  • 6
    • 34548045254 scopus 로고    scopus 로고
    • Optimizing Pub/Sub Systems by Advertisement Pruning
    • S. Bittner and A. Hinze. Optimizing Pub/Sub Systems by Advertisement Pruning. In DOA 2006, 2006.
    • (2006) DOA 2006
    • Bittner, S.1    Hinze, A.2
  • 8
    • 0035017222 scopus 로고    scopus 로고
    • Efficient Filtering in Pub-Sub Systems using Binary Decision Diagrams
    • A. Campailla, S. Chaki, E. Clarke, S. Jha, and H. Veith. Efficient Filtering in Pub-Sub Systems using Binary Decision Diagrams. In ICSE 2001, 2001.
    • (2001) ICSE 2001
    • Campailla, A.1    Chaki, S.2    Clarke, E.3    Jha, S.4    Veith, H.5
  • 9
    • 0034503965 scopus 로고    scopus 로고
    • Achieving Scalability and Expressiveness in an Internet-Scale Event Notification Service
    • A. Carzaniga, D. S. Rosenblum, and A. L. Wolf. Achieving Scalability and Expressiveness in an Internet-Scale Event Notification Service. In PODC 2000.
    • PODC 2000
    • Carzaniga, A.1    Rosenblum, D.S.2    Wolf, A.L.3
  • 10
    • 28444449913 scopus 로고    scopus 로고
    • Forwarding in a Content-Based Network
    • A. Carzaniga and A. L. Wolf. Forwarding in a Content-Based Network. In SIGCOMM '03, 2003.
    • (2003) SIGCOMM '03
    • Carzaniga, A.1    Wolf, A.L.2
  • 11
    • 84942103336 scopus 로고    scopus 로고
    • A Scalable Protocol for Content-Based Routing in Overlay Networks
    • USA, April
    • R. Chand and P. Felber. A Scalable Protocol for Content-Based Routing in Overlay Networks. In ACA 2003, USA, April, 2003.
    • (2003) ACA 2003
    • Chand, R.1    Felber, P.2
  • 12
    • 0037247156 scopus 로고    scopus 로고
    • Query Merging: Improving Query Subscription Processing in a Multicast Environment
    • A. Crespo, O. Buyukkokten, and H. Garcia-Molina. Query Merging: Improving Query Subscription Processing in a Multicast Environment. IEEE TKDE, 15(1):174-191, 2003.
    • (2003) IEEE TKDE , vol.15 , Issue.1 , pp. 174-191
    • Crespo, A.1    Buyukkokten, O.2    Garcia-Molina, H.3
  • 16
    • 0039193977 scopus 로고
    • Efficient Recognition of Events in a Distributed System
    • J. Gough and G. Smith. Efficient Recognition of Events in a Distributed System. In ACSC-18, 1995.
    • (1995) ACSC-18
    • Gough, J.1    Smith, G.2
  • 17
  • 18
    • 27544490852 scopus 로고    scopus 로고
    • Expressive and Efficient Peer-to-Peer Queries
    • USA, January
    • D. Heimbigner. Expressive and Efficient Peer-to-Peer Queries. In HICSS-38, USA, January 2005.
    • (2005) HICSS-38
    • Heimbigner, D.1
  • 20
    • 84867570440 scopus 로고    scopus 로고
    • A Graphical User Interface for Boolean Query Specification
    • S. Jones, S. McInnes, and M. S. Staveley. A Graphical User Interface for Boolean Query Specification. IJDL, 2(2-3):207-223, 1999.
    • (1999) IJDL , vol.2 , Issue.2-3 , pp. 207-223
    • Jones, S.1    McInnes, S.2    Staveley, M.S.3
  • 21
    • 27944431765 scopus 로고    scopus 로고
    • A Unified Approach to Routing, Covering and Merging in Publish/Subscribe Systems based on Modified Binary Decision Diagrams
    • USA, June
    • G. Li, S. Hou, and H.-A. Jacobsen. A Unified Approach to Routing, Covering and Merging in Publish/Subscribe Systems based on Modified Binary Decision Diagrams. In ICDCS '05, USA, June 2005.
    • (2005) ICDCS '05
    • Li, G.1    Hou, S.2    Jacobsen, H.-A.3
  • 22
    • 0022078060 scopus 로고
    • Expressiveness and Language Choice
    • J. MacKinley and M. Genesereth. Expressiveness and Language Choice. DKE, 1:17-29, 1985.
    • (1985) DKE , vol.1 , pp. 17-29
    • MacKinley, J.1    Genesereth, M.2
  • 25
    • 0346927027 scopus 로고    scopus 로고
    • Supporting Covering and Merging in Content-Based Pub/Sub Systems: Beyond Name/Value Pairs
    • G. Mühl and L. Fiege. Supporting Covering and Merging in Content-Based Pub/Sub Systems: Beyond Name/Value Pairs. IEEE DS Online, 2(7), 2001.
    • (2001) IEEE DS Online , vol.2 , Issue.7
    • Mühl, G.1    Fiege, L.2
  • 26
    • 51349108602 scopus 로고    scopus 로고
    • Efficient Probabilistic Subsumption Checking for Content-based Pub/Sub Systems
    • A. M. Ouksel, O. Jurca, I. Podnar, and K. Aberer. Efficient Probabilistic Subsumption Checking for Content-based Pub/Sub Systems. In Middleware '06, 2006.
    • (2006) Middleware '06
    • Ouksel, A.M.1    Jurca, O.2    Podnar, I.3    Aberer, K.4
  • 28
    • 3042547933 scopus 로고    scopus 로고
    • Selection Conditions ins Main Memory
    • K. A. Ross. Selection Conditions ins Main Memory. ACM TODS, 29(1):132-161, 2004.
    • (2004) ACM TODS , vol.29 , Issue.1 , pp. 132-161
    • Ross, K.A.1
  • 29
    • 0003256112 scopus 로고    scopus 로고
    • Elvin has left the building: A publish/subscribe notification service with quenching
    • Australia, September
    • B. Segall and D. Arnold. Elvin has left the building: A publish/subscribe notification service with quenching. In A UUG97, Australia, September 1997.
    • (1997) A UUG97
    • Segall, B.1    Arnold, D.2
  • 30
    • 33644963185 scopus 로고    scopus 로고
    • Building Content-Based Publish/Subscribe Systems with Distributed Hash Tables
    • D. Tam, R., Azimi, and H.-A. Jacobsen. Building Content-Based Publish/Subscribe Systems with Distributed Hash Tables. In DBISP2P 2003, 2003.
    • (2003) DBISP2P 2003
    • Tam, D.1    Azimi, R.2    Jacobsen, H.-A.3
  • 31
    • 2442531963 scopus 로고    scopus 로고
    • Subscription Summarization: A New Paradigm for Efficient Publish/ Subscribe Systems
    • P. Triantafillou and A. Economides. Subscription Summarization: A New Paradigm for Efficient Publish/ Subscribe Systems. In ICDCS '04, 2004.
    • (2004) ICDCS '04
    • Triantafillou, P.1    Economides, A.2
  • 33
    • 0028448529 scopus 로고
    • Index Structures for Selective Dissemination of Information Under the Boolean Model
    • T. W. Yan and H. García-Molina. Index Structures for Selective Dissemination of Information Under the Boolean Model. ACM TODS, 19(2):332-364, 1994.
    • (1994) ACM TODS , vol.19 , Issue.2 , pp. 332-364
    • Yan, T.W.1    García-Molina, H.2


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