{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,17]],"date-time":"2026-10-17T19:52:09Z","timestamp":1792266729705,"version":"4.4.0"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319250069","type":"print"},{"value":"9783319250076","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","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":[[2015]]},"DOI":"10.1007\/978-3-319-25007-6_6","type":"book-chapter","created":{"date-parts":[[2015,10,13]],"date-time":"2015-10-13T18:59:41Z","timestamp":1444762781000},"page":"92-110","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Opportunistic Linked Data Querying Through Approximate Membership Metadata"],"prefix":"10.1007","author":[{"given":"Miel","family":"Vander Sande","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ruben","family":"Verborgh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joachim","family":"Van Herwegen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Erik","family":"Mannens","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rik","family":"Van de Walle","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,10,30]]},"reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/978-3-319-11964-9_13","volume-title":"The Semantic Web \u2013 ISWC 2014","author":"G Alu\u00e7","year":"2014","unstructured":"Alu\u00e7, G., Hartig, O., \u00d6zsu, M.T., Daudjee, K.: Diversified stress testing of RDF data management systems. In: Mika, P., Tudorache, T., Bernstein, A., Welty, C., Knoblock, C., Vrande\u010di\u0107, D., Groth, P., Noy, N., Janowicz, K., Goble, C. (eds.) ISWC 2014, Part I. LNCS, vol. 8796, pp. 197\u2013212. Springer, Heidelberg (2014)"},{"key":"6_CR2","unstructured":"Basca, C., Bernstein, A.: Avalanche: putting the spirit of the Web back into semantic web querying. In: Scalable Semantic Web Knowledge Base Systems, pp. 64\u201379 (2010)"},{"issue":"7","key":"6_CR3","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Communications of the ACM 13(7), 422\u2013426 (1970)","journal-title":"Communications of the ACM"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-642-41338-4_18","volume-title":"The Semantic Web \u2013 ISWC 2013","author":"C Buil-Aranda","year":"2013","unstructured":"Buil-Aranda, C., Hogan, A., Umbrich, J., Vandenbussche, P.-Y.: SPARQL web-querying infrastructure: ready for action? In: Alani, H., Kagal, L., Fokoue, A., Groth, P., Biemann, C., Parreira, J.X., Aroyo, L., Noy, N., Welty, C., Janowicz, K. (eds.) ISWC 2013, Part II. LNCS, vol. 8219, pp. 277\u2013293. Springer, Heidelberg (2013)"},{"key":"6_CR5","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-642-41360-5_19","volume-title":"Knowledge Engineering and the Semantic Web","author":"I Ermilov","year":"2013","unstructured":"Ermilov, I., Martin, M., Lehmann, J., Auer, S.: Linked open data statistics: collection and exploitation. In: Klinov, P., Mouromtsev, D. (eds.) KESW 2013. CCIS, vol. 394, pp. 242\u2013249. Springer, Heidelberg (2013)"},{"key":"6_CR6","unstructured":"Feigenbaum, L., Williams, G.T., Clark, K.G., Torres, E.: sparql 1.1. protocol. Recommendation, w3c, March 2013. \n                      http:\/\/www.w3.org\/TR\/sparql11-protocol\/"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-642-23074-5_2","volume-title":"Transactions on Large-Scale Data- and Knowledge-Centered Systems III","author":"I Filali","year":"2011","unstructured":"Filali, I., Bongiovanni, F., Huet, F., Baude, F.: A survey of structured P2P systems for RDF data storage and retrieval. In: Hameurlain, A., K\u00fcng, J., Wagner, R. (eds.) Transactions on Large-Scale Data- and Knowledge-Centered Systems III. LNCS, vol. 6790, pp. 20\u201355. Springer, Heidelberg (2011)"},{"issue":"2","key":"6_CR8","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1109\/TIT.1975.1055357","volume":"21","author":"R Gallager","year":"1975","unstructured":"Gallager, R., Van Voorhis, D.C.: Optimal source codes for geometrically distributed integer alphabets. Transactions on Information Theory 21(2), 228\u2013230 (1975)","journal-title":"Transactions on Information Theory"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Graefe, G.: Query evaluation techniques for large databases. acm Computing Surveys 25(2), 73\u2013169 (1993)","DOI":"10.1145\/152610.152611"},{"key":"6_CR10","unstructured":"Harris, S., Seaborne, A.: sparql 1.1 query language. Recommendation, w3c, March 2013. \n                      http:\/\/www.w3.org\/TR\/sparql11-query\/"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Heine, F.: Scalable p2p based RDF querying. In: Proceedings of the 1st International Conference on Scalable Information Systems (2006)","DOI":"10.1145\/1146847.1146864"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Hose, K., Schenkel, R.: Towards benefit-based rdf source selection for sparql queries. In: Proc. of the 4th International Workshop on Semantic Web Information Management, pp. 1\u20138 (2012)","DOI":"10.1145\/2237867.2237869"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Huang, H., Liu, C.: Estimating selectivity for joined rdf triple patterns. In: Conference on Information and Knowledge Management, pp. 1435\u20131444 (2011)","DOI":"10.1145\/2063576.2063784"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Li, J., Vuong, S.: Ontsum: a semantic query routing scheme in p2p networks based on concise ontology indexing. In: Advanced Information Networking and Applications, May 2007","DOI":"10.1109\/AINA.2007.104"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M.: Compressed Bloom filters. Transactions on Networking 10(5) (2002)","DOI":"10.1109\/TNET.2002.803864"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Neumann, T., Weikum, G.: Scalable join processing on very large rdf graphs. In: Proceedings of the International Conference on Management of Data, pp. 627\u2013640. ACM (2009)","DOI":"10.1145\/1559845.1559911"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-540-88564-1_7","volume-title":"The Semantic Web - ISWC 2008","author":"E Oren","year":"2008","unstructured":"Oren, E., Gu\u00e9ret, C., Schlobach, S.: Anytime query answering in RDF through evolutionary algorithms. In: Sheth, A.P., Staab, S., Dean, M., Paolucci, M., Maynard, D., Finin, T., Thirunarayan, K. (eds.) ISWC 2008. LNCS, vol. 5318, pp. 98\u2013113. Springer, Heidelberg (2008)"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Pu, X., Wang, J., Luo, P., Wang, M.: Aweto: efficient incremental update and querying in rdf storage system. In: Proceedings of the 20th International Conference on Information and Knowledge Management, pp. 2445\u20132448. ACM (2011)","DOI":"10.1145\/2063576.2063988"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Putze, F., Sanders, P., Singler, J.: Cache-, hash-, and space-efficient Bloom filters. Journal of Experimental Algorithmics 14(4) (2009)","DOI":"10.1145\/1498698.1594230"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Ravindra, P., Hong, S., Kim, H., Anyanwu, K.: Efficient processing of rdf graph pattern matching on MapReduce platforms. In: Proceedings of the 2nd International Workshop on Data Intensive Computing in the Clouds, pp. 13\u201320 (2011)","DOI":"10.1145\/2087522.2087527"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Rietveld, L., Verborgh, R., Beek, W., Vander Sande, M., Schlobach, S.: Linked data-as-a-service: the semantic web redeployed. In: 12th Extended Semantic Web Conference (2015)","DOI":"10.1007\/978-3-319-18818-8_29"},{"key":"6_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/978-3-319-11964-9_16","volume-title":"The Semantic Web \u2013 ISWC 2014","author":"M Schmachtenberg","year":"2014","unstructured":"Schmachtenberg, M., Bizer, C., Paulheim, H.: Adoption of the linked data best practices in different topical domains. In: Mika, P., Tudorache, T., Bernstein, A., Welty, C., Knoblock, C., Vrande\u010di\u0107, D., Groth, P., Noy, N., Janowicz, K., Goble, C. (eds.) ISWC 2014, Part I. LNCS, vol. 8796, pp. 245\u2013260. Springer, Heidelberg (2014)"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Van Herwegen, J., Verborgh, R., Mannens, E., Van de Walle, R.: Query execution optimization for clients of triple pattern fragments. In: Extended Semantic Web Conference, June 2015","DOI":"10.1007\/978-3-319-18818-8_19"},{"key":"6_CR24","unstructured":"Verborgh, R.: Triple Pattern Fragments. Unofficial draft, Hydra w3c Community Group. \n                      http:\/\/www.hydra-cg.com\/spec\/latest\/triple-pattern-fragments\/"},{"key":"6_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/978-3-319-11964-9_12","volume-title":"The Semantic Web \u2013 ISWC 2014","author":"R Verborgh","year":"2014","unstructured":"Verborgh, R., et al.: Querying datasets on the web with high availability. In: Mika, P., Tudorache, T., Bernstein, A., Welty, C., Knoblock, C., Vrande\u010di\u0107, D., Groth, P., Noy, N., Janowicz, K., Goble, C. (eds.) ISWC 2014, Part I. LNCS, vol. 8796, pp. 180\u2013196. Springer, Heidelberg (2014)"},{"key":"6_CR26","unstructured":"Verborgh, R., Mannens, E., Van de Walle, R.: Initial usage analysis of DBpedia\u2019s triple pattern fragments. In: Proc. of the 5th Workshop on Usage Analysis and the Web of Data (2015)"},{"key":"6_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-642-31235-9_16","volume-title":"Scientific and Statistical Database Management","author":"X Zhang","year":"2012","unstructured":"Zhang, X., Chen, L., Wang, M.: Towards efficient join processing over large RDF graph using MapReduce. In: Ailamaki, A., Bowers, S. (eds.) SSDBM 2012. LNCS, vol. 7338, pp. 250\u2013259. Springer, Heidelberg (2012)"}],"container-title":["Lecture Notes in Computer Science","The Semantic Web - ISWC 2015"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-25007-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,28]],"date-time":"2020-09-28T00:41:05Z","timestamp":1601253665000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-25007-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319250069","9783319250076"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-25007-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"30 October 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}