{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:13:55Z","timestamp":1760202835203,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030326852"},{"type":"electronic","value":"9783030326869"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-32686-9_30","type":"book-chapter","created":{"date-parts":[[2019,10,4]],"date-time":"2019-10-04T22:02:27Z","timestamp":1570226547000},"page":"419-433","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Faster Dynamic Compressed d-ary Relations"],"prefix":"10.1007","author":[{"given":"Diego","family":"Arroyuelo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guillermo","family":"de Bernardo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Travis","family":"Gagie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gonzalo","family":"Navarro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,3]]},"reference":[{"key":"30_CR1","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.jda.2016.10.002","volume":"43","author":"S \u00c1lvarez-Garcia","year":"2017","unstructured":"\u00c1lvarez-Garcia, S., de Bernardo, G., Brisaboa, N., Navarro, G.: A succinct data structure for self-indexing ternary relations. J. Discrete Algorithms 43, 38\u201353 (2017)","journal-title":"J. Discrete Algorithms"},{"issue":"2","key":"30_CR2","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/s10115-014-0770-y","volume":"44","author":"S \u00c1lvarez-Garc\u00eda","year":"2015","unstructured":"\u00c1lvarez-Garc\u00eda, S., Brisaboa, N., Fern\u00e1ndez, J., Mart\u00ednez-Prieto, M., Navarro, G.: Compressed vertical partitioning for efficient RDF management. Knowl. Inf. Syst. 44(2), 439\u2013474 (2015)","journal-title":"Knowl. Inf. Syst."},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"\u00c1lvarez-Garc\u00eda, S., Freire, B., Ladra, S., Pedreira, O.: Compact and efficient representation of general graph databases. CoRR abs\/1812.10977 (2018, to appear). in Knowledge and Information Systems","DOI":"10.1007\/s10115-018-1275-x"},{"issue":"2","key":"30_CR4","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1007\/s00453-015-9969-x","volume":"74","author":"D Arroyuelo","year":"2016","unstructured":"Arroyuelo, D., Davoodi, P., Satti, S.R.: Succinct dynamic cardinal trees. Algorithmica 74(2), 742\u2013777 (2016)","journal-title":"Algorithmica"},{"issue":"7","key":"30_CR5","doi-asserted-by":"publisher","first-page":"1070","DOI":"10.1016\/j.ic.2011.03.001","volume":"209","author":"D Arroyuelo","year":"2011","unstructured":"Arroyuelo, D., Navarro, G.: Space-efficient construction of Lempel-Ziv compressed text indexes. Inf. Comput. 209(7), 1070\u20131102 (2011)","journal-title":"Inf. Comput."},{"issue":"5","key":"30_CR6","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1007\/s00778-010-0183-9","volume":"19","author":"N Askitis","year":"2010","unstructured":"Askitis, N., Sinha, R.: Engineering scalable, cache and space efficient tries for strings. VLDB J. 19(5), 633\u2013660 (2010)","journal-title":"VLDB J."},{"key":"30_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-642-16321-0_15","volume-title":"String Processing and Information Retrieval","author":"D Belazzougui","year":"2010","unstructured":"Belazzougui, D., Boldi, P., Vigna, S.: Dynamic z-fast tries. In: Chavez, E., Lonardi, S. (eds.) SPIRE 2010. LNCS, vol. 6393, pp. 159\u2013172. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16321-0_15"},{"issue":"4","key":"30_CR8","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s00453-004-1146-6","volume":"43","author":"D Benoit","year":"2005","unstructured":"Benoit, D., Demaine, E., Munro, J.I., Raman, R., Raman, V., Rao, S.S.: Representing trees of higher degree. Algorithmica 43(4), 275\u2013292 (2005)","journal-title":"Algorithmica"},{"key":"30_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-319-02432-5_14","volume-title":"String Processing and Information Retrieval","author":"G Bernardo de","year":"2013","unstructured":"de Bernardo, G., \u00c1lvarez-Garc\u00eda, S., Brisaboa, N.R., Navarro, G., Pedreira, O.: Compact querieable representations of raster data. In: Kurland, O., Lewenstein, M., Porat, E. (eds.) SPIRE 2013. LNCS, vol. 8214, pp. 96\u2013108. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-02432-5_14"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Boldi, P., Rosa, M., Santini, M., Vigna, S.: Layered label propagation: a multiresolution coordinate-free ordering for compressing social networks. In: Srinivasan, S., Ramamritham, K., Kumar, A., Ravindra, M.P., Bertino, E., Kumar, R. (eds.) Proceedings of the 20th International Conference on World Wide Web, pp. 587\u2013596. ACM Press (2011)","DOI":"10.1145\/1963405.1963488"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"Boldi, P., Vigna, S.: The WebGraph framework I: Compression techniques. In: Proceedings of the Thirteenth International World Wide Web Conference (WWW 2004), pp. 595\u2013601. ACM Press, Manhattan (2004)","DOI":"10.1145\/988672.988752"},{"key":"30_CR12","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.is.2016.03.004","volume":"60","author":"N Brisaboa","year":"2016","unstructured":"Brisaboa, N., de Bernardo, G., Konow, R., Navarro, G., Seco, D.: Aggregated 2D range queries on clustered points. Inf. Syst. 60, 34\u201349 (2016)","journal-title":"Inf. Syst."},{"key":"30_CR13","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.is.2017.05.003","volume":"69","author":"N Brisaboa","year":"2017","unstructured":"Brisaboa, N., Cerdeira-Pena, A., de Bernardo, G., Navarro, G.: Compressed representation of dynamic binary relations with applications. Inf. Syst. 69, 106\u2013123 (2017)","journal-title":"Inf. Syst."},{"issue":"1","key":"30_CR14","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/j.is.2013.08.003","volume":"39","author":"NR Brisaboa","year":"2014","unstructured":"Brisaboa, N.R., Ladra, S., Navarro, G.: Compact representation of Web graphs with extended functionality. Inf. Syst. 39(1), 152\u2013174 (2014)","journal-title":"Inf. Syst."},{"key":"30_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-030-00479-8_10","volume-title":"String Processing and Information Retrieval","author":"A Cerdeira-Pena","year":"2018","unstructured":"Cerdeira-Pena, A., de Bernardo, G., Fari\u00f1a, A., Param\u00e1, J.R., Silva-Coira, F.: Towards a compact representation of temporal rasters. In: Gagie, T., Moffat, A., Navarro, G., Cuadros-Vargas, E. (eds.) SPIRE 2018. LNCS, vol. 11147, pp. 117\u2013130. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-00479-8_10"},{"key":"30_CR16","unstructured":"Clark, D.R.: Compact PAT Trees. Ph.D. thesis, University of Waterloo, Canada (1996)"},{"key":"30_CR17","doi-asserted-by":"crossref","unstructured":"Fredman, M., Saks, M.: The cell probe complexity of dynamic data structures. In: Proceedings of the 21st Annual ACM Symposium on Theory of Computing (STOC), pp. 345\u2013354 (1989)","DOI":"10.1145\/73007.73040"},{"key":"30_CR18","doi-asserted-by":"crossref","unstructured":"Jacobson, G.: Space-efficient static trees and graphs. In: Proceedings of the 30th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 549\u2013554 (1989)","DOI":"10.1109\/SFCS.1989.63533"},{"key":"30_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-319-67428-5_19","volume-title":"String Processing and Information Retrieval","author":"S Kanda","year":"2017","unstructured":"Kanda, S., Morita, K., Fuketa, M.: Practical implementation of space-efficient dynamic keyword dictionaries. In: Fici, G., Sciortino, M., Venturini, R. (eds.) SPIRE 2017. LNCS, vol. 10508, pp. 221\u2013233. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-67428-5_19"},{"key":"30_CR20","unstructured":"Morton, G.M.: A computer oriented geodetic data base; and a new technique in file sequencing. Technical report, IBM Ltd. (1966)"},{"key":"30_CR21","doi-asserted-by":"crossref","unstructured":"Munro, J.I.: Tables. In: Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), pp. 37\u201342 (1996)","DOI":"10.1007\/3-540-62034-6_35"},{"key":"30_CR22","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316588284","volume-title":"Compact Data Structures - A Practical Approach","author":"G Navarro","year":"2016","unstructured":"Navarro, G.: Compact Data Structures - A Practical Approach. Cambridge University Press, Cambridge (2016)"},{"key":"30_CR23","doi-asserted-by":"crossref","unstructured":"Navarro, G., Sadakane, K.: Fully-functional static and dynamic succinct trees. ACM Trans. Algorithms 10(3), article 16 (2014)","DOI":"10.1145\/2601073"},{"key":"30_CR24","doi-asserted-by":"crossref","unstructured":"Okanohara, D., Sadakane, K.: Practical entropy-compressed rank\/select dictionary. In: Proceedings of the 9th Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 60\u201370 (2007)","DOI":"10.1137\/1.9781611972870.6"},{"key":"30_CR25","volume-title":"Foundations of Multidimensional and Metric Data Structures","author":"H Samet","year":"2006","unstructured":"Samet, H.: Foundations of Multidimensional and Metric Data Structures. Morgan Kaufmann, San Francisco (2006)"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-32686-9_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T01:28:45Z","timestamp":1664587725000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-32686-9_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030326852","9783030326869"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-32686-9_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"3 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SPIRE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on String Processing and Information Retrieval","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Segovia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spire2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/spire19.lbd.org.es\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"59","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}