메뉴 건너뛰기




Volumn , Issue , 2007, Pages 1053-1062

Visibly pushdown automata for streaming XML

Author keywords

Pushdown automata; Query; Schema; Streaming algorithms; Typing; XML

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; PROBLEM SOLVING; QUERY PROCESSING;

EID: 35348906173     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1242572.1242714     Document Type: Conference Paper
Times cited : (60)

References (26)
  • 2
    • 0000535810 scopus 로고
    • Translations on a context free grammar
    • A. V. Aho and J. D. Ullman. Translations on a context free grammar. Information and Control, 19(19):439-475, 1971.
    • (1971) Information and Control , vol.19 , Issue.19 , pp. 439-475
    • Aho, A.V.1    Ullman, J.D.2
  • 3
    • 26444446962 scopus 로고    scopus 로고
    • Congruences for visibly pushdown languages
    • R. Alur, V. Kumar, P. Madhusudan, and M. Viswanathan. Congruences for visibly pushdown languages. In ICALP, pages 1102-1114, 2005.
    • (2005) ICALP , pp. 1102-1114
    • Alur, R.1    Kumar, V.2    Madhusudan, P.3    Viswanathan, M.4
  • 4
    • 4544311800 scopus 로고    scopus 로고
    • Visibly pushdown languages
    • ACM Press
    • B. Alur and P. Madhusudan. Visibly pushdown languages. In STOC, pages 202-211. ACM Press, 2004.
    • (2004) STOC , pp. 202-211
    • Alur, B.1    Madhusudan, P.2
  • 5
    • 33746254890 scopus 로고    scopus 로고
    • R. Alur and P. Madhusudan. Adding nesting structure to words. In DLT, LNCS 4036, pages 1-13, 2006.
    • R. Alur and P. Madhusudan. Adding nesting structure to words. In DLT, LNCS 4036, pages 1-13, 2006.
  • 6
    • 34848901704 scopus 로고    scopus 로고
    • Tree-walking automata do not recognize all regular languages
    • New York, NY, USA, ACM Press
    • Mikolaj Bojanczyk and Thomas Colcombet. Tree-walking automata do not recognize all regular languages. In STOC, pages 234-243, New York, NY, USA, 2005. ACM Press.
    • (2005) STOC , pp. 234-243
    • Bojanczyk, M.1    Colcombet, T.2
  • 7
    • 33749612519 scopus 로고    scopus 로고
    • An efficient XPath query processor for XML streams
    • Yi Chen, Susan B. Davidson, and Yifeng Zheng. An efficient XPath query processor for XML streams. In ICDE, page 79, 2006.
    • (2006) ICDE , pp. 79
    • Chen, Y.1    Davidson, S.B.2    Zheng, Y.3
  • 9
    • 35248821067 scopus 로고    scopus 로고
    • Processing XML streams with deterministic automata
    • Springer-Verlag
    • Todd J. Green, Gerome Miklau, Makoto Onizuka, and Dan Suciu. Processing XML streams with deterministic automata. In ICDT '03, pages 173-189, 2003. Springer-Verlag.
    • (2003) ICDT '03 , pp. 173-189
    • Green, T.J.1    Miklau, G.2    Onizuka, M.3    Suciu, D.4
  • 10
    • 33244481087 scopus 로고    scopus 로고
    • Lower bounds for sorting with few random accesses to external memory
    • ACM Press
    • Martin Grohe and Nicole Schweikardt. Lower bounds for sorting with few random accesses to external memory. In PODS '05, pages 238-249, 2005. ACM Press.
    • (2005) PODS '05 , pp. 238-249
    • Grohe, M.1    Schweikardt, N.2
  • 11
    • 1142291593 scopus 로고    scopus 로고
    • Stream processing of XPath queries with predicates
    • ACM Press
    • Ashish Kumar Gupta and Dan Suciu. Stream processing of XPath queries with predicates. In SIGMOD, pages 419-430. ACM Press, 2003.
    • (2003) SIGMOD , pp. 419-430
    • Kumar Gupta, A.1    Suciu, D.2
  • 13
    • 35048849847 scopus 로고    scopus 로고
    • Attribute grammars for scalable query processing on XML streams
    • DBPL, of
    • Christoph Koch and Stefanie Scherzinger. Attribute grammars for scalable query processing on XML streams. In DBPL, volume 2921 of LNCS, pages 233-256, 2003.
    • (2003) LNCS , vol.2921 , pp. 233-256
    • Koch, C.1    Scherzinger, S.2
  • 14
    • 35348860564 scopus 로고    scopus 로고
    • Minimization, learning, and conformance testing of boolean programs
    • to appear
    • V. Kumar, P. Madhusudan, and M. Viswanathan. Minimization, learning, and conformance testing of boolean programs. In CONCUR, 2006. to appear.
    • (2006) CONCUR
    • Kumar, V.1    Madhusudan, P.2    Viswanathan, M.3
  • 15
    • 33746224929 scopus 로고    scopus 로고
    • Visibly pushdown languages for xml
    • Technical Report UIUCDCS-R-2006-2704, UIUC, 2006
    • V. Kumar, P. Madhusudan, and M. Viswanathan. Visibly pushdown languages for xml. Technical Report UIUCDCS-R-2006-2704, UIUC, 2006.
    • Kumar, V.1    Madhusudan, P.2    Viswanathan, M.3
  • 17
    • 77049123728 scopus 로고    scopus 로고
    • Which XML schemas admit 1-pass preorder typing?
    • Wim Martens, Frank Neven, and Thomas Schwentick. Which XML schemas admit 1-pass preorder typing? In ICDT, pages 68-82, 2005.
    • (2005) ICDT , pp. 68-82
    • Martens, W.1    Neven, F.2    Schwentick, T.3
  • 18
    • 0038207893 scopus 로고    scopus 로고
    • Taxonomy of XML Schema Languages using Formal Language Theory
    • Montreal, Canada
    • M. Murata, D. Lee, and M. Mani. Taxonomy of XML Schema Languages using Formal Language Theory. In Extreme Markup Languages, Montreal, Canada, 2001.
    • (2001) Extreme Markup Languages
    • Murata, M.1    Lee, D.2    Mani, M.3
  • 19
    • 84887122289 scopus 로고    scopus 로고
    • Locating matches of tree patterns in forests
    • Springer-Verlag
    • Andreas Neumann and Helmut Seidl. Locating matches of tree patterns in forests. In FSTTCS, pages 134-145, 1998. Springer-Verlag.
    • (1998) FSTTCS , pp. 134-145
    • Neumann, A.1    Seidl, H.2
  • 20
    • 84892414233 scopus 로고    scopus 로고
    • Frank Neven. Automata, logic, and XML. In CSL, pages 2-26, London, UK, 2002. Springer-Verlag.
    • Frank Neven. Automata, logic, and XML. In CSL, pages 2-26, London, UK, 2002. Springer-Verlag.
  • 21
    • 0038486147 scopus 로고    scopus 로고
    • On the power of tree-walking automata
    • Frank Neven and Thomas Schwentick. On the power of tree-walking automata. Information Computing, 183(1):86-103, 2003.
    • (2003) Information Computing , vol.183 , Issue.1 , pp. 86-103
    • Neven, F.1    Schwentick, T.2
  • 22
    • 0033686791 scopus 로고    scopus 로고
    • DTD inference for views of XML data
    • New York, NY, USA, ACM Press
    • Y. Papakonstantinou and V. Vianu. DTD inference for views of XML data. In PODS, pages 35-46, New York, NY, USA, 2000. ACM Press.
    • (2000) PODS , pp. 35-46
    • Papakonstantinou, Y.1    Vianu, V.2
  • 23
    • 33750348339 scopus 로고    scopus 로고
    • Visibly pushdown expression effects for XML stream processing
    • Corin Pitcher. Visibly pushdown expression effects for XML stream processing. In Programming Language Technologies for XML, pages 1-14, 2005.
    • (2005) Programming Language Technologies for XML , pp. 1-14
    • Pitcher, C.1
  • 24
    • 0036036851 scopus 로고    scopus 로고
    • Validating streaming XML documents
    • New York, NY, USA, ACM Press
    • Luc Segoufin and Victor Vianu. Validating streaming XML documents. In PODS, pages 53-64, New York, NY, USA, 2002. ACM Press.
    • (2002) PODS , pp. 53-64
    • Segoufin, L.1    Vianu, V.2
  • 25
    • 35348917944 scopus 로고    scopus 로고
    • From practice to theory
    • Victor Vianu. XML: From practice to theory. In SBBD, pages 11-25, 2003.
    • (2003) SBBD , pp. 11-25
    • Victor Vianu, X.M.L.1


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