XAL: An algebra for XML query optimization

F. Frasincar; G.J.P.M. Houben; C.D. Pau

doi:10.1145/563932.563912

XAL: An algebra for XML query optimization

F. Frasincar, G.J.P.M. Houben, C.D. Pau

Process Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

Abstract

This paper proposes XAL, an XML ALgebra. Its novelty is based on the simplicity of its data model and its well-defined logical operators, which makes it suitable for composability, optimizability, and semantics definition of a query language for XML data. At the heart of the algebra resides the notion of collection, a concept similar to the mathematician's monad or functional programmer's comprehension. The operators are classified in three clusters: extraction operators retrieve the needed information from XML documents, meta-operators control the evaluation of expressions, and construction operators build new XML documents from the extracted data. The resulting algebra has optimization laws similar to the known laws for transforming relational queries. As a consequence, we propose a heuristic optimization algorithm similar to its relational algebra counterpart.

Original language	English
Title of host publication	Database Technologies 2002 (Proceedings 13th Australasian Database Conference, ADC 2002, Melbourne, Australia, January 28-February 1, 2002)
Editors	Xiaofang Zhou
Publisher	Australian Computer Society
Pages	49-56
ISBN (Print)	0-909-92583-6
DOIs	https://doi.org/10.1145/563932.563912
Publication status	Published - 2002
Event	conference; Melbourne, Australia - Duration: 1 Jan 2002 → …

Conference

Conference	conference; Melbourne, Australia
Period	1/01/02 → …
Other	Melbourne, Australia

Access to Document

10.1145/563932.563912

Cite this

@inproceedings{fed128725c9f4e72ac299da8d104ffd1,

title = "XAL: An algebra for XML query optimization",

abstract = "This paper proposes XAL, an XML ALgebra. Its novelty is based on the simplicity of its data model and its well-defined logical operators, which makes it suitable for composability, optimizability, and semantics definition of a query language for XML data. At the heart of the algebra resides the notion of collection, a concept similar to the mathematician's monad or functional programmer's comprehension. The operators are classified in three clusters: extraction operators retrieve the needed information from XML documents, meta-operators control the evaluation of expressions, and construction operators build new XML documents from the extracted data. The resulting algebra has optimization laws similar to the known laws for transforming relational queries. As a consequence, we propose a heuristic optimization algorithm similar to its relational algebra counterpart.",

author = "F. Frasincar and G.J.P.M. Houben and C.D. Pau",

year = "2002",

doi = "10.1145/563932.563912",

language = "English",

isbn = "0-909-92583-6",

pages = "49--56",

editor = "Xiaofang Zhou",

booktitle = "Database Technologies 2002 (Proceedings 13th Australasian Database Conference, ADC 2002, Melbourne, Australia, January 28-February 1, 2002)",

publisher = "Australian Computer Society",

address = "Australia",

note = "conference; Melbourne, Australia ; Conference date: 01-01-2002",

}

XAL: An algebra for XML query optimization. / Frasincar, F.; Houben, G.J.P.M.; Pau, C.D.

Database Technologies 2002 (Proceedings 13th Australasian Database Conference, ADC 2002, Melbourne, Australia, January 28-February 1, 2002). ed. / Xiaofang Zhou. Australian Computer Society, 2002. p. 49-56.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - XAL: An algebra for XML query optimization

AU - Frasincar, F.

AU - Houben, G.J.P.M.

AU - Pau, C.D.

PY - 2002

Y1 - 2002

N2 - This paper proposes XAL, an XML ALgebra. Its novelty is based on the simplicity of its data model and its well-defined logical operators, which makes it suitable for composability, optimizability, and semantics definition of a query language for XML data. At the heart of the algebra resides the notion of collection, a concept similar to the mathematician's monad or functional programmer's comprehension. The operators are classified in three clusters: extraction operators retrieve the needed information from XML documents, meta-operators control the evaluation of expressions, and construction operators build new XML documents from the extracted data. The resulting algebra has optimization laws similar to the known laws for transforming relational queries. As a consequence, we propose a heuristic optimization algorithm similar to its relational algebra counterpart.

AB - This paper proposes XAL, an XML ALgebra. Its novelty is based on the simplicity of its data model and its well-defined logical operators, which makes it suitable for composability, optimizability, and semantics definition of a query language for XML data. At the heart of the algebra resides the notion of collection, a concept similar to the mathematician's monad or functional programmer's comprehension. The operators are classified in three clusters: extraction operators retrieve the needed information from XML documents, meta-operators control the evaluation of expressions, and construction operators build new XML documents from the extracted data. The resulting algebra has optimization laws similar to the known laws for transforming relational queries. As a consequence, we propose a heuristic optimization algorithm similar to its relational algebra counterpart.

U2 - 10.1145/563932.563912

DO - 10.1145/563932.563912

M3 - Conference contribution

SN - 0-909-92583-6

SP - 49

EP - 56

BT - Database Technologies 2002 (Proceedings 13th Australasian Database Conference, ADC 2002, Melbourne, Australia, January 28-February 1, 2002)

A2 - Zhou, Xiaofang

PB - Australian Computer Society

T2 - conference; Melbourne, Australia

Y2 - 1 January 2002

ER -

XAL: An algebra for XML query optimization

Abstract

Conference

Access to Document

Fingerprint

Cite this