{"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":1740099173590,"version":"3.37.3"},"publisher-location":"Cham","reference-count":22,"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_9","type":"book-chapter","created":{"date-parts":[[2018,9,13]],"date-time":"2018-09-13T10:58:18Z","timestamp":1536836298000},"page":"102-116","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["3DGraCT: A Grammar-Based Compressed Representation of 3D Trajectories"],"prefix":"10.1007","author":[{"given":"Nieves R.","family":"Brisaboa","sequence":"first","affiliation":[]},{"given":"Adri\u00e1n","family":"G\u00f3mez-Brand\u00f3n","sequence":"additional","affiliation":[]},{"given":"Miguel A.","family":"Mart\u00ednez-Prieto","sequence":"additional","affiliation":[]},{"given":"Jos\u00e9 Ram\u00f3n","family":"Param\u00e1","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,14]]},"reference":[{"key":"9_CR1","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"},{"issue":"2","key":"9_CR2","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s10707-007-0030-3","volume":"12","author":"V Botea","year":"2008","unstructured":"Botea, V., Mallett, D., Nascimento, M.A., Sander, J.: PIST: an efficient and practical indexing technique for historical spatio-temporal point data. GeoInformatica 12(2), 143\u2013168 (2008)","journal-title":"GeoInformatica"},{"issue":"1","key":"9_CR3","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1016\/j.ipm.2012.08.003","volume":"49","author":"N Brisaboa","year":"2013","unstructured":"Brisaboa, N., Ladra, S., Navarro, G.: DACs: bringing direct access to variable-length codes. Inf. Process. Manag. 49(1), 392\u2013404 (2013)","journal-title":"Inf. Process. Manag."},{"key":"9_CR4","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"},{"issue":"1","key":"9_CR5","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":"9_CR6","doi-asserted-by":"crossref","unstructured":"Cudre-Mauroux, P., Wu, E., Madden, S.: Trajstore: an adaptive storage system for very large trajectory data sets. In: Proceedings of the IEEE 26th International Conference on Data Engineering (ICDE 2010), pp. 109\u2013120 (2010)","DOI":"10.1109\/ICDE.2010.5447829"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-1-4614-1629-6_2","volume-title":"Computing with Spatial Trajectories","author":"K Deng","year":"2011","unstructured":"Deng, K., Xie, K., Zheng, K., Zhou, X.: Trajectory indexing and retrieval. In: Zheng, Y., Zhou, X. (eds.) Computing with Spatial Trajectories, pp. 35\u201360. Springer, New York (2011). https:\/\/doi.org\/10.1007\/978-1-4614-1629-6_2"},{"issue":"2","key":"9_CR8","doi-asserted-by":"publisher","first-page":"112","DOI":"10.3138\/FM57-6770-U75U-7727","volume":"10","author":"DH Douglas","year":"1973","unstructured":"Douglas, D.H., Peuker, T.K.: Algorithms for the reduction of the number of points required to represent a line or its caricature. Can. Cartogr. 10(2), 112\u2013122 (1973)","journal-title":"Can. Cartogr."},{"key":"9_CR9","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"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Jacobson, G.: Space-efficient static trees and graphs. In: IEEE Symposium on Foundations of Computer Science (FOCS), pp. 549\u2013554 (1989)","DOI":"10.1109\/SFCS.1989.63533"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF01375471","volume":"11","author":"DE Knuth","year":"1991","unstructured":"Knuth, D.E.: Efficient representation of perm groups. Combinatorica 11, 33\u201343 (1991)","journal-title":"Combinatorica"},{"issue":"11","key":"9_CR12","doi-asserted-by":"publisher","first-page":"1722","DOI":"10.1109\/5.892708","volume":"88","author":"NJ Larsson","year":"2000","unstructured":"Larsson, N.J., Moffat, A.: Off-line dictionary-based compression. Proc. IEEE 88(11), 1722\u20131732 (2000)","journal-title":"Proc. IEEE"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Nascimento, M.A., Silva, J.R.O.: Towards historical R-trees. In: Proceedings of the 1998 ACM Symposium on Applied Computing. SAC 1998, pp. 235\u2013240. ACM (1998)","DOI":"10.1145\/330560.330692"},{"key":"9_CR14","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)"},{"issue":"11","key":"9_CR15","doi-asserted-by":"publisher","first-page":"3138","DOI":"10.1109\/TKDE.2015.2436932","volume":"27","author":"A Nibali","year":"2015","unstructured":"Nibali, A., He, Z.: Trajic: an effective compression system for trajectory data. IEEE Trans. Knowl. Data Eng. 27(11), 3138\u20133151 (2015)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"9_CR16","unstructured":"Sch\u00e4fer, M., Strohmeier, M., Lenders, V., Martinovic, I., Wilhelm, M.: Bringing up OpenSky: a large-scale ADS-B sensor network for research. In: Proceedings of the 13th International Symposium on Information Processing in Sensor Networks. IPSN 2014, pp. 83\u201394. IEEE Press, Piscataway (2014). http:\/\/dl.acm.org\/citation.cfm?id=2602339.2602350"},{"key":"9_CR17","unstructured":"Tao, Y., Papadias, D.: MV3R-tree: a spatio-temporal access method for timestamp and interval queries. In: 2001 Proceedings of the 27th International Conference on Very Large Data Bases, VLDB, pp. 431\u2013440 (2001)"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Trajcevski, G., Cao, H., Scheuermann, P., Wolfson, O., Vaccaro, D.: On-line data reduction and the quality of history in moving objects databases. In: Proceedings of the Fifth ACM International Workshop on Data Engineering for Wireless and Mobile Access, pp. 19\u201326 (2006)","DOI":"10.1145\/1140104.1140110"},{"issue":"4","key":"9_CR19","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/s005300050094","volume":"6","author":"M Vazirgiannis","year":"1998","unstructured":"Vazirgiannis, M., Theodoridis, Y., Sellis, T.K.: Spatio-temporal composition and indexing for large multimedia applications. ACM Multimed. Syst. J. 6(4), 284\u2013298 (1998)","journal-title":"ACM Multimed. Syst. J."},{"issue":"2","key":"9_CR20","first-page":"844","volume":"16","author":"S Wandelt","year":"2015","unstructured":"Wandelt, S., Sun, X.: Efficient compression of 4D-trajectory data in air traffic management. IEEE Trans. Intell. Transp. Syst. 16(2), 844\u2013853 (2015)","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"9_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TITS.2017.2784371","volume":"99","author":"S Wandelt","year":"2018","unstructured":"Wandelt, S., Sun, X., Fricke, H.: ADS-BI: compressed indexing of ADS-B data. IEEE Trans. Intell. Transp. Syst. 99, 1\u201312 (2018)","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"issue":"2","key":"9_CR22","doi-asserted-by":"publisher","first-page":"157","DOI":"10.2514\/atcq.22.2.157","volume":"22","author":"S Wandelt","year":"2014","unstructured":"Wandelt, S., Sun, X., Gollnick, V.: SO6C: compressed trajectories in air traffic management. Air Traffic Control Q. 22(2), 157\u2013178 (2014)","journal-title":"Air Traffic Control Q."}],"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_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,24]],"date-time":"2019-10-24T01:16:56Z","timestamp":1571879816000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-00479-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030004781","9783030004798"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00479-8_9","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"}}]}}