메뉴 건너뛰기




Volumn 23, Issue , 2004, Pages 177-188

On the memory requirements of XPath evaluation over XML streams

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BUFFER STORAGE; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; EVALUATION; STORAGE ALLOCATION (COMPUTER); THEOREM PROVING;

EID: 3142740856     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1055558.1055584     Document Type: Conference Paper
Times cited : (47)

References (23)
  • 1
    • 84877335908 scopus 로고    scopus 로고
    • Efficient filtering of XML documents for selective dissemination of information
    • M. Altinel and M. J. Franklin. Efficient filtering of XML documents for selective dissemination of information. In Proc. 26th VLDB, pages 53-64, 2000.
    • (2000) Proc. 26th VLDB , pp. 53-64
    • Altinel, M.1    Franklin, M.J.2
  • 2
    • 0036040742 scopus 로고    scopus 로고
    • Characterizing memory requirements for queries over continuous data streams
    • A. Arasu, B. Babcock, S. Babu, J. McAlister, and J. Widom. Characterizing memory requirements for queries over continuous data streams. In Proc. 21st PODS, pages 221-232, 2002.
    • (2002) Proc. 21st PODS , pp. 221-232
    • Arasu, A.1    Babcock, B.2    Babu, S.3    McAlister, J.4    Widom, J.5
  • 6
    • 0036206022 scopus 로고    scopus 로고
    • Efficient filtering of XML documents with XPath expressions
    • C. Y. Chan, P. Felber, M. N. Garofalakis, and R. Rastogi. Efficient filtering of XML documents with XPath expressions. In Proc. 18th ICDE, pages 235-244, 2002.
    • (2002) Proc. 18th ICDE , pp. 235-244
    • Chan, C.Y.1    Felber, P.2    Garofalakis, M.N.3    Rastogi, R.4
  • 7
    • 18744382587 scopus 로고    scopus 로고
    • On the optimality of holistic algorithms for twig queries
    • B. Choi, M. Mahoui, and D. Wood. On the optimality of holistic algorithms for twig queries. In Proc. 14th DEXA, pages 28-37, 2003.
    • (2003) Proc. 14th DEXA , pp. 28-37
    • Choi, B.1    Mahoui, M.2    Wood, D.3
  • 13
    • 1142275475 scopus 로고    scopus 로고
    • The complexity of XPath query evaluation
    • G. Gottlob, C. Koch, and R. Pichler. The complexity of XPath query evaluation. In Proc. 22nd PODS, pages 179-190, 2003.
    • (2003) Proc. 22nd PODS , pp. 179-190
    • Gottlob, G.1    Koch, C.2    Pichler, R.3
  • 15
    • 1142291593 scopus 로고    scopus 로고
    • Stream processing of XPath queries with predicates
    • A. K. Gupta and D. Suciu. Stream processing of XPath queries with predicates. In Proc. 22nd SIGMOD, pages 419-430, 2003.
    • (2003) Proc. 22nd SIGMOD , pp. 419-430
    • Gupta, A.K.1    Suciu, D.2
  • 16
    • 0004310001 scopus 로고    scopus 로고
    • Efficient evaluation of regular path expressions on streaming XML data
    • University of Washington
    • Z. Ives, A. Levy, and D. Weld. Efficient evaluation of regular path expressions on streaming XML data. Technical report, University of Washington, 2000.
    • (2000) Technical Report
    • Ives, Z.1    Levy, A.2    Weld, D.3
  • 19
    • 0344927725 scopus 로고    scopus 로고
    • An evaluation of regular path expressions with qualifiers against XML streams
    • D. Olteanu, T. Kiesling, and F. Bry. An evaluation of regular path expressions with qualifiers against XML streams. In Proc. 19th ICDE, pages 702-704, 2003.
    • (2003) Proc. 19th ICDE , pp. 702-704
    • Olteanu, D.1    Kiesling, T.2    Bry, F.3
  • 20
    • 1142303686 scopus 로고    scopus 로고
    • XPath queries on streaming data
    • F. Peng and S. S. Chawathe. XPath queries on streaming data. In Proc. 22nd SIGMOD, pages 431-442, 2003.
    • (2003) Proc. 22nd SIGMOD , pp. 431-442
    • Peng, F.1    Chawathe, S.S.2
  • 21
    • 1142287634 scopus 로고    scopus 로고
    • Typing and querying XML documents: Some complexity bounds
    • L. Segoufin. Typing and querying XML documents: Some complexity bounds. In Proc. 22nd PODS, pages 167-178, 2003.
    • (2003) Proc. 22nd PODS , pp. 167-178
    • Segoufin, L.1
  • 22
    • 85028752389 scopus 로고
    • The complexity of relational query languages
    • M. Y. Vardi. The complexity of relational query languages. In Proc. 14th STOC, pages 137-146, 1982.
    • (1982) Proc. 14th STOC , pp. 137-146
    • Vardi, M.Y.1
  • 23
    • 85039623622 scopus 로고
    • Some complexity questions related to distributive computing
    • A. C.-C. Yao. Some complexity questions related to distributive computing. In Proc. 11th STOC, pages 209-213, 1979.
    • (1979) Proc. 11th STOC , pp. 209-213
    • Yao, A.C.-C.1


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