Extended conference paper
Fast in-memory XPath search using compressed indexes
Article first published online: 3 OCT 2013
Copyright © 2013 John Wiley & Sons, Ltd.
Software: Practice and Experience
How to Cite
Arroyuelo, D., Claude, F., Maneth, S., Mäkinen, V., Navarro, G., Nguyễn, K., Sirén, J. and Välimäki, N. (2013), Fast in-memory XPath search using compressed indexes. Softw: Pract. Exper.. doi: 10.1002/spe.2227
- Article first published online: 3 OCT 2013
- Manuscript Accepted: 19 AUG 2013
- Manuscript Revised: 13 AUG 2013
- Manuscript Received: 12 MAR 2013
- succinct data structures;
- tree automata
Extensible Markup Language (XML) documents consist of text data plus structured data (markup). XPath allows to query both text and structure. Evaluating such hybrid queries is challenging. We present a system for in-memory evaluation of XPath search queries, that is, queries with text and structure predicates, yet without advanced features such as backward axes, arithmetics, and joins. We show that for this query fragment, which contains Forward Core XPath, our system, dubbed Succinct XML Self-Index (‘SXSI’), outperforms existing systems by 1–3 orders of magnitude. SXSI is based on state-of-the-art indexes for text and structure data. It combines two novelties. On one hand, it represents the XML data in a compact indexed form, which allows it to handle larger collections in main memory while supporting powerful search and navigation operations over the text and the structure. On the other hand, it features an execution engine that uses tree automata and cleverly chooses evaluation orders that leverage the speeds of the respective indexes. SXSI is modular and allows seamless replacement of its indexes. This is demonstrated through experiments with (1) a text index specialized for search of bio sequences, and (2) a word-based text index specialized for natural language search. Copyright © 2013 John Wiley & Sons, Ltd.