메뉴 건너뛰기




Volumn 11, Issue 4, 2002, Pages 354-379

Efficient filtering of XML documents with XPath expressions

Author keywords

Data dissemination; Document filtering; Index structure; XML; XPath

Indexed keywords

ALGORITHMS; INDEXING (OF INFORMATION); INFORMATION DISSEMINATION; INTERNET; SYSTEM PROGRAM DOCUMENTATION;

EID: 0036993183     PISSN: 10668888     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00778-002-0077-6     Document Type: Article
Times cited : (114)

References (22)
  • 2
    • 84877335908 scopus 로고    scopus 로고
    • Efficient filtering of XML documents for selective dissemination of information
    • M. Altinel, M.J. Franklin (2000) Efficient filtering of XML documents for selective dissemination of information. In: Proc. VLDB, pp 53-64
    • (2000) Proc. VLDB , pp. 53-64
    • Altinel, M.1    Franklin, M.J.2
  • 4
    • 84883772540 scopus 로고    scopus 로고
    • Tree pattern relaxation
    • Prague, Czech Republic
    • S. Amer-Yahia, S. Cho, D. Srivastava (2002) Tree pattern relaxation. In: Proc. EDBT, pp 496-513, Prague, Czech Republic
    • (2002) Proc. EDBT , pp. 496-513
    • Amer-Yahia, S.1    Cho, S.2    Srivastava, D.3
  • 5
    • 0004214218 scopus 로고    scopus 로고
    • Apache (2001) Xerces C++ parser, http://xml.apache.org
    • (2001) Xerces C++ Parser
  • 6
    • 0001655450 scopus 로고    scopus 로고
    • Design and evaluation of a wide-area event notification service
    • A. Carzaniga, D.S. Rosenblum, A.L. Wolf (2001) Design and evaluation of a wide-area event notification service. ACM Trans Comput Syst 19(3):332-383
    • (2001) ACM Trans Comput Syst , vol.19 , Issue.3 , pp. 332-383
    • Carzaniga, A.1    Rosenblum, D.S.2    Wolf, A.L.3
  • 7
    • 0003984661 scopus 로고    scopus 로고
    • The Intel Corporation (2000) Intel netStructure XML accelerators. http://www.intel.com/netstructure/products/xml_accelerators.htm
    • (2000) Intel NetStructure XML Accelerators
  • 10
    • 0025449136 scopus 로고
    • A predicate matching algorithm for database rule systems
    • Atlantic City, N.J., USA
    • E.N. Hanson, M. Chaabouni, C.-H. Kim, Y.-W. Wang (1990) A predicate matching algorithm for database rule systems, In: Proc. ACM SIGMOD, pp 271-280, Atlantic City, N.J., USA
    • (1990) Proc. ACM SIGMOD , pp. 271-280
    • Hanson, E.N.1    Chaabouni, M.2    Kim, C.-H.3    Wang, Y.-W.4
  • 11
    • 0034826382 scopus 로고    scopus 로고
    • Filtering algorithms and implementations for very fast publish/subscribe systems
    • Santa Barbara, Calif., USA
    • F. Fabret, H.A. Jacobsen, F. Llirbat, K.A. Ross, D. Shasha (2001) Filtering algorithms and implementations for very fast publish/subscribe systems. In: Proc. ACM SIGMOD, pp 115-126, Santa Barbara, Calif., USA
    • (2001) Proc. ACM SIGMOD , pp. 115-126
    • Fabret, F.1    Jacobsen, H.A.2    Llirbat, F.3    Ross, K.A.4    Shasha, D.5
  • 15
    • 0034819132 scopus 로고    scopus 로고
    • Monitoring XML data on the Web
    • Santa Barbara, Calif., USA
    • B. Nguyen, S. Abiteboul, G. Cobena, M. Preda (2001) Monitoring XML data on the Web. In: Proc. ACM SIGMOD, pp 437-448, Santa Barbara, Calif., USA
    • (2001) Proc. ACM SIGMOD , pp. 437-448
    • Nguyen, B.1    Abiteboul, S.2    Cobena, G.3    Preda, M.4
  • 16
    • 0036367425 scopus 로고    scopus 로고
    • Efficient algorithms for minimizing tree pattern queries
    • Madison, Wis., USA
    • P. Ramanan (2002) Efficient algorithms for minimizing tree pattern queries. In: Proc. ACM SIGMOD, pp 299-309, Madison, Wis., USA
    • (2002) Proc. ACM SIGMOD , pp. 299-309
    • Ramanan, P.1
  • 17
    • 84883802390 scopus 로고    scopus 로고
    • Schema-driven evaluation of approximate tree-pattern queries
    • Prague, Czech Republic
    • T. Schlieder (2002) Schema-driven evaluation of approximate tree-pattern queries. In: Proc. EDBT, pp 514-532, Prague, Czech Republic
    • (2002) Proc. EDBT , pp. 514-532
    • Schlieder, T.1


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