메뉴 건너뛰기




Volumn 54, Issue 4, 2007, Pages

On deciding well-definedness for query languages on trees

Author keywords

Runtime errors; Well definedness; XQuery

Indexed keywords

DECISION TREES; ERRORS; ITERATIVE METHODS; PROBLEM SOLVING;

EID: 34547781897     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/1255443.1255447     Document Type: Article
Times cited : (2)

References (38)
  • 8
    • 0034165189 scopus 로고    scopus 로고
    • UnQL: A query language and algebra for semistructured data based on structural recursion
    • Buneman, P., Fernández, M., and Suciu, D. 2000. UnQL: a query language and algebra for semistructured data based on structural recursion. VLDB Journal 9, 1, 76-110.
    • (2000) VLDB Journal , vol.9 , Issue.1 , pp. 76-110
    • Buneman, P.1    Fernández, M.2    Suciu, D.3
  • 9
    • 0029376142 scopus 로고
    • Principles of programming with complex objects and collection types
    • Buneman, P., Naqvi, S. A., Tannen, V., and Wong, L. 1995. Principles of programming with complex objects and collection types. Theor. Comput. Sci. 149, 1, 3-48.
    • (1995) Theor. Comput. Sci. , vol.149 , Issue.1 , pp. 3-48
    • Buneman, P.1    Naqvi, S.A.2    Tannen, V.3    Wong, L.4
  • 17
    • 35048843191 scopus 로고    scopus 로고
    • Satisfiability of XPath expressions
    • Lecture Notes in Computer Science, Springer
    • Hidders, J. 2004. Satisfiability of XPath expressions. In Database Programming Languages - DBPL 2003. Revised Papers. Lecture Notes in Computer Science, vol. 2921. Springer, 21-36.
    • (2004) Database Programming Languages - DBPL 2003. Revised Papers , vol.2921 , pp. 21-36
    • Hidders, J.1
  • 21
    • 84976718399 scopus 로고
    • Containment of conjunctive queries: Beyond relations as sets
    • September
    • Ioannidis, Y. and Ramakrishnan, R. 1995. Containment of conjunctive queries: Beyond relations as sets. ACM Transactions on Database Systems 20, 3 (September), 288-324.
    • (1995) ACM Transactions on Database Systems , vol.20 , Issue.3 , pp. 288-324
    • Ioannidis, Y.1    Ramakrishnan, R.2
  • 24
    • 35248830648 scopus 로고    scopus 로고
    • Typechecking top-down uniform unranked tree transducers
    • Lecture Notes in Computer Science, Springer- Verlag
    • Martens, W. and Neven, F. 2003. Typechecking top-down uniform unranked tree transducers. In Database Theory - ICDT 2003. Lecture Notes in Computer Science, vol. 2572. Springer- Verlag, 64-78.
    • (2003) Database Theory - ICDT 2003 , vol.2572 , pp. 64-78
    • Martens, W.1    Neven, F.2
  • 27
    • 4243187063 scopus 로고    scopus 로고
    • Containment and equivalence for a fragment of XPath
    • Miklau, G. and Suciu, D. 2004. Containment and equivalence for a fragment of XPath. Journal of the ACM 51, 1, 2-45.
    • (2004) Journal of the ACM , vol.51 , Issue.1 , pp. 2-45
    • Miklau, G.1    Suciu, D.2
  • 30
    • 84892414233 scopus 로고    scopus 로고
    • Automata, logic, and XML
    • Lecture Notes in Computer Science, Springer
    • Neven, F. 2002a. Automata, logic, and XML. In Computer Science Logic - CSL 2002. Lecture Notes in Computer Science, vol. 2471. Springer, 2-26.
    • (2002) Computer Science Logic - CSL 2002 , vol.2471 , pp. 2-26
    • Neven, F.1
  • 31
    • 0038180542 scopus 로고    scopus 로고
    • Automata theory for XML researchers
    • Neven, F. 2002b. Automata theory for XML researchers. ACM SIGMOD Record 31, 3, 39-46.
    • (2002) ACM SIGMOD Record , vol.31 , Issue.3 , pp. 39-46
    • Neven, F.1
  • 35
    • 0001568609 scopus 로고    scopus 로고
    • Handbook of Formal Languages, Springer, Chapter 7
    • Thomas, W. 1997. Languages, Automata, and Logic. Handbook of Formal Languages, vol. 3. Springer, Chapter 7, 389-456.
    • (1997) Languages, Automata, and Logic , vol.3 , pp. 389-456
    • Thomas, W.1
  • 37


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