Query Automata Export

@inproceedings{citeulike:218677, abstract = {A main task in document transformation and information retrieval is locating subtrees satisfying some pattern. Therefore, unary queries, i.e., queries that map a tree to a set of its nodes, play an important role in the context of structured document databases. We want to understand how the natural and well-studied computation model of tree automata can be used to compute such queries. We dene a query automaton (QA) as a deterministic two-way nite automaton over trees that has the...}, author = {Neven, Frank and Schwentick, Thomas}, citeulike-article-id = {218677}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.26.2112}, keywords = {automata, mso, xml}, pages = {205--214}, posted-at = {2005-06-04 05:39:43}, priority = {0}, title = {Query Automata}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.26.2112}, year = {1999} }

TY - CONF ID - citeulike:218677 L3 - citeulike-article-id:218677 N2 - A main task in document transformation and information retrieval is locating subtrees satisfying some pattern. Therefore, unary queries, i.e., queries that map a tree to a set of its nodes, play an important role in the context of structured document databases. We want to understand how the natural and well-studied computation model of tree automata can be used to compute such queries. We dene a query automaton (QA) as a deterministic two-way nite automaton over trees that has the... EP - 214 TI - Query Automata SP - 205 KW - automata KW - mso KW - xml AU - Neven, Frank AU - Schwentick, Thomas PY - 1999/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.26.2112 ER -