Next Article in Journal
Lightweight S-Box Architecture for Secure Internet of Things
Next Article in Special Issue
CSS Preprocessing: Tools and Automation Techniques
Previous Article in Journal
Generalized Single-Valued Neutrosophic Hesitant Fuzzy Prioritized Aggregation Operators and Their Applications to Multiple Criteria Decision-Making
Previous Article in Special Issue
EmoSpell, a Morphological and Emotional Word Analyzer
Article Menu

Export Article

Open AccessArticle
Information 2018, 9(1), 12;

Automata Approach to XML Data Indexing

Faculty of Information Technology, Czech Technical University in Prague, Thákurova 9, 160 00 Praha 6, Czech Republic
These authors contributed equally to this work.
Author to whom correspondence should be addressed.
Received: 1 December 2017 / Revised: 29 December 2017 / Accepted: 3 January 2018 / Published: 6 January 2018
(This article belongs to the Special Issue Special Issues on Languages Processing)
Full-Text   |   PDF [1534 KB, uploaded 9 January 2018]   |  


The internal structure of XML documents can be viewed as a tree. Trees are among the fundamental and well-studied data structures in computer science. They express a hierarchical structure and are widely used in many applications. This paper focuses on the problem of processing tree data structures; particularly, it studies the XML index problem. Although there exist many state-of-the-art methods, the XML index problem still belongs to the active research areas. However, existing methods usually lack clear references to a systematic approach to the standard theory of formal languages and automata. Therefore, we present some new methods solving the XML index problem using the automata theory. These methods are simple and allow one to efficiently process a small subset of XPath. Thus, having an XML data structure, our methods can be used efficiently as auxiliary data structures that enable answering a particular set of queries, e.g., XPath queries using any combination of the child and descendant-or-self axes. Given an XML tree model with n nodes, the searching phase uses the index, reads an input query of size m, finds the answer in time O ( m ) and does not depend on the size of the original XML document. View Full-Text
Keywords: XML; XPath; index; indexing; tree; automaton; finite state automaton; finite state machine XML; XPath; index; indexing; tree; automaton; finite state automaton; finite state machine

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).

Supplementary material


Share & Cite This Article

MDPI and ACS Style

Šestáková, E.; Janoušek, J. Automata Approach to XML Data Indexing. Information 2018, 9, 12.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Information EISSN 2078-2489 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top