Fast in-memory XPath search using compressed indexes-Reference-Cited by-同舟云学术

Fast in-memory XPath search using compressed indexes

Author:

Arroyuelo Diego¹,Claude Francisco²,Maneth Sebastian³,Mäkinen Veli⁴,Navarro Gonzalo⁵,Nguyễn Kim⁶,Sirén Jouni⁵,Välimäki Niko⁷

Affiliation:

1. Departamento de Informática; Universidad Técnica Federico Santa María; Chile

2. Escuela de Informática y Telecomunicaciones; Universidad Diego Portales; Chile

3. School of Informatics; University of Edinburgh; UK

4. HIIT and Department of Computer Science; University of Helsinki; Finland

5. Department of Computer Science; University of Chile; Chile

6. LRI; Université Paris-Sud; France

7. Department of Medical Genetics, Faculty of Medicine; University of Helsinki; Finland

Publisher

Wiley

Subject

Software

Reference68 articles.

1. XML Mind products Qizx XML query engine 2007 http://www.axyana.com/qizx

3. Signum Tauro 2008 http://tauro.signum.sns.it/

4. Ten reasons why Saxon XQuery is fast;Kay;IEEE Data Engineering Bulletin,2008

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. AN IMPROVED INDEXING METHOD FOR QUERYING BIG XML FILES;Journal of Computer Science and Cybernetics;2023-12-25

3. A Dual-Index Based Representation for Processing XPath Queries on Very Large XML Documents;Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering;2021

5. Decidable XPath Fragments in the Real World;Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems - PODS '19;2019