메뉴 건너뛰기




Volumn 18, Issue 5, 2003, Pages 241-262

XQuery rewriting at the relational algebra level

Author keywords

Relational algebra level; XML; XQuery

Indexed keywords

ALGORITHMS; CORRELATION METHODS; DATABASE SYSTEMS; GRAPH THEORY; OPTIMIZATION; QUERY LANGUAGES;

EID: 3042761211     PISSN: 02676192     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (3)

References (60)
  • 1
    • 3042700959 scopus 로고    scopus 로고
    • IBM DB2XML Extender. http://www-4.ibm.com/software/data/db2/extenders
    • IBM DB2XML Extender
  • 5
    • 0040274055 scopus 로고    scopus 로고
    • May 2
    • XML Query Use Cases. http://www.w3.org/TR/xmlquery-use-cases, May 2 2003.
    • (2003) XML Query Use Cases
  • 11
  • 21
    • 0029212237 scopus 로고
    • An algebra for structured text search and a framework for its implementation
    • C. L. A. Clarke, G. V. Cormack, and F. J. Burkowski. An algebra for structured text search and a framework for its implementation. The Computer Journal, 38(l):43-56, 1995.
    • (1995) The Computer Journal , vol.38 , Issue.1 , pp. 43-56
    • Clarke, C.L.A.1    Cormack, G.V.2    Burkowski, F.J.3
  • 22
    • 0002275623 scopus 로고
    • Of nests and trees: A unified approach to processing queries that contain nested subqueries, aggregates, and quantifiers
    • Brighton, England, Sept.
    • U. Dayal. Of nests and trees: A unified approach to processing queries that contain nested subqueries, aggregates, and quantifiers. Proc. of the 13th Int. Conf. on Very Large Data Bases, pp. 197-208. Brighton, England, Sept. 1987.
    • (1987) Proc. of the 13th Int. Conf. on Very Large Data Bases , pp. 197-208
    • Dayal, U.1
  • 25
    • 0031653339 scopus 로고    scopus 로고
    • Optimizing regular path expressions using graph schemas
    • Orlando, Florida, Feb.
    • M. Fernandez and D. Suciu. Optimizing regular path expressions using graph schemas. Proc. of the 14th Int. Conf. on Data Engineering, pp. 14-23, Orlando, Florida, Feb. 1998.
    • (1998) Proc. of the 14th Int. Conf. on Data Engineering , pp. 14-23
    • Fernandez, M.1    Suciu, D.2
  • 26
    • 2442622123 scopus 로고    scopus 로고
    • Algebraic XML construction and its optimization in Natix
    • T. Fiebig and G. Moerkotte. Algebraic XML construction and its optimization in Natix. World Wide Web Journal. 4(3): 167-187, 2001.
    • (2001) World Wide Web Journal , vol.4 , Issue.3 , pp. 167-187
    • Fiebig, T.1    Moerkotte, G.2
  • 27
    • 0003292107 scopus 로고    scopus 로고
    • Storing and querying XML data using an RDMBS
    • Sept.
    • D. Florescu and D. Kossmann. Storing and querying XML data using an RDMBS. IEEE Data Engineering Bulletin, 22(3):27-34, Sept. 1999.
    • (1999) IEEE Data Engineering Bulletin , vol.22 , Issue.3 , pp. 27-34
    • Florescu, D.1    Kossmann, D.2
  • 29
    • 0002438128 scopus 로고    scopus 로고
    • Cost-based selection of path expression processing algorithms in object-oriented databases
    • Bombay, India, Sept.
    • G. Gardarin, J. Gruser, and Z. Tan. Cost-based selection of path expression processing algorithms in object-oriented databases. Proc. of the 22nd Int. Conf. on Very Large Data Bases, pp. 390-401, Bombay, India, Sept. 1996.
    • (1996) Proc. of the 22nd Int. Conf. on Very Large Data Bases , pp. 390-401
    • Gardarin, G.1    Gruser, J.2    Tan, Z.3
  • 30
    • 84994092452 scopus 로고    scopus 로고
    • DataGuides: Enabling query formulation and optimization in semistructured databases
    • Athens, Greece, Aug.
    • R. Goldman and J. Widom. DataGuides: Enabling query formulation and optimization in semistructured databases. Proc. of the 23rd Int. Conf. on Very Large Data Bases, pp. 436-445, Athens, Greece, Aug. 1997.
    • (1997) Proc. of the 23rd Int. Conf. on Very Large Data Bases , pp. 436-445
    • Goldman, R.1    Widom, J.2
  • 36
    • 0013253892 scopus 로고    scopus 로고
    • Efficient relational storage and retrieval of XML documents
    • University of Mannheim, Germany
    • C. C. Kanne and G. Moerkotte. Efficient relational storage and retrieval of XML documents. Technical report, University of Mannheim, Germany, 1999.
    • (1999) Technical Report
    • Kanne, C.C.1    Moerkotte, G.2
  • 38
    • 0020182801 scopus 로고
    • On optimizing an SQL-like nested query
    • Sept.
    • W. Kim. On optimizing an SQL-like nested query. ACM Transactions on Database Systems, 7(3):443-469, Sept. 1982.
    • (1982) ACM Transactions on Database Systems , vol.7 , Issue.3 , pp. 443-469
    • Kim, W.1
  • 41
    • 0004100616 scopus 로고    scopus 로고
    • Optimizing branching path expressions
    • Stanford University, June
    • J. McHugh and J. Widom. Optimizing branching path expressions. Technical report, Stanford University, June 1999.
    • (1999) Technical Report
    • McHugh, J.1    Widom, J.2
  • 46
    • 0002448463 scopus 로고
    • Improved unnesting algorithms for join aggregate SQL queries
    • Vancouver, Canada, Aug.
    • M. Muralikrishna. Improved unnesting algorithms for join aggregate SQL queries. Proc. of the 18th Int. Conf. on Very Large Data Bases, pp. 91-102, Vancouver, Canada, Aug. 1992.
    • (1992) Proc. of the 18th Int. Conf. on Very Large Data Bases , pp. 91-102
    • Muralikrishna, M.1
  • 59
    • 3042818909 scopus 로고    scopus 로고
    • PhD thesis, School of Computer Science. Univerisy of Waterloo, Ontario, Canada
    • H. Zhang. XML query processing and optimization. PhD thesis, School of Computer Science. Univerisy of Waterloo, Ontario, Canada, 2003.
    • (2003) XML Query Processing and Optimization
    • Zhang, H.1
  • 60
    • 26144478804 scopus 로고    scopus 로고
    • An XQuery canonical form and its translation to an extended relational algebra
    • School of Computer Science. University of Waterloo, Ontario, Canada, Oct.
    • H. Zhang and F. W. Tompa. An XQuery canonical form and its translation to an extended relational algebra. Technical Report CS2002-40, School of Computer Science. University of Waterloo, Ontario, Canada, Oct. 2002.
    • (2002) Technical Report , vol.CS2002-40
    • Zhang, H.1    Tompa, F.W.2


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