{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:52:53Z","timestamp":1740099173596,"version":"3.37.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030004781"},{"type":"electronic","value":"9783030004798"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-00479-8_8","type":"book-chapter","created":{"date-parts":[[2018,9,13]],"date-time":"2018-09-13T10:58:18Z","timestamp":1536836298000},"page":"88-101","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["New Structures to Solve Aggregated Queries for Trips over Public Transportation Networks"],"prefix":"10.1007","author":[{"given":"Nieves R.","family":"Brisaboa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio","family":"Fari\u00f1a","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniil","family":"Galaktionov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tirso V.","family":"Rodeiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. Andrea","family":"Rodr\u00edguez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,14]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.is.2018.06.010","volume":"78","author":"NR Brisaboa","year":"2018","unstructured":"Brisaboa, N.R., Fari\u00f1a, A., Galaktionov, D., Rodriguez, M.A.: A compact representation for trips over networks built on self-indexes. Inf. Syst. 78, 1\u201322 (2018). https:\/\/doi.org\/10.1016\/j.is.2018.06.010","journal-title":"Inf. Syst."},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.is.2014.06.002","volume":"47","author":"F Claude","year":"2015","unstructured":"Claude, F., Navarro, G., Ord\u00f3\u00f1ez, A.: The wavelet matrix: an efficient wavelet tree for large alphabets. Inf. Syst. 47, 15\u201332 (2015)","journal-title":"Inf. Syst."},{"issue":"1","key":"8_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2094072.2094073","volume":"30","author":"Antonio Fari\u00f1a","year":"2012","unstructured":"Fari\u00f1a, A., Brisaboa, N.R., Navarro, G., Claude, F., Places, \u00c1.S., Rodr\u00edguez, E.: Word-based self-indexes for natural language text. ACM Trans. Inf. Syst. 30(1) (2012). Article no. 1. https:\/\/doi.org\/10.1145\/2094072.2094073","journal-title":"ACM Transactions on Information Systems"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Ferragina, P., Manzini, G.: Opportunistic data structures with applications. In: Proceedings of the 41st IEEE Symposium on Foundations of Computer Science (FOCS), pp. 390\u2013398 (2000)","DOI":"10.1109\/SFCS.2000.892127"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-319-18251-3_5","volume-title":"Web and Wireless Geographical Information Systems","author":"S Funke","year":"2015","unstructured":"Funke, S., Schirrmeister, R., Skilevic, S., Storandt, S.: Compass-based navigation in street networks. In: Gensel, J., Tomko, M. (eds.) W2GIS 2015. LNCS, vol. 9080, pp. 71\u201388. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18251-3_5"},{"issue":"6","key":"8_CR6","doi-asserted-by":"publisher","first-page":"1566","DOI":"10.1016\/j.jss.2013.01.071","volume":"86","author":"G Kellaris","year":"2013","unstructured":"Kellaris, G., Pelekis, N., Theodoridis, Y.: Map-matched trajectory compression. J. Syst. Softw. 86(6), 1566\u20131579 (2013). https:\/\/doi.org\/10.1016\/j.jss.2013.01.071","journal-title":"J. Syst. Softw."},{"key":"8_CR7","doi-asserted-by":"publisher","unstructured":"Koide, S., Tadokoro, Y., Yoshimura, T.: SNT-index: spatio-temporal index for vehicular trajectories on a road network based on substring matching. In: Proceedings of the 1st International ACM SIGSPATIAL Workshop on Smart Cities and Urban Analytics (UrbanGIS@SIGSPATIAL), pp. 1\u20138 (2015). https:\/\/doi.org\/10.1145\/2835022.2835023","DOI":"10.1145\/2835022.2835023"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Krogh, B., Pelekis, N., Theodoridis, Y., Torp, K.: Path-based queries on trajectory data. In: Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (SIGSPATIAL), pp. 341\u2013350 (2014)","DOI":"10.1145\/2666310.2666413"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.trc.2012.01.007","volume":"24","author":"MA Munizaga","year":"2012","unstructured":"Munizaga, M.A., Palma, C.: Estimation of a disaggregate multimodal public transport origin-destination matrix from passive smartcard data from Santiago, Chile. Transp. Res. Part C: Emerg. Technol. 24, 9\u201318 (2012). https:\/\/doi.org\/10.1016\/j.trc.2012.01.007","journal-title":"Transp. Res. Part C: Emerg. Technol."},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1137\/1.9781611972870.6","volume-title":"2007 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX)","author":"Daisuke Okanohara","year":"2007","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). https:\/\/doi.org\/10.1137\/1.9781611972870.6"},{"key":"8_CR11","unstructured":"Raman, R., Raman, V., Rao, S.S.: Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 233\u2013242 (2002)"},{"issue":"1","key":"8_CR12","doi-asserted-by":"publisher","first-page":"3","DOI":"10.5311\/JOSIS.2012.4.62","volume":"4","author":"KF Richter","year":"2012","unstructured":"Richter, K.F., Schmid, F., Laube, P.: Semantic trajectory compression: representing urban movement in a nutshell. J. Spat. Inf. Sci. 4(1), 3\u201330 (2012). https:\/\/doi.org\/10.5311\/JOSIS.2012.4.62","journal-title":"J. Spat. Inf. Sci."},{"issue":"2","key":"8_CR13","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1016\/S0196-6774(03)00087-7","volume":"48","author":"K Sadakane","year":"2003","unstructured":"Sadakane, K.: New text indexing functionalities of the compressed suffix arrays. J. Algorithms 48(2), 294\u2013313 (2003)","journal-title":"J. Algorithms"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-00479-8_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,24]],"date-time":"2019-10-24T01:16:52Z","timestamp":1571879812000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-00479-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030004781","9783030004798"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00479-8_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"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":"Lima","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Peru","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spire2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/eventos.spc.org.pe\/spire2018\/","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"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"51","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"22","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"6","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"43% - 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"}},{"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"}},{"value":"3.8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}