{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:46:09Z","timestamp":1743108369179,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030150921"},{"type":"electronic","value":"9783030150938"}],"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-15093-8_8","type":"book-chapter","created":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T13:07:46Z","timestamp":1552568866000},"page":"107-123","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Large-Scale Semantic Data Management For\u00a0Urban\u00a0Computing Applications"],"prefix":"10.1007","author":[{"given":"Shengli","family":"Song","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiang","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,3,15]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Zheng, Y., Liu, Y., Yuan, J., et al.: Urban computing with taxicabs. In: Proceedings of the 13th International Conference on Ubiquitous Computing, pp. 89\u201398. ACM (2011)","DOI":"10.1145\/2030112.2030126"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Jiang, S., Fiore, G.A., Yang, Y., et al.: A review of urban computing for mobile phone traces: current methods, challenges and opportunities. In: Proceedings of the 2nd ACM SIGKDD International Workshop on Urban Computing, p. 2. ACM (2013)","DOI":"10.1145\/2505821.2505828"},{"issue":"7","key":"8_CR3","doi-asserted-by":"publisher","first-page":"517","DOI":"10.14778\/2536349.2536352","volume":"6","author":"P Yuan","year":"2013","unstructured":"Yuan, P., Liu, P., Wu, B., et al.: TripleBit: a fast and compact system for large scale RDF data. Proc. VLDB Endow. 6(7), 517\u2013528 (2013)","journal-title":"Proc. VLDB Endow."},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/3-540-48005-6_7","volume-title":"The Semantic Web \u2014 ISWC 2002","author":"J Broekstra","year":"2002","unstructured":"Broekstra, J., Kampman, A., van Harmelen, F.: Sesame: a generic architecture for storing and querying RDF and RDF schema. In: Horrocks, I., Hendler, J. (eds.) ISWC 2002. LNCS, vol. 2342, pp. 54\u201368. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-48005-6_7"},{"key":"8_CR5","unstructured":"Wilkinson, K., Wilkinson, K.: Jena property table implementation (2006)"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Neumann, T., Weikum, G.: The RDF-3X engine for scalable management of RDF data. VLDB J. Int. J. Very Large Data Bases 19(1), 91\u2013113 (2010)","DOI":"10.1007\/s00778-009-0165-y"},{"issue":"1","key":"8_CR7","doi-asserted-by":"publisher","first-page":"1008","DOI":"10.14778\/1453856.1453965","volume":"1","author":"C Weiss","year":"2008","unstructured":"Weiss, C., Karras, P., Bernstein, A.: Hexastore: sextuple indexing for semantic web data management. Proc. VLDB Endow. 1(1), 1008\u20131019 (2008)","journal-title":"Proc. VLDB Endow."},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Atre, M., Chaoji, V., Zaki, M.J., et al.: Matrix Bit loaded: a scalable lightweight join query processor for RDF data. In: Proceedings of the 19th International Conference on World Wide Web, pp. 41\u201350. ACM (2010)","DOI":"10.1145\/1772690.1772696"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Modoni, G.E., Sacco, M., Terkaj, W.: A survey of RDF store solutions. In: 2014 International ICE Conference on Engineering, Technology and Innovation (ICE), pp. 1\u20137. IEEE (2014)","DOI":"10.1109\/ICE.2014.6871541"},{"issue":"5","key":"8_CR10","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1002\/spe.2325","volume":"46","author":"S Chambi","year":"2016","unstructured":"Chambi, S., Lemire, D., Kaser, O., et al.: Better bitmap performance with roaring bitmaps. Softw. Pract. Exp. 46(5), 709\u2013719 (2016)","journal-title":"Softw. Pract. Exp."},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Yan, Y., Wang, C., Zhou, A., et al.: Efficiently querying RDF data in triple stores. In: Proceedings of the 17th International Conference on World Wide Web, pp. 1053\u20131054. ACM (2008)","DOI":"10.1145\/1367497.1367652"},{"issue":"2","key":"8_CR12","doi-asserted-by":"publisher","first-page":"1553","DOI":"10.14778\/1454159.1454227","volume":"1","author":"L Sidirourgos","year":"2008","unstructured":"Sidirourgos, L., Goncalves, R., Kersten, M., et al.: Column-store support for RDF data management: not all swans are white. Proc. VLDB Endow. 1(2), 1553\u20131563 (2008)","journal-title":"Proc. VLDB Endow."},{"key":"8_CR13","unstructured":"Bonstrom, V., Hinze, A., Schweppe, H.: Storing RDF as a graph. In: Proceedings of Web Congress. First Latin American, pp. 27\u201336. IEEE (2003)"},{"issue":"11","key":"8_CR14","doi-asserted-by":"publisher","first-page":"1238","DOI":"10.14778\/2809974.2809985","volume":"8","author":"J Kim","year":"2015","unstructured":"Kim, J., Shin, H., Han, W.S., et al.: Taming subgraph isomorphism for RDF query processing. Proc. VLDB Endow. 8(11), 1238\u20131249 (2015)","journal-title":"Proc. VLDB Endow."},{"issue":"2","key":"8_CR15","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s00778-015-0415-0","volume":"25","author":"P Peng","year":"2016","unstructured":"Peng, P., Zou, L., \u00d6zsu, M.T., et al.: Processing SPARQL queries over distributed RDF graphs. VLDB J. 25(2), 243\u2013268 (2016)","journal-title":"VLDB J."},{"issue":"1","key":"8_CR16","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.tcs.2006.06.015","volume":"363","author":"E Tomita","year":"2006","unstructured":"Tomita, E., Tanaka, A., Takahashi, H.: The worst-case time complexity for generating all maximal cliques and computational experiments. Theoret. Comput. Sci. 363(1), 28\u201342 (2006)","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR17","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.ins.2013.10.003","volume":"261","author":"W Zheng","year":"2014","unstructured":"Zheng, W., Zou, L., Lian, X., et al.: SQBC: an efficient subgraph matching method over large and dense graphs. Inf. Sci. 261, 116\u2013131 (2014)","journal-title":"Inf. Sci."},{"issue":"6","key":"8_CR18","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1007\/s10732-007-9055-x","volume":"14","author":"A Grosso","year":"2008","unstructured":"Grosso, A., Locatelli, M., Pullan, W.: Simple ingredients leading to very efficient heuristics for the maximum clique problem. J. Heuristics 14(6), 587\u2013612 (2008)","journal-title":"J. Heuristics"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Unger, C., Forascu, C., Lopez, V., et al.: Question answering over linked data (QALD-4). In: Working Notes for CLEF 2014 Conference (2014)","DOI":"10.1007\/978-3-319-10587-1_2"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Khan, A., Wu, Y., Aggarwal, C.C., et al.: Nema: fast graph search with label similarity. Proc. VLDB Endow. 6(3), 181\u2013192 (2013)","DOI":"10.14778\/2535569.2448952"},{"issue":"7","key":"8_CR21","doi-asserted-by":"publisher","first-page":"565","DOI":"10.14778\/2732286.2732293","volume":"7","author":"S Yang","year":"2014","unstructured":"Yang, S., Wu, Y., Sun, H., et al.: Schemaless and structureless graph querying. Proc. VLDB Endow. 7(7), 565\u2013576 (2014)","journal-title":"Proc. VLDB Endow."},{"issue":"11","key":"8_CR22","doi-asserted-by":"publisher","first-page":"840","DOI":"10.14778\/2983200.2983201","volume":"9","author":"W Zheng","year":"2016","unstructured":"Zheng, W., Zou, L., Peng, W., et al.: Semantic SPARQL similarity search over RDF knowledge graphs. Proc. VLDB Endow. 9(11), 840\u2013851 (2016)","journal-title":"Proc. VLDB Endow."}],"container-title":["Lecture Notes in Computer Science","Green, Pervasive, and Cloud Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-15093-8_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,21]],"date-time":"2019-11-21T10:23:10Z","timestamp":1574331790000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-15093-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030150921","9783030150938"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-15093-8_8","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":"15 March 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GPC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Green, Pervasive, and Cloud Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"11 May 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 May 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gpc2018","order":10,"name":"conference_id","label":"Conference ID","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":"101","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"35","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"12","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"35% - 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":"2.50","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"2.51","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}