{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:52:22Z","timestamp":1740099142871,"version":"3.37.3"},"publisher-location":"Cham","reference-count":32,"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_28","type":"book-chapter","created":{"date-parts":[[2018,9,13]],"date-time":"2018-09-13T10:58:18Z","timestamp":1536836298000},"page":"348-362","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Faster and Smaller Two-Level Index for Network-Based Trajectories"],"prefix":"10.1007","author":[{"given":"Rodrigo","family":"Rivera","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. Andrea","family":"Rodr\u00edguez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Diego","family":"Seco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,14]]},"reference":[{"issue":"1","key":"28_CR1","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10707-004-5621-7","volume":"9","author":"VT Almeida de","year":"2005","unstructured":"de Almeida, V.T., G\u00fcting, R.H.: Indexing the trajectories of moving objects in networks*. GeoInformatica 9(1), 33\u201360 (2005)","journal-title":"GeoInformatica"},{"key":"28_CR2","unstructured":"Barkan, Y.: RTree, GitHub repository (2011). https:\/\/github.com\/nushoin\/RTree"},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/978-3-319-19929-0_3","volume-title":"Combinatorial Pattern Matching","author":"D Belazzougui","year":"2015","unstructured":"Belazzougui, D., Cunial, F., Gagie, T., Prezza, N., Raffinot, M.: Composite repetition-aware data structures. In: Cicalese, F., Porat, E., Vaccaro, U. (eds.) CPM 2015. LNCS, vol. 9133, pp. 26\u201339. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19929-0_3"},{"key":"28_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-319-58741-7_17","volume-title":"Unveiling Dynamics and Complexity","author":"D Belazzougui","year":"2017","unstructured":"Belazzougui, D., Cunial, F., Gagie, T., Prezza, N., Raffinot, M.: Flexible indexing of repetitive collections. In: Kari, J., Manea, F., Petre, I. (eds.) CiE 2017. LNCS, vol. 10307, pp. 162\u2013174. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-58741-7_17"},{"key":"28_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03427-9","volume-title":"Computational Geometry: Algorithms and Applications","author":"M Berg de","year":"2008","unstructured":"de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer-Verlag TELOS, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-662-03427-9","edition":"3"},{"issue":"2","key":"28_CR6","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1023\/A:1015231126594","volume":"6","author":"T Brinkhoff","year":"2002","unstructured":"Brinkhoff, T.: A framework for generating network-based moving objects. GeoInformatica 6(2), 153\u2013180 (2002)","journal-title":"GeoInformatica"},{"key":"28_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-319-46049-9_23","volume-title":"String Processing and Information Retrieval","author":"NR Brisaboa","year":"2016","unstructured":"Brisaboa, N.R., Fari\u00f1a, A., Galaktionov, D., Rodr\u00edguez, M.A.: Compact trip representation over networks. In: Inenaga, S., Sadakane, K., Sakai, T. (eds.) SPIRE 2016. LNCS, vol. 9954, pp. 240\u2013253. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46049-9_23"},{"key":"28_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-319-67428-5_10","volume-title":"String Processing and Information Retrieval","author":"NR Brisaboa","year":"2017","unstructured":"Brisaboa, N.R., Gagie, T., G\u00f3mez-Brand\u00f3n, A., Navarro, G., Param\u00e1, J.R.: Efficient compression and indexing of trajectories. In: Fici, G., Sciortino, M., Venturini, R. (eds.) SPIRE 2017. LNCS, vol. 10508, pp. 103\u2013115. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-67428-5_10"},{"key":"28_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-319-46049-9_21","volume-title":"String Processing and Information Retrieval","author":"NR Brisaboa","year":"2016","unstructured":"Brisaboa, N.R., G\u00f3mez-Brand\u00f3n, A., Navarro, G., Param\u00e1, J.R.: GraCT: a grammar based compressed representation of trajectories. In: Inenaga, S., Sadakane, K., Sakai, T. (eds.) SPIRE 2016. LNCS, vol. 9954, pp. 218\u2013230. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46049-9_21"},{"key":"28_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-642-03784-9_3","volume-title":"String Processing and Information Retrieval","author":"NR Brisaboa","year":"2009","unstructured":"Brisaboa, N.R., Ladra, S., Navarro, G.: k2-trees\u00a0for\u00a0compact\u00a0web\u00a0graph\u00a0representation. In: Karlgren, J., Tarhio, J., Hyyr\u00f6, H. (eds.) SPIRE 2009. LNCS, vol. 5721, pp. 18\u201330. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03784-9_3"},{"issue":"5","key":"28_CR11","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1016\/j.is.2013.01.005","volume":"38","author":"NR Brisaboa","year":"2013","unstructured":"Brisaboa, N.R., Luaces, M.R., Navarro, G., Seco, D.: Space-efficient representations of rectangle datasets supporting orthogonal range querying. Inf. Syst. 38(5), 635\u2013655 (2013)","journal-title":"Inf. Syst."},{"issue":"4","key":"28_CR12","doi-asserted-by":"publisher","first-page":"1918","DOI":"10.1109\/TITS.2014.2383494","volume":"16","author":"Z Ding","year":"2015","unstructured":"Ding, Z., Yang, B., G\u00fcting, R.H., Li, Y.: Network-matched trajectory-based moving-object database: models and applications. IEEE Trans. Intell. Transp. Syst. 16(4), 1918\u20131928 (2015)","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"issue":"1","key":"28_CR13","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0012-365X(75)90103-X","volume":"11","author":"ML Fredman","year":"1975","unstructured":"Fredman, M.L.: On computing the length of longest increasing subsequences. Discret. Math. 11(1), 29\u201335 (1975)","journal-title":"Discret. Math."},{"key":"28_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/978-3-540-45072-6_17","volume-title":"Advances in Spatial and Temporal Databases","author":"E Frentzos","year":"2003","unstructured":"Frentzos, E.: Indexing objects moving on fixed networks. In: Hadzilacos, T., Manolopoulos, Y., Roddick, J., Theodoridis, Y. (eds.) SSTD 2003. LNCS, vol. 2750, pp. 289\u2013305. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45072-6_17"},{"key":"28_CR15","unstructured":"Garrison, E.: Intervaltree, GitHub repository (2011). https:\/\/github.com\/ekg\/intervaltree"},{"key":"28_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-319-07959-2_28","volume-title":"Experimental Algorithms","author":"S Gog","year":"2014","unstructured":"Gog, S., Beller, T., Moffat, A., Petri, M.: From theory to practice: plug and play with succinct data structures. In: Gudmundsson, J., Katajainen, J. (eds.) SEA 2014. LNCS, vol. 8504, pp. 326\u2013337. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07959-2_28"},{"issue":"2","key":"28_CR17","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/971697.602266","volume":"14","author":"A Guttman","year":"1984","unstructured":"Guttman, A.: R-Trees: a dynamic index structure for spatial searching. SIGMOD Rec. 14(2), 47\u201357 (1984)","journal-title":"SIGMOD Rec."},{"issue":"2","key":"28_CR18","doi-asserted-by":"publisher","first-page":"11:1","DOI":"10.1145\/3015457","volume":"42","author":"Y Han","year":"2017","unstructured":"Han, Y., Sun, W., Zheng, B.: Compress: a comprehensive framework of trajectory compression in road networks. ACM Trans. Database Syst. 42(2), 11:1\u201311:49 (2017)","journal-title":"ACM Trans. Database Syst."},{"issue":"6","key":"28_CR19","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)","journal-title":"J. Syst. Softw."},{"key":"28_CR20","doi-asserted-by":"crossref","unstructured":"Koide, S., Tadokoro, Y., Xiao, C., Ishikawa, Y.: CiNCT: compression and retrieval for massive vehicular trajectories via relative movement labeling. In: ICDE, pp. 1097\u20131108 (2018)","DOI":"10.1109\/ICDE.2018.00102"},{"key":"28_CR21","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.tcs.2012.02.006","volume":"483","author":"S Kreft","year":"2013","unstructured":"Kreft, S., Navarro, G.: On compressing and indexing repetitive sequences. Theor. Comput. Sci. 483, 115\u2013133 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"28_CR22","doi-asserted-by":"crossref","unstructured":"Krogh, B., Pelekis, N., Theodoridis, Y., Torp, K.: Path-based queries on trajectory data. In: SIGSPATIAL, pp. 341\u2013350 (2014)","DOI":"10.1145\/2666310.2666413"},{"key":"28_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1007\/978-3-540-24741-8_44","volume-title":"Advances in Database Technology - EDBT 2004","author":"N Meratnia","year":"2004","unstructured":"Meratnia, N., de By, R.A.: Spatiotemporal Compression Techniques for Moving Point Objects. In: Bertino, E., Christodoulakis, S., Plexousakis, D., Christophides, V., Koubarakis, M., B\u00f6hm, K., Ferrari, E. (eds.) EDBT 2004. LNCS, vol. 2992, pp. 765\u2013782. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24741-8_44"},{"issue":"1","key":"28_CR24","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1216370.1216372","volume":"39","author":"Gonzalo Navarro","year":"2007","unstructured":"Navarro, G., M\u00e4kinen, V.: Compressed full-text indexes. ACM Comput. Surv. 39(1), Article No. 2 (2007). https:\/\/dl.acm.org\/citation.cfm?id=1216372","journal-title":"ACM Computing Surveys"},{"key":"28_CR25","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: ALENEX, pp. 60\u201370 (2007). http:\/\/dl.acm.org\/citation.cfm?id=2791188.2791194"},{"key":"28_CR26","unstructured":"Pfoser, D., Jensen, C.S., Theodoridis, Y.: Novel approaches in query processing for moving object trajectories. In: VLDB, pp. 395\u2013406 (2000)"},{"key":"28_CR27","unstructured":"Potamias, M., Patroumpas, K., Sellis, T.: Sampling trajectory streams with spatiotemporal criteria. In: SSDBM, pp. 275\u2013284 (2006)"},{"issue":"5","key":"28_CR28","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/s00778-011-0236-8","volume":"20","author":"I Sandu Popa","year":"2011","unstructured":"Sandu Popa, I., Zeitouni, K., Oria, V., Barth, D., Vial, S.: Indexing in-network trajectory flows. VLDB J. 20(5), 643 (2011)","journal-title":"VLDB J."},{"key":"28_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/978-3-642-02982-0_30","volume-title":"Advances in Spatial and Temporal Databases","author":"F Schmid","year":"2009","unstructured":"Schmid, F., Richter, K.-F., Laube, P.: Semantic trajectory compression. In: Mamoulis, N., Seidl, T., Pedersen, T.B., Torp, K., Assent, I. (eds.) SSTD 2009. LNCS, vol. 5644, pp. 411\u2013416. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02982-0_30"},{"key":"28_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-642-10631-6_18","volume-title":"Algorithms and Computation","author":"JM Schmidt","year":"2009","unstructured":"Schmidt, J.M.: Interval stabbing problems in small integer ranges. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 163\u2013172. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10631-6_18"},{"key":"28_CR31","unstructured":"Schmidt, J.M.: Publications by J.M. Schmidt. http:\/\/www4.tu-ilmenau.de\/combinatorial-optimization\/ShowPub.html (2018). Accessed 1 May 2018"},{"key":"28_CR32","unstructured":"Tao, Y., Papadias, D.: MV3R-Tree: a spatio-temporal access method for timestamp and interval queries. In: VLDB, pp. 431\u2013440 (2001)"}],"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_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,24]],"date-time":"2019-10-24T01:17:35Z","timestamp":1571879855000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-00479-8_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030004781","9783030004798"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00479-8_28","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"}}]}}