메뉴 건너뛰기




Volumn 7, Issue 8, 2014, Pages 613-624

An efficient publish/subscribe index for E-Commerce databases

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; QUERY PROCESSING;

EID: 84901781827     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/2732296.2732298     Document Type: Conference Paper
Times cited : (62)

References (29)
  • 1
    • 84922168179 scopus 로고    scopus 로고
    • Freebase Data Dumps
    • Freebase Data Dumps. https://developers.google.com/freebase/data.
  • 2
    • 34447566456 scopus 로고    scopus 로고
    • Distributed event routing in publish/subscribe communication systems: a survey
    • Technical Report 15-05, Dipartimento di Informatica e Sistemistica, Universitá di Roma "La Sapienzia", Rome, Italy,
    • R. Baldoni and A. Virgillito. Distributed event routing in publish/subscribe communication systems: a survey. Technical Report 15-05, Dipartimento di Informatica e Sistemistica, Universitá di Roma "La Sapienzia", Rome, Italy, 2005.
    • (2005)
    • Baldoni, R.1    Virgillito, A.2
  • 3
    • 1242332561 scopus 로고    scopus 로고
    • Forwarding in a content-based network
    • A. Carzaniga and A. L.Wolf. Forwarding in a content-based network. In SIGCOMM, pages 163-174, 2003.
    • (2003) SIGCOMM , pp. 163-174
    • Carzaniga, A.1    Wolf, A.L.2
  • 4
    • 0041917233 scopus 로고    scopus 로고
    • Re-tree: An efficient index structure for regular expressions
    • C. Y. Chan, M. N. Garofalakis, and R. Rastogi. Re-tree: An efficient index structure for regular expressions. In VLDB, pages 263-274, 2002.
    • (2002) VLDB , pp. 263-274
    • Chan, C.Y.1    Garofalakis, M.N.2    Rastogi, R.3
  • 5
    • 85011039350 scopus 로고    scopus 로고
    • Value-based notification conditions in large-scale publish/subscribe systems
    • B. Chandramouli, J. Phillips, and J. Yang. Value-based notification conditions in large-scale publish/subscribe systems. In VLDB, pages 878-889, 2007.
    • (2007) VLDB , pp. 878-889
    • Chandramouli, B.1    Phillips, J.2    Yang, J.3
  • 6
    • 78049375142 scopus 로고    scopus 로고
    • End-to-end support for joins in large-scale publish/subscribe systems
    • B. Chandramouli and J. Yang. End-to-end support for joins in large-scale publish/subscribe systems. PVLDB, 1(1):434-450, 2008.
    • (2008) PVLDB , vol.1 , Issue.1 , pp. 434-450
    • Chandramouli, B.1    Yang, J.2
  • 7
    • 78650756638 scopus 로고    scopus 로고
    • Load balancing content-based publish/subscribe systems
    • A. K. Y. Cheung and H.-A. Jacobsen. Load balancing content-based publish/subscribe systems. ACM Trans. Comput. Syst., 28(4):9, 2010.
    • (2010) ACM Trans. Comput. Syst. , vol.28 , Issue.4 , pp. 9
    • Cheung, A.K.Y.1    Jacobsen, H.-A.2
  • 8
    • 52649152249 scopus 로고    scopus 로고
    • Automatic extraction of useful facet hierarchies from text databases
    • W. Dakka and P. G. Ipeirotis. Automatic extraction of useful facet hierarchies from text databases. In ICDE, pages 466-475, 2008.
    • (2008) ICDE , pp. 466-475
    • Dakka, W.1    Ipeirotis, P.G.2
  • 11
    • 77954301186 scopus 로고    scopus 로고
    • Harvesting relational tables from lists on the web
    • H. Elmeleegy, J. Madhavan, and A. Y. Halevy. Harvesting relational tables from lists on the web. PVLDB, 2(1):1078-1089, 2009.
    • (2009) PVLDB , vol.2 , Issue.1 , pp. 1078-1089
    • Elmeleegy, H.1    Madhavan, J.2    Halevy, A.Y.3
  • 14
    • 35048848668 scopus 로고    scopus 로고
    • Meghdoot: Content-based publish/subscribe over p2p networks
    • A. Gupta, O. D. Sahin, D. Agrawal, and A. El Abbadi. Meghdoot: Content-based publish/subscribe over p2p networks. In Middleware, pages 254-273, 2004.
    • (2004) Middleware , pp. 254-273
    • Gupta, A.1    Sahin, O.D.2    Agrawal, D.3    Abbadi, E.A.4
  • 17
    • 52649152981 scopus 로고    scopus 로고
    • Standing out in a crowd: Selecting attributes for maximum visibility
    • M. Miah, G. Das, V. Hristidis, and H. Mannila. Standing out in a crowd: Selecting attributes for maximum visibility. In ICDE, pages 356-365, 2008.
    • (2008) ICDE , pp. 356-365
    • Miah, M.1    Das, G.2    Hristidis, V.3    Mannila, H.4
  • 18
    • 35448978777 scopus 로고    scopus 로고
    • Boosting topic-based publish-subscribe systems with dynamic clustering
    • T. Milo, T. Zur, and E. Verbin. Boosting topic-based publish-subscribe systems with dynamic clustering. In SIGMOD Conference, pages 749-760, 2007.
    • (2007) SIGMOD Conference , pp. 749-760
    • Milo, T.1    Zur, T.2    Verbin, E.3
  • 19
    • 84862644813 scopus 로고    scopus 로고
    • High-performance complex event processing over xml streams
    • B. Mozafari, K. Zeng, and C. Zaniolo. High-performance complex event processing over xml streams. In SIGMOD Conference, pages 253-264, 2012.
    • (2012) SIGMOD Conference , pp. 253-264
    • Mozafari, B.1    Zeng, K.2    Zaniolo, C.3
  • 20
    • 79959975908 scopus 로고    scopus 로고
    • Be-tree: an index structure to efficiently match boolean expressions over high-dimensional discrete space
    • M. Sadoghi and H.-A. Jacobsen. Be-tree: an index structure to efficiently match boolean expressions over high-dimensional discrete space. In SIGMOD Conference, pages 637-648, 2011.
    • (2011) SIGMOD Conference , pp. 637-648
    • Sadoghi, M.1    Jacobsen, H.-A.2
  • 21
    • 84864248758 scopus 로고    scopus 로고
    • Relevance matters: Capitalizing on less (top-k matching in publish/subscribe)
    • M. Sadoghi and H.-A. Jacobsen. Relevance matters: Capitalizing on less (top-k matching in publish/subscribe). In ICDE, pages 786-797, 2012.
    • (2012) ICDE , pp. 786-797
    • Sadoghi, M.1    Jacobsen, H.-A.2
  • 22
    • 84880385098 scopus 로고    scopus 로고
    • Analysis and optimization for boolean expression indexing
    • M. Sadoghi and H.-A. Jacobsen. Analysis and optimization for boolean expression indexing. ACM Trans. Database Syst., 38(2):8, 2013.
    • (2013) ACM Trans. Database Syst. , vol.38 , Issue.2 , pp. 8
    • Sadoghi, M.1    Jacobsen, H.-A.2
  • 25
    • 77954751023 scopus 로고    scopus 로고
    • From information to knowledge: harvesting entities and relationships from web sources
    • G. Weikum and M. Theobald. From information to knowledge: harvesting entities and relationships from web sources. In PODS, pages 65-76, 2010.
    • (2010) PODS , pp. 65-76
    • Weikum, G.1    Theobald, M.2
  • 27
    • 34250735599 scopus 로고    scopus 로고
    • High-performance complex event processing over streams
    • E. Wu, Y. Diao, and S. Rizvi. High-performance complex event processing over streams. In SIGMOD Conference, pages 407-418, 2006.
    • (2006) SIGMOD Conference , pp. 407-418
    • Wu, E.1    Diao, Y.2    Rizvi, S.3
  • 28
    • 84862653732 scopus 로고    scopus 로고
    • Probase: a probabilistic taxonomy for text understanding
    • W. Wu, H. Li, H. Wang, and K. Q. Zhu. Probase: a probabilistic taxonomy for text understanding. In SIGMOD Conference, pages 481-492, 2012.
    • (2012) SIGMOD Conference , pp. 481-492
    • Wu, W.1    Li, H.2    Wang, H.3    Zhu, K.Q.4
  • 29
    • 0028448529 scopus 로고
    • Index structures for selective dissemination of information under the boolean model
    • T. W. Yan and H. Garcia-Molina. Index structures for selective dissemination of information under the boolean model. ACM Trans. Database Syst., 19(2):332-364, 1994.
    • (1994) ACM Trans. Database Syst. , vol.19 , Issue.2 , pp. 332-364
    • Yan, T.W.1    Garcia-Molina, H.2


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