메뉴 건너뛰기




Volumn 23, Issue , 2004, Pages 13-22

Conditional XPath, the first order complete XPath dialect

Author keywords

[No Author keywords available]

Indexed keywords

CHARACTERIZATION; EVALUATION; QUERY LANGUAGES; SEMANTICS; THEOREM PROVING; TREES (MATHEMATICS);

EID: 3142685198     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1055558.1055562     Document Type: Conference Paper
Times cited : (39)

References (30)
  • 4
    • 0036044725 scopus 로고    scopus 로고
    • The complexity of first-order and monadic second-order logic revisited
    • M. Prick and M. Grohe. The complexity of first-order and monadic second-order logic revisited. In Proc. LICS'02, pages 215-224, 2002.
    • (2002) Proc. LICS'02 , pp. 215-224
    • Prick, M.1    Grohe, M.2
  • 5
    • 0003930956 scopus 로고
    • Oxford Science Publications: Mathematical Foundations and Computational Aspects
    • D.M. Gabbay, I. Hodkinson, and M. Reynolds. Temporal Logic. Oxford Science Publications, 1994. Volume 1: Mathematical Foundations and Computational Aspects.
    • (1994) Temporal Logic , vol.1
    • Gabbay, D.M.1    Hodkinson, I.2    Reynolds, M.3
  • 7
    • 0005410645 scopus 로고    scopus 로고
    • Efficient algorithms for processing XPath queries
    • G. Gottlob, C. Koch, and R. Pichler. Efficient algorithms for processing XPath queries. In Proc. VLDB'OS, 2002.
    • (2002) Proc. VLDB'OS
    • Gottlob, G.1    Koch, C.2    Pichler, R.3
  • 8
    • 1142275475 scopus 로고    scopus 로고
    • The complexity of XPath query evaluation
    • G. Gottlob, C. Koch, and R. Pichler. The complexity of XPath query evaluation. In Proc. PODS 2005, pages 179-190, 2003.
    • (2003) Proc. PODS 2005 , pp. 179-190
    • Gottlob, G.1    Koch, C.2    Pichler, R.3
  • 9
    • 0036051123 scopus 로고    scopus 로고
    • Monadic queries over tree-structured data
    • G. Gottlob and C. Koch. Monadic queries over tree-structured data. In Proc. LICS'02, 2002.
    • (2002) Proc. LICS'02
    • Gottlob, G.1    Koch, C.2
  • 10
    • 0002327753 scopus 로고
    • Upper and lower bounds for first order expressibility
    • N. Immerman. Upper and lower bounds for first order expressibility. J. Comput. Syst. Sci., 25:76-98, 1982.
    • (1982) J. Comput. Syst. Sci. , vol.25 , pp. 76-98
    • Immerman, N.1
  • 11
    • 0023252546 scopus 로고
    • Definability with bounded number of bound variables
    • Washington, Computer Society Press
    • N. Immerman and D. Kozen. Definability with bounded number of bound variables. In Proc. LICS , pages 236-244, Washington, 1987. Computer Society Press.
    • (1987) Proc. LICS , pp. 236-244
    • Immerman, N.1    Kozen, D.2
  • 13
    • 84944268606 scopus 로고    scopus 로고
    • Efficient processing of expressive node-selecting queries on XML data in secondary storage: A tree automata-based approach
    • C. Koch. Efficient processing of expressive node-selecting queries on XML data in secondary storage: A tree automata-based approach. In VLDB 2003, pages 249-260, 2003.
    • (2003) VLDB 2003 , pp. 249-260
    • Koch, C.1
  • 14
    • 84949804248 scopus 로고    scopus 로고
    • Inessential features
    • Christian Retore, editor, number 1328 in LNAI, Springer
    • M. Kracht. Inessential features. In Christian Retore, editor, Logical Aspects of Computational Linguistics, number 1328 in LNAI, pages 43-62. Springer, 1997.
    • (1997) Logical Aspects of Computational Linguistics , pp. 43-62
    • Kracht, M.1
  • 15
    • 35048898057 scopus 로고    scopus 로고
    • XPath with conditional axis relations
    • M. Marx. XPath with conditional axis relations. In Proc. EDBT'04, pages 477-494. 2004.
    • (2004) Proc. EDBT'04 , pp. 477-494
    • Marx, M.1
  • 16
    • 0033707278 scopus 로고    scopus 로고
    • Expressive and efficient pattern languages for tree-structured data
    • F. Neven and T. Schwentick. Expressive and Efficient Pattern Languages for Tree-Structured Data. In Proc. PODS'02, pages 145-156. 2000.
    • (2000) Proc. PODS'02 , pp. 145-156
    • Neven, F.1    Schwentick, T.2
  • 17
    • 0036038432 scopus 로고    scopus 로고
    • Containment and equivalence for an XPath fragment
    • G. Miklau and D. Suciu. Containment and equivalence for an XPath fragment. In Proc. PODS'02, pages 65-76, 2002.
    • (2002) Proc. PODS'02 , pp. 65-76
    • Miklau, G.1    Suciu, D.2
  • 21
  • 24
    • 0029204108 scopus 로고
    • On the complexity of bounded-variable queries
    • M. Vardi. On the complexity of bounded-variable queries. In Proceedings PODS-95, pages 266-276, 1995.
    • (1995) Proceedings PODS-95 , pp. 266-276
    • Vardi, M.1
  • 30
    • 0344379539 scopus 로고    scopus 로고
    • Two semantics for XPath
    • Bell Labs
    • P. Wadler. Two semantics for XPath. Technical report, Bell Labs, 2000.
    • (2000) Technical Report
    • Wadler, P.1


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