{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T21:50:18Z","timestamp":1730238618813,"version":"3.28.0"},"reference-count":35,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,3]]},"DOI":"10.1109\/icde.2010.5447858","type":"proceedings-article","created":{"date-parts":[[2010,12,8]],"date-time":"2010-12-08T12:25:00Z","timestamp":1291811100000},"page":"417-428","source":"Crossref","is-referenced-by-count":17,"title":["Fast in-memory XPath search using compressed indexes"],"prefix":"10.1109","author":[{"given":"Diego","family":"Arroyuelo","sequence":"first","affiliation":[]},{"given":"Francisco","family":"Claude","sequence":"additional","affiliation":[]},{"given":"Sebastian","family":"Maneth","sequence":"additional","affiliation":[]},{"given":"Veli","family":"Maakinen","sequence":"additional","affiliation":[]},{"given":"Gonzalo","family":"Navarro","sequence":"additional","affiliation":[]},{"given":"Kim","family":"Nguyen","sequence":"additional","affiliation":[]},{"given":"Jouni","family":"Siren","sequence":"additional","affiliation":[]},{"given":"Niko","family":"Valimaki","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/B978-012722442-8\/50053-7"},{"journal-title":"Tree Automata Techniques and Applications","year":"2007","author":"comon","key":"ref32"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/1514894.1514915"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/B978-012722442-8\/50030-6"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-005-0747-2"},{"key":"ref34","article-title":"XPathMark: Functional and performance tests for XPath","author":"franceschet","year":"2007","journal-title":"XQuery Implementation Paradigms"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.69"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1135777.1135891"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1071610.1071614"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/382780.382782"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1240233.1240243"},{"key":"ref15","first-page":"841","article-title":"High-order entropy-compressed text indexes","author":"grossi","year":"2003","journal-title":"SODA"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1109557.1109599"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1082036.1082039"},{"journal-title":"A block-sorting lossless data compression algorithm","year":"1994","author":"burrows","key":"ref18"},{"key":"ref19","first-page":"233","article-title":"Succinct indexable dictionaries with applications to encoding k-ary trees and multisets","author":"raman","year":"2002","journal-title":"SODA"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1997.646100"},{"key":"ref4","first-page":"65","article-title":"Ten reasons why Saxon XQuery is fast","volume":"31","author":"kay","year":"2008","journal-title":"IEEE Data Eng Bull"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/11780441_29"},{"journal-title":"Tauro","year":"2008","key":"ref3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1216370.1216372"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972870.6"},{"key":"ref5","first-page":"1077","article-title":"Implementing XQuery 1.0: The Galax experience","author":"fern\u00e1ndez","year":"2003","journal-title":"VLDB"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1367064.1367072"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1240233.1240244"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142527"},{"key":"ref9","article-title":"Fully-functional static and dynamic succinct trees","author":"sadakane","year":"2010","journal-title":"SODA"},{"journal-title":"Qizx XML query engine","year":"2007","key":"ref1"},{"key":"ref20","first-page":"176","article-title":"Practical rank\/select queries over arbitrary sequences","author":"claude","year":"2008","journal-title":"SPIRE"},{"journal-title":"XQuery and XPath Full Text 1 0","year":"0","key":"ref22"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.07.013"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1186\/gb-2009-10-3-r25"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btn032"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03784-9_7"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btp324"}],"event":{"name":"2010 IEEE 26th International Conference on Data Engineering (ICDE 2010)","start":{"date-parts":[[2010,3,1]]},"location":"Long Beach, CA","end":{"date-parts":[[2010,3,6]]}},"container-title":["2010 IEEE 26th International Conference on Data Engineering (ICDE 2010)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5443872\/5447611\/05447858.pdf?arnumber=5447858","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,18]],"date-time":"2017-03-18T23:55:47Z","timestamp":1489881347000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5447858\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/icde.2010.5447858","relation":{},"subject":[],"published":{"date-parts":[[2010,3]]}}}