Presentation 2017-01-27
A Translation from a Fragment of XPath to Deterministic Selecting Tree Automata with Lookahead Using Schemas
Masaya Kawamoto, Kenji Hashimoto, Seki Hiroyuki,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) XPath is known as a query language for XML documents. Translating an XPath formula to a deterministic tree automaton makes it simpler to evaluate it for an XML document. In this paper, we define a subclass of XPath, and propose a method for translating an XPath formula in that class to a deterministic selecting tree automaton with lookahead (DSTA$^B$). Our method translates a predicate part of a given XPath formula to a deterministic bottom-up tree automaton (DBTA) and translate the whole formula to a DSTA using the translated DBTA as a lookahead. Moreover, we improve the method by using a schema to eliminate useless rules for XML documents valid against the schema. Lastly we show the experimental result obtained by the toolimplemented based on the proposed method.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) XML / XPath / Schema / Tree automaton / DTD
Paper # MSS2016-75,SS2016-54
Date of Issue 2017-01-19 (MSS, SS)

Conference Information
Committee MSS / SS
Conference Date 2017/1/26(2days)
Place (in Japanese) (See Japanese page)
Place (in English) Kyoto Institute of Technology
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair Satoshi Yamane(Kanazawa Univ.) / Kazuhiro Ogata(JAIST)
Vice Chair Morikazu Nakamura(Univ. of Ryukyus) / Akio Nakata(Hiroshima City Univ.)
Secretary Morikazu Nakamura(Yamaguchi Univ.) / Akio Nakata(Toshiba)
Assistant Hideki Kinjo(Okinawa Univ.) / Kazuyuki Shima(Hiroshima City Univ.)

Paper Information
Registration To Technical Committee on Mathematical Systems Science and its applications / Technical Committee on Software Science
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A Translation from a Fragment of XPath to Deterministic Selecting Tree Automata with Lookahead Using Schemas
Sub Title (in English)
Keyword(1) XML
Keyword(2) XPath
Keyword(3) Schema
Keyword(4) Tree automaton
Keyword(5) DTD
1st Author's Name Masaya Kawamoto
1st Author's Affiliation Nagoya University(Nagoya Univ.)
2nd Author's Name Kenji Hashimoto
2nd Author's Affiliation Nagoya University(Nagoya Univ.)
3rd Author's Name Seki Hiroyuki
3rd Author's Affiliation Nagoya University(Nagoya Univ.)
Date 2017-01-27
Paper # MSS2016-75,SS2016-54
Volume (vol) vol.116
Number (no) MSS-425,SS-426
Page pp.pp.107-112(MSS), pp.107-112(SS),
#Pages 6
Date of Issue 2017-01-19 (MSS, SS)