Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.3390/info9010012 | INFORMATION |
Keywords | Field | DocType |
XML, XPath, index, indexing, tree, automaton, finite state automaton, finite state machine | Data mining,Data structure,Automata theory,Formal language,XML,Computer science,Tree (data structure),Theoretical computer science,Finite-state machine,XML tree,XPath | Journal |
Volume | Issue | ISSN |
9 | 1 | 2078-2489 |
Citations | PageRank | References |
1 | 0.38 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Eliska Sestáková | 1 | 1 | 0.38 |
| Jan Janousek | 2 | 8 | 3.74 |