{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:18:32Z","timestamp":1742962712066,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319184210"},{"type":"electronic","value":"9783319184227"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-18422-7_23","type":"book-chapter","created":{"date-parts":[[2015,4,28]],"date-time":"2015-04-28T12:21:56Z","timestamp":1430223716000},"page":"256-264","source":"Crossref","is-referenced-by-count":5,"title":["RDF Graph Partitions: A Brief Survey"],"prefix":"10.1007","author":[{"given":"Dominik","family":"Tomaszuk","sequence":"first","affiliation":[]},{"given":"\u0141ukasz","family":"Skonieczny","sequence":"additional","affiliation":[]},{"given":"David","family":"Wood","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","unstructured":"Abadi, D.J., Marcus, A., Madden, S.R., Hollenbach, K.: Scalable Semantic Web Data Management Using Vertical Partitioning. In: Proceedings of the 33rd International Conference on Very Large Data Bases, VLDB 2007, pp. 411\u2013422. VLDB Endowment (2007)"},{"issue":"1","key":"23_CR2","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1006\/jcss.1998.1605","volume":"58","author":"S. Arora","year":"1999","unstructured":"Arora, S., Karger, D., Karpinski, M.: Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems. Journal of Computer and System Sciences\u00a058(1), 193\u2013210 (1999)","journal-title":"Journal of Computer and System Sciences"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Auer, S., Bizer, C., Kobilarov, G., Lehmann, J., Cyganiak, R., Ives, Z.G.: DBpedia: A Nucleus for a Web of Open Data. In: Aberer, K., et al. (eds.) ASWC\/ISWC 2007. LNCS, vol.\u00a04825, pp. 722\u2013735. Springer, Heidelberg (2007)","DOI":"10.1007\/978-3-540-76298-0_52"},{"issue":"2","key":"23_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4018\/jswis.2009040101","volume":"5","author":"C. Bizer","year":"2009","unstructured":"Bizer, C., Schultz, A.: The Berlin SPARQL Benchmark. International Journal on Semantic Web and Information Systems (IJSWIS)\u00a05(2), 1\u201324 (2009)","journal-title":"International Journal on Semantic Web and Information Systems (IJSWIS)"},{"key":"23_CR5","unstructured":"Brickley, D., Miller, L.: FOAF Vocabulary Specification 0.99. Tech. rep., FOAF Project (January 2014)"},{"key":"23_CR6","unstructured":"Cyganiak, R., Lanthaler, M., Wood, D.: RDF 1.1 Concepts and Abstract Syntax. W3C recommendation, World Wide Web Consortium (February 2014)"},{"issue":"2A","key":"23_CR7","first-page":"379","volume":"33","author":"K. Czajkowski","year":"2012","unstructured":"Czajkowski, K., Trela, T.: Semantic web - standard, narz\u0119dzia, implementacje. Studia Informatica\u00a033(2A), 379\u2013393 (2012)","journal-title":"Studia Informatica"},{"issue":"3","key":"23_CR8","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete graph problems. Theoretical Computer Science\u00a01(3), 237\u2013267 (1976)","journal-title":"Theoretical Computer Science"},{"key":"23_CR9","first-page":"322","volume":"309","author":"K. Goczy\u0142a","year":"2008","unstructured":"Goczy\u0142a, K., Waloszek, A., Waloszek, W.: Techniki modularyzacji ontologii. Bazy danych. Rozw\u00f3j metod i technologii\u2013Architektura, metody formalne i zaawansowana analiza danych, red.: Kozielski, S. and Ma\u0142ysiak, B. and Kasprowski, P. and Mrozek, D. and WK\u0141 s\u00a0309, 322 (2008)","journal-title":"Bazy danych. Rozw\u00f3j metod i technologii\u2013Architektura, metody formalne i zaawansowana analiza danych, red.: Kozielski, S. and Ma\u0142ysiak, B. and Kasprowski, P. and Mrozek, D. and WK\u0141 s"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Goldschmidt, O., Hochbaum, D.S.: Polynomial algorithm for the k-cut problem. In: 29th Annual Symposium on Foundations of Computer Science, pp. 444\u2013451 (October 1988)","DOI":"10.1109\/SFCS.1988.21960"},{"issue":"2","key":"23_CR11","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/s004530010013","volume":"27","author":"N. Guttmann-Beck","year":"2000","unstructured":"Guttmann-Beck, N., Hassin, R.: Approximation Algorithms for Minimum K -Cut. Algorithmica\u00a027(2), 198\u2013207 (2000)","journal-title":"Algorithmica"},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-540-30475-3_5","volume-title":"The Semantic Web \u2013 ISWC 2004","author":"J. Hayes","year":"2004","unstructured":"Hayes, J., Gutierrez, C.: Bipartite Graphs as Intermediate Model for RDF. In: McIlraith, S.A., Plexousakis, D., van Harmelen, F. (eds.) ISWC 2004. LNCS, vol.\u00a03298, pp. 47\u201361. Springer, Heidelberg (2004)"},{"issue":"1","key":"23_CR13","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G. Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs. SIAM J. Sci. Comput.\u00a020(1), 359\u2013392 (1998)","journal-title":"SIAM J. Sci. Comput."},{"key":"23_CR14","first-page":"1","volume-title":"Proceedings of the 1998 ACM\/IEEE Conference on Supercomputing","author":"G. Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: Multilevel Algorithms for Multi-constraint Graph Partitioning. In: Proceedings of the 1998 ACM\/IEEE Conference on Supercomputing, pp. 1\u201313. IEEE Computer Society, Washington (1998)"},{"issue":"1","key":"23_CR15","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1006\/jpdc.1997.1404","volume":"48","author":"G. Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: Multilevel K-way Partitioning Scheme for Irregular Graphs. J. Parallel Distrib. Comput.\u00a048(1), 96\u2013129 (1998)","journal-title":"J. Parallel Distrib. Comput."},{"key":"23_CR16","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1145\/309847.309954","volume-title":"Proceedings of the 36th Annual ACM\/IEEE Design Automation Conference, DAC 1999","author":"G. Karypis","year":"1999","unstructured":"Karypis, G., Kumar, V.: Multilevel K-way Hypergraph Partitioning. In: Proceedings of the 36th Annual ACM\/IEEE Design Automation Conference, DAC 1999, pp. 343\u2013348. ACM, New York (1999)"},{"issue":"1","key":"23_CR17","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B.W. Kernighan","year":"1970","unstructured":"Kernighan, B.W., Lin, S.: An Efficient Heuristic Procedure for Partitioning Graphs. The Bell System Technical Journal\u00a049(1), 291\u2013307 (1970)","journal-title":"The Bell System Technical Journal"},{"issue":"14","key":"23_CR18","doi-asserted-by":"publisher","first-page":"1894","DOI":"10.14778\/2556549.2556571","volume":"6","author":"K. Lee","year":"2013","unstructured":"Lee, K., Liu, L.: Scaling Queries over Big RDF Graphs with Semantic Hash Partitioning. Proc. VLDB Endow.\u00a06(14), 1894\u20131905 (2013)","journal-title":"Proc. VLDB Endow."},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"Mulay, K., Kumar, P.S.: SPOVC: A Scalable RDF Store Using Horizontal Partitioning and Column Oriented DBMS. In: Proceedings of the 4th International Workshop on Semantic Web Information Management, SWIM 2012, pp. 8:1\u20138:8. ACM, New York (2012)","DOI":"10.1145\/2237867.2237875"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Nottingham, M., Hammer-Lahav, E.: Defining Well-Known Uniform Resource Identifiers (URIs). RFC 5785, Internet Engineering Task Force (April 2010)","DOI":"10.17487\/rfc5785"},{"key":"23_CR21","doi-asserted-by":"crossref","unstructured":"Saran, H., Vazirani, V.V.: Finding k-cuts within Twice the Optimal (1995)","DOI":"10.1137\/S0097539792251730"},{"key":"23_CR22","unstructured":"Sperberg-McQueen, M., Thompson, H., Peterson, D., Malhotra, A., Biron, P.V., Gao, S.: W3C XML Schema Definition Language (XSD) 1.1 Part 2: Datatypes. W3C recommendation, World Wide Web Consortium (April 2012)"},{"key":"23_CR23","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1109\/ISPA.2012.60","volume-title":"Proceedings of the 2012 IEEE 10th International Symposium on Parallel and Distributed Processing with Applications, ISPA 2010","author":"R. Wang","year":"2012","unstructured":"Wang, R., Chiu, K.: A Graph Partitioning Approach to Distributed RDF Stores. In: Proceedings of the 2012 IEEE 10th International Symposium on Parallel and Distributed Processing with Applications, ISPA 2010, pp. 411\u2013418. IEEE Computer Society, Washington, DC (2012)"},{"key":"23_CR24","first-page":"1263","volume-title":"Proceedings of the 2009 IEEE International Conference on Data Engineering, ICDE 2009","author":"Y. Yan","year":"2009","unstructured":"Yan, Y., Wang, C., Zhou, A., Qian, W., Ma, L., Pan, Y.: Efficient Indices Using Graph Partitioning in RDF Triple Stores. In: Proceedings of the 2009 IEEE International Conference on Data Engineering, ICDE 2009, pp. 1263\u20131266. IEEE Computer Society, Washington (2009)"}],"container-title":["Communications in Computer and Information Science","Beyond Databases, Architectures and Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18422-7_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T08:57:19Z","timestamp":1676451439000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-18422-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319184210","9783319184227"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18422-7_23","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2015]]}}}