Title :
Using regular tree automata as XML schemas
Author :
Chidlovskii, Boris
Author_Institution :
Xerox Res. Centre Eur., Grenoble Lab., Meylan, France
Abstract :
We address the problem of tight XML schemas and propose regular tree automata to model XML data. We show that the tree automata model is more powerful than the XML DTDs and is closed under main algebraic operations. We introduce the XML query algebra based on the tree automata model, and discuss the query optimization and query pruning techniques. Finally we show the conversion of tree automata schema into XML DTDs
Keywords :
Internet; automata theory; hypermedia markup languages; query processing; trees (mathematics); DTD; Internet; XML data model; XML schemas; document type definitions; query algebra; query optimization; query pruning; regular tree automata; Automata; Electronic switching systems; Europe; Laboratories; Large-scale systems; Postal services; Proposals; Query processing; SGML; XML;
Conference_Titel :
Advances in Digital Libraries, 2000. Proceedings. IEEE
Conference_Location :
Washington, DC
Print_ISBN :
0-7695-0659-3
DOI :
10.1109/ADL.2000.848373
