메뉴 건너뛰기




Volumn , Issue , 2005, Pages 216-227

Buffering in query evaluation over XML streams

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; QUERY LANGUAGES;

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

References (30)
  • 2
    • 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
  • 3
    • 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
    • 3142740856 scopus 로고    scopus 로고
    • On the memory requirements of XPath evaluation over XML streams
    • Z. Bar-Yossef, M. Fontoura, and V. Josifovski. On the memory requirements of XPath evaluation over XML streams. In Proc. 23rd PODS, pages 177-188, 2004.
    • (2004) Proc. 23rd PODS , pp. 177-188
    • Bar-Yossef, Z.1    Fontoura, M.2    Josifovski, V.3
  • 7
    • 0036953748 scopus 로고    scopus 로고
    • An information statistics approach to data stream and communication complexity
    • Z. Bar-Yossef, T. S. Jayram, R. Kumar, and D. Sivakumar. An information statistics approach to data stream and communication complexity. In Proc. 43rd FOCS, pages 209-218, 2002.
    • (2002) Proc. 43rd FOCS , pp. 209-218
    • Bar-Yossef, Z.1    Jayram, T.S.2    Kumar, R.3    Sivakumar, D.4
  • 9
    • 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
  • 10
    • 0036211877 scopus 로고    scopus 로고
    • YFilter: Efficient and scalable filtering of XML documents
    • Y. Diao, P. M. Fischer, M. J. Franklin, and R. To. YFilter: Efficient and scalable filtering of XML documents. In Proc. 18th ICDE, pages 341-342, 2002.
    • (2002) Proc. 18th ICDE , pp. 341-342
    • Diao, Y.1    Fischer, P.M.2    Franklin, M.J.3    To, R.4
  • 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
  • 14
    • 35248821067 scopus 로고    scopus 로고
    • Processing XML streams with deterministic automata
    • T. Green, G. Miklau, M. Onizuka, and D. Suciu. Processing XML streams with deterministic automata. In Proc. 9th ICDT, pages 173-189, 2003.
    • (2003) Proc. 9th ICDT , pp. 173-189
    • Green, T.1    Miklau, G.2    Onizuka, M.3    Suciu, D.4
  • 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
  • 17
    • 1842487171 scopus 로고    scopus 로고
    • Tight lower bounds for the distinct elements problem
    • P. Indyk and D. Woodruff. Tight lower bounds for the distinct elements problem. In Proc. 44th FOCS, pages 283-289, 2003.
    • (2003) Proc. 44th FOCS , pp. 283-289
    • Indyk, P.1    Woodruff, D.2
  • 18
    • 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
  • 20
    • 77954439407 scopus 로고    scopus 로고
    • Schema-based scheduling of event processors and buffer minimization for queries on structured data streams
    • C. Koch, S. Scherzinger, N. Schweikardt, and B. Stegmaier. Schema-based scheduling of event processors and buffer minimization for queries on structured data streams. In Proc. 30th VLDB, pages 228-239, 2004.
    • (2004) Proc. 30th VLDB , pp. 228-239
    • Koch, C.1    Scherzinger, S.2    Schweikardt, N.3    Stegmaier, B.4
  • 23
    • 85012154596 scopus 로고    scopus 로고
    • Projecting XML documents
    • A. Marian and J. Simeon. Projecting XML documents. In Proc. 29th VLDB, pages 213-224, 2003.
    • (2003) Proc. 29th VLDB , pp. 213-224
    • Marian, A.1    Simeon, J.2
  • 25
    • 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
  • 26
    • 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
  • 27
    • 0036038680 scopus 로고    scopus 로고
    • Space lower bounds for distance approximation in the data stream model
    • M. Saks and X. Sun. Space lower bounds for distance approximation in the data stream model. In Proc. 34th STOC, pages 360-369, 2002.
    • (2002) Proc. 34th STOC , pp. 360-369
    • Saks, M.1    Sun, X.2
  • 28
    • 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
  • 29
    • 33244465752 scopus 로고    scopus 로고
    • Optimal space lower bounds for all frequency moments
    • D. Woodruff. Optimal space lower bounds for all frequency moments. In Proc. 15th SODA, pages 167-175, 2004.
    • (2004) Proc. 15th SODA , pp. 167-175
    • Woodruff, D.1
  • 30
    • 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가 분석하여 추출한 것입니다.