{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:44:06Z","timestamp":1743000246287,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030915599"},{"type":"electronic","value":"9783030915605"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-91560-5_42","type":"book-chapter","created":{"date-parts":[[2021,12,2]],"date-time":"2021-12-02T13:03:12Z","timestamp":1638450192000},"page":"536-546","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["JUST-Studio: A Platform for Spatio-Temporal Data Map Designing and Application Building"],"prefix":"10.1007","author":[{"given":"Yuan","family":"Sui","sequence":"first","affiliation":[]},{"given":"Ruiyuan","family":"Li","sequence":"additional","affiliation":[]},{"given":"Xu","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Jun","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Juncheng","family":"Tang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,1]]},"reference":[{"key":"42_CR1","doi-asserted-by":"crossref","unstructured":"Hu, Y., et al.: SALON: a universal stay point-based location analysis platform. In: ACM SIGSPATIAL (2021)","DOI":"10.1145\/3474717.3483991"},{"key":"42_CR2","doi-asserted-by":"crossref","unstructured":"Ruan, S., et al.: Cloudtp: a cloud-based flexible trajectory preprocessing framework. In: ICDE, pp. 1601\u20131604. IEEE (2018)","DOI":"10.1109\/ICDE.2018.00186"},{"key":"42_CR3","doi-asserted-by":"crossref","unstructured":"Yuan, J., et al.: Where to find my next passenger. In: Proceedings of the 13th International Conference on Ubiquitous Computing, pp. 109\u2013118 (2011)","DOI":"10.1145\/2030112.2030128"},{"issue":"10","key":"42_CR4","doi-asserted-by":"publisher","first-page":"317","DOI":"10.3390\/ijgi6100317","volume":"6","author":"B Veenendaal","year":"2017","unstructured":"Veenendaal, B., Brovelli, M.A., Li, S.: Review of web mapping: Eras, trends and directions. ISPRS Int. J. Geo Inf. 6(10), 317 (2017)","journal-title":"ISPRS Int. J. Geo Inf."},{"key":"42_CR5","unstructured":"Mapbox Studio (2021). https:\/\/studio.mapbox.com\/"},{"key":"42_CR6","unstructured":"Carto (2021). https:\/\/carto.com\/"},{"key":"42_CR7","doi-asserted-by":"crossref","unstructured":"Li, R., et al.: Just: JD urban spatio-temporal data engine. In: ICDE, pp. 1558\u20131569. IEEE (2020)","DOI":"10.1109\/ICDE48307.2020.00138"},{"key":"42_CR8","doi-asserted-by":"crossref","unstructured":"Li, R., et al.: Trajmesa: a distributed NoSQL storage engine for big trajectory data. In: ICDE, pp. 2002\u20132005. IEEE (2020)","DOI":"10.1109\/ICDE48307.2020.00224"},{"key":"42_CR9","doi-asserted-by":"crossref","unstructured":"Li, R., et al.: TrajMesa: a distributed NoSQL-based trajectory data management system. TKDE (2021)","DOI":"10.1109\/TKDE.2021.3079880"},{"key":"42_CR10","unstructured":"Vora, M.N.: Hadoop-HBase for large-scale data. In: ICCSNT, vol. 1, pp. 601-605. IEEE (2011)"},{"issue":"47","key":"42_CR11","first-page":"9478","volume":"3","author":"KMM Thein","year":"2014","unstructured":"Thein, K.M.M.: Apache Kafka: Next generation distributed messaging system. Int. J. Sci. Eng. Technol. Res. 3(47), 9478\u20139483 (2014)","journal-title":"Int. J. Sci. Eng. Technol. Res."},{"key":"42_CR12","unstructured":"Well-known text (2021). https:\/\/en.wikipedia.org\/wiki\/Well-known_text_representation_of_geometry"},{"key":"42_CR13","unstructured":"Zaharia, M., et al.: Resilient distributed datasets: a fault-tolerant abstraction for in-memory cluster computing. In: NSDI, vol. 12, pp. 15\u201328 (2012)"},{"key":"42_CR14","unstructured":"OGC (2021). https:\/\/en.wikipedia.org\/wiki\/Open_Geospatial_Consortium"},{"key":"42_CR15","unstructured":"GeoTools Project (2021). https:\/\/www.geotools.org\/"},{"key":"42_CR16","doi-asserted-by":"crossref","unstructured":"Newson, P., Krumm, J.: Hidden Markov map matching through noise and sparseness. In: Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pp. 336\u2013343 (2009)","DOI":"10.1145\/1653771.1653818"},{"key":"42_CR17","unstructured":"WMS (2021). https:\/\/en.wikipedia.org\/wiki\/Web_Map_Tile_Service"},{"key":"42_CR18","unstructured":"WFS (2021). https:\/\/en.wikipedia.org\/wiki\/Web_Feature_Service"},{"key":"42_CR19","unstructured":"WMTS (2021). https:\/\/en.wikipedia.org\/wiki\/Web_Map_Tile_Service"},{"key":"42_CR20","unstructured":"Mapbox Vector Tiles. https:\/\/www.mapbox.com\/developers\/vector-tiles\/. Accessed 12 Mar 2015"},{"issue":"1","key":"42_CR21","doi-asserted-by":"publisher","first-page":"020014","DOI":"10.1063\/1.5133929","volume":"2173","author":"AH Abbas","year":"2019","unstructured":"Abbas, A.H., et al.: GPS based location monitoring system with geo-fencing capabilities. AIP Conf. Proc. 2173(1), 020014 (2019)","journal-title":"AIP Conf. Proc."},{"issue":"1","key":"42_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2200\/S00115ED1V01Y200804MPC004","volume":"3","author":"A LaMarca","year":"2008","unstructured":"LaMarca, A., De Lara, E.: Location systems: an introduction to the technology behind location awareness. Synth. Lect. Mob. Pervasive Comput. 3(1), 1\u2013122 (2008)","journal-title":"Synth. Lect. Mob. Pervasive Comput."},{"key":"42_CR23","volume-title":"Speeding Up the Douglas-Peucker Line-Simplification Algorithm","author":"JE Hershberger","year":"1992","unstructured":"Hershberger, J.E., Snoeyink, J.: Speeding Up the Douglas-Peucker Line-Simplification Algorithm. University of British Columbia, Department of Computer Science, Vancouver (1992)"},{"key":"42_CR24","unstructured":"Protocol Buffers Encoding (2021). https:\/\/developers.google.com\/protocol-buffers\/docs\/encoding"}],"container-title":["Lecture Notes in Computer Science","Web Information Systems Engineering \u2013 WISE 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-91560-5_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,2]],"date-time":"2021-12-02T13:09:38Z","timestamp":1638450578000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-91560-5_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030915599","9783030915605"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-91560-5_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"1 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WISE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web Information Systems Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wise2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.wise-conferences.org\/2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"229","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":"55","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":"29","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":"24% - 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":"4","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)"}}]}}