PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Arroyuelo, Diego"

Author of the publication

copydeleteadd this publication to your clipboard
Fast in-memory XPath search using compressed indexes.

, , , , , , , and . Softw., Pract. Exper., 45 (3): 399-434 (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Diego Bolanos Papenfort University of Stuttgart

Diego Rafael Alba University of Stuttgart

Dr. Germán Molpeceres de Diego University of Stuttgart

 

Other publications of authors with the same name

Practical approaches to reduce the space requirement of lempel-ziv-based compressed text indices., and . ACM Journal of Experimental Algorithmics, (2010)Memory-Adaptive Dynamic Spatial Approximation Trees., , , and . SPIRE, volume 2857 of Lecture Notes in Computer Science, page 360-368. Springer, (2003)Fast in-memory XPath search using compressed indexes., , , , , , , and . Softw., Pract. Exper., 45 (3): 399-434 (2015)Hybrid compression of inverted lists for reordered document collections., , , and . Inf. Process. Manage., 54 (6): 1308-1324 (2018)Untangled Monotonic Chains and Adaptive Range Search., , , , , , , , , and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 203-212. Springer, (2009)Reducing the Space Requirement of LZ-Index., , and . CPM, volume 4009 of Lecture Notes in Computer Science, page 318-329. Springer, (2006)LZ78 Compression in Low Main Memory Space., , , and . SPIRE, volume 10508 of Lecture Notes in Computer Science, page 38-50. Springer, (2017)Space-efficient construction of Lempel-Ziv compressed text indexes., and . Inf. Comput., 209 (7): 1070-1102 (2011)Distributed search based on self-indexed compressed text., , , , and . Inf. Process. Manage., 48 (5): 819-827 (2012)Fast in-memory XPath search using compressed indexes., , , , , , , and . ICDE, page 417-428. IEEE Computer Society, (2010)