메뉴 건너뛰기




Volumn , Issue , 2008, Pages 541-550

Pruning nested query queries

Author keywords

Query rewriting; XML; XQuery

Indexed keywords

KNOWLEDGE MANAGEMENT; XML;

EID: 70349250087     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1458082.1458154     Document Type: Conference Paper
Times cited : (7)

References (22)
  • 3
    • 70349239959 scopus 로고    scopus 로고
    • Let a Single FLWOR Bloom (to improve XQuery plan generation)
    • M. Brantner, C-C. Kanne, and G. Moerkotte. Let a Single FLWOR Bloom (to improve XQuery plan generation). In XSym Workshop, 2007.
    • (2007) XSym Workshop
    • Brantner, M.1    Kanne, C.-C.2    Moerkotte, G.3
  • 9
    • 70349231925 scopus 로고    scopus 로고
    • M. F. Fernández and J. Siméon. The Galax System The XQuery Implementation for Discriminating Hackers Version 0.7.2, 2007
    • M. F. Fernández and J. Siméon. The Galax System "The XQuery Implementation for Discriminating Hackers" Version 0.7.2, 2007.
  • 10
    • 70349255269 scopus 로고    scopus 로고
    • XQuery Optimizing Based on Rewriting
    • M. Grinev. XQuery Optimizing Based on Rewriting. In ADBIS, 2004.
    • (2004) ADBIS
    • Grinev, M.1
  • 11
    • 70349249032 scopus 로고    scopus 로고
    • B. Gueni, T. Abdessalem, B.Cautis, and E.Waller. Pruning Nested XQuery Queries. Technical report, Telecom ParisTech, http://www.tsi.enst.fr/ publications/enst/techreport-2008-8307.pdf, 2008.
    • B. Gueni, T. Abdessalem, B.Cautis, and E.Waller. Pruning Nested XQuery Queries. Technical report, Telecom ParisTech, http://www.tsi.enst.fr/ publications/enst/techreport-2008-8307.pdf, 2008.
  • 13
    • 70349259710 scopus 로고    scopus 로고
    • On the role of Composition in XQuery
    • C. Koch. On the role of Composition in XQuery. In WebDB Workshop, 2005.
    • (2005) WebDB Workshop
    • Koch, C.1
  • 15
    • 0005311220 scopus 로고    scopus 로고
    • Answering XML queries on heterogeneous data sources
    • I. Manolescu, D. Florescu, and D. Kossmann. Answering XML queries on heterogeneous data sources. In VLDB Conf, 2001.
    • (2001) VLDB Conf
    • Manolescu, I.1    Florescu, D.2    Kossmann, D.3
  • 19
    • 0036367425 scopus 로고    scopus 로고
    • Efficient Algorithms for Minimizing Tree Pattern Queries
    • P. Ramanan. Efficient Algorithms for Minimizing Tree Pattern Queries. In SIGMOD Conf, 2002.
    • (2002) SIGMOD Conf
    • Ramanan, P.1
  • 22
    • 3142777879 scopus 로고    scopus 로고
    • Efficient Query Reformulation in Peer-Data Management Systems
    • I. Tatarinov and A. Y. Halevy. Efficient Query Reformulation in Peer-Data Management Systems. In SIGMOD Conf, 2004.
    • (2004) SIGMOD Conf
    • Tatarinov, I.1    Halevy, A.Y.2


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