{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:07:46Z","timestamp":1750306066549,"version":"3.41.0"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,5,2]],"date-time":"2017-05-02T00:00:00Z","timestamp":1493683200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000774","name":"Newcastle University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100000774","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib Parallel Databases"],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1007\/s10619-017-7196-y","type":"journal-article","created":{"date-parts":[[2017,5,2]],"date-time":"2017-05-02T16:07:12Z","timestamp":1493741232000},"page":"85-115","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["TAPER: query-aware, partition-enhancement for large, heterogenous graphs"],"prefix":"10.1007","volume":"35","author":[{"given":"Hugo","family":"Firth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Missier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,2]]},"reference":[{"key":"7196_CR1","doi-asserted-by":"crossref","unstructured":"Barcelo, P., Hurtado, C.A., Libkin, L., Wood, P.T.: Expressive languages for path queries over graph-structured data. In: Proceedings of the Twenty-Ninth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS), pp. 3\u201314 (2010)","DOI":"10.1145\/1807085.1807089"},{"issue":"1","key":"7196_CR2","first-page":"886","volume":"2","author":"L Chen","year":"2009","unstructured":"Chen, L.: Distance-join: pattern match query in a large graph. Sci. Technol. 2(1), 886\u2013897 (2009)","journal-title":"Sci. Technol."},{"issue":"1\u20132","key":"7196_CR3","doi-asserted-by":"crossref","first-page":"48","DOI":"10.14778\/1920841.1920853","volume":"3","author":"C Curino","year":"2010","unstructured":"Curino, C., Jones, E., Zhang, Y., Madden, S.: Schism: a workload-driven approach database replication and partitioning. Proc. VLDB Endow. 3(1\u20132), 48\u201357 (2010)","journal-title":"Proc. VLDB Endow."},{"key":"7196_CR4","first-page":"221","volume":"2","author":"Jc Delvenne","year":"2013","unstructured":"Delvenne, Jc, Schaub, M.T., Yaliraki, S.N.: The stability of a graph partition: a dynamics-based framework for community detection. Dyn. Complex Netw. 2, 221\u2013242 (2013)","journal-title":"Dyn. Complex Netw."},{"key":"7196_CR5","doi-asserted-by":"crossref","unstructured":"Fiduccia, C., Mattheyses, R.: A linear-time heuristic for improving network partitions. In: Proceedings of the 19th Design Automation Conference (1982)","DOI":"10.1109\/DAC.1982.1585498"},{"key":"7196_CR6","doi-asserted-by":"crossref","unstructured":"Firth, H., Missier, P.: ProvGen: generating synthetic PROV graphs with predictable structure. In: 5th International Provenance and Annotation Workshop, (IPAW), pp. 16\u201327 (2014)","DOI":"10.1007\/978-3-319-16462-5_2"},{"key":"7196_CR7","unstructured":"Firth, H., Missier, P.: Workload-aware streaming graph partitioning. In: Workshop Proceedings of the EDBT\/ICDT 2016 Joint Conference (2016)"},{"issue":"2","key":"7196_CR8","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1137\/0916028","volume":"16","author":"B Hendrickson","year":"1995","unstructured":"Hendrickson, B., Leland, R.: An improved spectral graph partitioning algorithm for mapping parallel computations. SIAM J. Sci. Comput. 16(2), 452\u2013469 (1995)","journal-title":"SIAM J. Sci. Comput."},{"key":"7196_CR9","doi-asserted-by":"crossref","unstructured":"Huang, Z., Chung, W., Ong, T.H., Chen, H.: A graph-based recommender system for digital library. In: Proceedings of the 2nd ACM\/IEEE-CS joint conference on Digital libraries, pp. 65\u201373 (2002)","DOI":"10.1145\/544220.544231"},{"key":"7196_CR10","doi-asserted-by":"crossref","unstructured":"Jindal, A., Dittrich, J.: Relax and let the database do the partitioning online. In: Enabling Real-Time Business Intelligence, pp. 65\u201380 (2012)","DOI":"10.1007\/978-3-642-33500-6_5"},{"key":"7196_CR11","doi-asserted-by":"crossref","unstructured":"Karvounarakis, G., Ives, Z.G., Tannen, V.: Querying data provenance. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data (SIGMOD \u201910), pp. 951\u2013962. ACM, New York (2010)","DOI":"10.1145\/1807167.1807269"},{"issue":"2","key":"7196_CR12","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1006\/jpdc.1997.1410","volume":"47","author":"G Karypis","year":"1997","unstructured":"Karypis, G., Kumar, V.: Multilevel k -way partitioning scheme for irregular graphs. J. Parallel Distrib. Comput. 47(2), 109\u2013124 (1997)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"1","key":"7196_CR13","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1006\/jpdc.1997.1403","volume":"48","author":"G Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: A parallel algorithm for multilevel graph partitioning and sparse matrix ordering. J. Parallel Distrib. Comput. 48(1), 71\u201395 (1998)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"2","key":"7196_CR14","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"BW Kernighan","year":"1970","unstructured":"Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49(2), 291\u2013307 (1970)","journal-title":"Bell Syst. Tech. J."},{"issue":"95","key":"7196_CR15","first-page":"1121","volume":"1133","author":"H Li","year":"2009","unstructured":"Li, H., Lee, S.: Mining top-K path traversal patterns over streaming web click-sequences. J. Inf. Sci. Eng. 1133(95), 1121\u20131133 (2009)","journal-title":"J. Inf. Sci. Eng."},{"issue":"12","key":"7196_CR16","doi-asserted-by":"crossref","first-page":"1478","DOI":"10.14778\/2824032.2824046","volume":"8","author":"D Margo","year":"2015","unstructured":"Margo, D., Seltzer, M.: A scalable distributed graph partitioner. Proc. VLDB Endow. 8(12), 1478\u20131489 (2015)","journal-title":"Proc. VLDB Endow."},{"issue":"6","key":"7196_CR17","doi-asserted-by":"crossref","first-page":"1235","DOI":"10.1137\/S009753979122370X","volume":"24","author":"AO Mendelzon","year":"1995","unstructured":"Mendelzon, A.O., Wood, P.T.: Finding regular simple paths in graph databases. SIAM J. Comput. 24(6), 1235\u20131258 (1995)","journal-title":"SIAM J. Comput."},{"key":"7196_CR18","doi-asserted-by":"crossref","unstructured":"Mondal, J., Deshpande, A.: Managing large dynamic graphs efficiently. In: Proceedings of the 2012 international conference on Management of Data, pp. 145\u2013156 (2012)","DOI":"10.1145\/2213836.2213854"},{"key":"7196_CR19","unstructured":"Moreau, L., Missier, P., Belhajjame, K., B\u2019Far, R., Cheney, J., Coppens, S., Cresswell, S., Gil, Y., Groth, P., Klyne, G., Lebo, T., McCusker, J., Miles, S., Myers, J., Sahoo, S., Tilmes, C.: PROV-DM: the PROV data model technical reports. In: World Wide Web Consortium (2012)"},{"key":"7196_CR20","doi-asserted-by":"crossref","unstructured":"Pavlo, A., Curino, C., Zdonik, S.: Skew-aware automatic database partitioning in shared-nothing, parallel OLTP systems. In: Proceedings of the 2012 international conference on Management of Data, p. 61 (2012)","DOI":"10.1145\/2213836.2213844"},{"key":"7196_CR21","doi-asserted-by":"crossref","unstructured":"Pujol, J.M., Erramilli, V., Siganos, G., Yang, X., Laoutaris, N., Chhabra, P., Rodriguez, P.: The little engine(s) that could. In: Proceedings of the ACM SIGCOMM 2010 Conference, pp. 375\u2013386 (2010)","DOI":"10.1145\/1851182.1851227"},{"key":"7196_CR22","doi-asserted-by":"crossref","unstructured":"Quamar, A., Kumar, K.A., Deshpande, A.: SWORD: scalable workload-aware data placement for transactional workloads. In: Proceedings of the 16th International Conference on Extending Database Technology, p. 430. ACM Press, New York (2013)","DOI":"10.1145\/2452376.2452427"},{"key":"7196_CR23","doi-asserted-by":"crossref","unstructured":"Sanders, P., Schulz, C.: Think locally, act globally: highly balanced graph partitioning. In: International Symposium on Experimental Algorithms, pp. 164\u2013175. Springer, New York (2013)","DOI":"10.1007\/978-3-642-38527-8_16"},{"issue":"2","key":"7196_CR24","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1006\/jpdc.1997.1410","volume":"47","author":"K Schloegel","year":"1997","unstructured":"Schloegel, K., Karypis, G., Kumar, V.: Multilevel diffusion schemes for repartitioning of adaptive meshes. J. Parallel Distrib. Comput. 47(2), 109\u2013124 (1997)","journal-title":"J. Parallel Distrib. Comput."},{"key":"7196_CR25","doi-asserted-by":"crossref","unstructured":"Shang, Z., Yu, J.X.: Catch the Wind: graph workload balancing on cloud. In: IEEE 29th International Conference on Data Engineering (ICDE), pp. 553\u2013564 (2013)","DOI":"10.1109\/ICDE.2013.6544855"},{"key":"7196_CR26","doi-asserted-by":"crossref","unstructured":"Stanton, I., Kliot, G.: Streaming graph partitioning for large distributed graphs. In: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1222\u20131230 (2012)","DOI":"10.1145\/2339530.2339722"},{"key":"7196_CR27","doi-asserted-by":"crossref","unstructured":"Tong, H., Gallagher, B., Faloutsos, C., Eliassi-Rad, T.: Fast best-effort pattern matching in large attributed graphs. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, p. 737 (2007)","DOI":"10.1145\/1281192.1281271"},{"key":"7196_CR28","doi-asserted-by":"crossref","unstructured":"Tsourakakis, C., Gkantsidis, C., Radunovic, B., Vojnovic, M.: FENNEL: streaming graph partitioning for massive scale graphs. In: Proceedings of the 7th ACM International Conference on Web Search and Data Mining, pp. 333\u2013342 (2014)","DOI":"10.1145\/2556195.2556213"},{"key":"7196_CR29","doi-asserted-by":"crossref","unstructured":"Vaquero, L.M., Cuadrado, F., Logothetis, D., Martella, C.: Adaptive partitioning for large-scale dynamic graphs. In: IEEE 34th International Conference on Distributed Computing Systems (ICDCS), pp. 144\u2013153 (2014)","DOI":"10.1109\/ICDCS.2014.23"},{"issue":"14","key":"7196_CR30","doi-asserted-by":"crossref","first-page":"1917","DOI":"10.14778\/2733085.2733097","volume":"7","author":"N Xu","year":"2014","unstructured":"Xu, N., Chen, L., Cui, B.: LogGP: a log-based dynamic graph partitioning method. Proc. VLDB Endow. 7(14), 1917\u20131928 (2014)","journal-title":"Proc. VLDB Endow."},{"issue":"6","key":"7196_CR31","doi-asserted-by":"crossref","first-page":"1560","DOI":"10.1109\/TKDE.2014.2377743","volume":"27","author":"N Xu","year":"2015","unstructured":"Xu, N., Cui, B., Chen, L., Huang, Z., Shao, Y.: Heterogeneous environment aware streaming graph partitioning. IEEE Trans. Knowl. Data Eng. 27(6), 1560\u20131572 (2015)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"7196_CR32","doi-asserted-by":"crossref","unstructured":"Yang, S., Yan, X., Zong, B., Khan, A.: Towards effective partition management for large graphs. In: Proceedings of the 2012 International Conference on Management of Data, pp. 517\u2013528. ACM Press, New York (2012)","DOI":"10.1145\/2213836.2213895"}],"container-title":["Distributed and Parallel Databases"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10619-017-7196-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10619-017-7196-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10619-017-7196-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:15:00Z","timestamp":1750216500000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10619-017-7196-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,2]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["7196"],"URL":"https:\/\/doi.org\/10.1007\/s10619-017-7196-y","relation":{},"ISSN":["0926-8782","1573-7578"],"issn-type":[{"type":"print","value":"0926-8782"},{"type":"electronic","value":"1573-7578"}],"subject":[],"published":{"date-parts":[[2017,5,2]]}}}