{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:32:00Z","timestamp":1743139920216,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":27,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819723027"},{"type":"electronic","value":"9789819723034"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-981-97-2303-4_3","type":"book-chapter","created":{"date-parts":[[2024,5,28]],"date-time":"2024-05-28T08:02:03Z","timestamp":1716883323000},"page":"32-47","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Locality Sensitive Hashing for\u00a0Data Placement to\u00a0Optimize Parallel Subgraph Query Evaluation"],"prefix":"10.1007","author":[{"given":"Mingdao","family":"Li","sequence":"first","affiliation":[]},{"given":"Bo","family":"Zhai","sequence":"additional","affiliation":[]},{"given":"Yuntao","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Yunjian","family":"Li","sequence":"additional","affiliation":[]},{"given":"Zheng","family":"Qin","sequence":"additional","affiliation":[]},{"given":"Peng","family":"Peng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,29]]},"reference":[{"issue":"11","key":"3_CR1","doi-asserted-by":"publisher","first-page":"1590","DOI":"10.14778\/3236187.3236208","volume":"11","author":"Z Abbas","year":"2018","unstructured":"Abbas, Z., Kalavri, V., Carbone, P., Vlassov, V.: Streaming graph partitioning: an experimental study. Proc. VLDB Endow. 11(11), 1590\u20131603 (2018)","journal-title":"Proc. VLDB Endow."},{"key":"3_CR2","doi-asserted-by":"publisher","unstructured":"Alu\u00e7, G., Hartig, O., \u00d6zsu, M.T., Daudjee, K.: Diversified stress testing of RDF data management systems. In: Mika, P., et\u00a0al. (eds.) ISWC 2014. LNCS, vol. 8796, pp. 197\u2013212. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11964-9_13","DOI":"10.1007\/978-3-319-11964-9_13"},{"issue":"2","key":"3_CR3","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s00778-018-0530-9","volume":"28","author":"G Alu\u00e7","year":"2019","unstructured":"Alu\u00e7, G., \u00d6zsu, M.T., Daudjee, K.: Building self-clustering RDF databases using tunable-LSH. VLDB J. 28(2), 173\u2013195 (2019)","journal-title":"VLDB J."},{"key":"3_CR4","unstructured":"Aum\u00fcller, M., Ceccarello, M.: Implementing distributed similarity joins using locality sensitive hashing. In: EDBT, pp. 1:78\u20131:90. OpenProceedings.org (2022)"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Bi, F., Chang, L., Lin, X., Qin, L., Zhang, W.: Efficient subgraph matching by postponing cartesian products. In: SIGMOD, New York, NY, USA, pp. 1199\u20131214. Association for Computing Machinery (2016)","DOI":"10.1145\/2882903.2915236"},{"key":"3_CR6","unstructured":"Broder, A.: On the resemblance and containment of documents. In: SEQUENCES, USA, p. 21. IEEE Computer Society (1997)"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Fan, W.: Graph pattern matching revised for social network analysis. In: ICDT, New York, NY, USA, pp. 8\u201321. Association for Computing Machinery (2012)","DOI":"10.1145\/2274576.2274578"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Fan, W., et\u00a0al.: Application driven graph partitioning. In: SIGMOD, New York, NY, USA, pp. 1765\u20131779. Association for Computing Machinery (2020)","DOI":"10.1145\/3318464.3389745"},{"issue":"1","key":"3_CR9","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s00778-022-00736-2","volume":"32","author":"W Fan","year":"2023","unstructured":"Fan, W., Xu, R., Yin, Q., Yu, W., Zhou, J.: Application-driven graph partitioning. VLDB J. 32(1), 149\u2013172 (2023)","journal-title":"VLDB J."},{"key":"3_CR10","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., USA (1979)"},{"key":"3_CR11","unstructured":"Han, W.-S., Lee, J., Lee, J.-H.: Turbo$${}_{\\text{iso}}$$: towards ultrafast and robust subgraph isomorphism search in large graph databases. In: SIGMOD, New York, NY, USA, pp. 337\u2013348. Association for Computing Machinery (2013)"},{"issue":"2","key":"3_CR12","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/3311967","volume":"44","author":"X Hu","year":"2019","unstructured":"Hu, X., Yi, K., Tao, Y.: Output-optimal massively parallel algorithms for similarity joins. ACM Trans. Database Syst. 44(2), 61\u2013636 (2019)","journal-title":"ACM Trans. Database Syst."},{"issue":"11","key":"3_CR13","first-page":"1123","volume":"4","author":"J Huang","year":"2011","unstructured":"Huang, J., Abadi, D.J., Ren, K.: Scalable SPARQL querying of large RDF graphs. PVLDB 4(11), 1123\u20131134 (2011)","journal-title":"PVLDB"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Indyk, P.: Nearest neighbors in high-dimensional spaces. In: Handbook of Discrete and Computational Geometry, 2nd edn., pp. 877\u2013892. Chapman and Hall\/CRC (2004)","DOI":"10.1201\/9781420035315-39"},{"key":"3_CR15","unstructured":"Ji, J., Li, J., Yan, S., Zhang, B., Tian, Q.: Super-bit locality-sensitive hashing. In: NIPS, NIPS 2012, Red Hook, NY, USA, pp. 108\u2013116. Curran Associates Inc. (2012)"},{"issue":"1","key":"3_CR16","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. 20(1), 359\u2013392 (1998)","journal-title":"SIAM J. Sci. Comput."},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Kiran, P., Sivadasan, N.: Scalable graph similarity search in large graph databases. In: 2015 IEEE Recent Advances in Intelligent Computational Systems (RAICS), pp. 207\u2013211 (2015)","DOI":"10.1109\/RAICS.2015.7488415"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Kwak, H., Lee, C., Park, H., Moon, S.: What is Twitter, a social network or a news media? In: WWW, New York, NY, USA, pp. 591\u2013600. Association for Computing Machinery (2010)","DOI":"10.1145\/1772690.1772751"},{"issue":"10","key":"3_CR19","doi-asserted-by":"publisher","first-page":"1099","DOI":"10.14778\/3339490.3339494","volume":"12","author":"L Lai","year":"2019","unstructured":"Lai, L., Qing, Z., Yang, Z., Jin, X., Lai, Z., Wang, R., Hao, K., Lin, X., Qin, L., Zhang, W., Zhang, Y., Qian, Z., Zhou, J.: Distributed Subgraph Matching on Timely Dataflow. Proc. VLDB Endow. 12(10), 1099\u20131112 (2019)","journal-title":"Proc. VLDB Endow."},{"key":"3_CR20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139924801","volume-title":"Mining of Massive Datasets","author":"J Leskovec","year":"2014","unstructured":"Leskovec, J., Rajaraman, A., Ullman, J.D.: Mining of Massive Datasets, 2nd edn. Cambridge University Press, Cambridge (2014)","edition":"2"},{"issue":"14","key":"3_CR21","doi-asserted-by":"publisher","first-page":"i127","DOI":"10.1093\/bioinformatics\/btz354","volume":"35","author":"G Mar\u00e7ais","year":"2019","unstructured":"Mar\u00e7ais, G., DeBlasio, D.F., Pandey, P., Kingsford, C.: Locality-sensitive hashing for the edit distance. Bioinform. 35(14), i127\u2013i135 (2019)","journal-title":"Bioinform."},{"key":"3_CR22","doi-asserted-by":"publisher","unstructured":"\u00d6zsu, M.T., Valduriez, P.: Principles of Distributed Database Systems, 4th edn. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-26253-2","DOI":"10.1007\/978-3-030-26253-2"},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Peng, P., Ozsu, M., Zou, L., Yan, C., Liu, C.: MPC: minimum property-cut RDF graph partitioning. In: ICDE, Los Alamitos, CA, USA, pp. 192\u2013204. IEEE Computer Society (2022)","DOI":"10.1109\/ICDE53745.2022.00019"},{"issue":"8","key":"3_CR24","doi-asserted-by":"publisher","first-page":"974","DOI":"10.1093\/bioinformatics\/btl030","volume":"22","author":"N Pr\u017eulj","year":"2006","unstructured":"Pr\u017eulj, N., Corneil, D.G., Jurisica, I.: Efficient estimation of graphlet frequency distributions in protein-protein interaction networks. Bioinformatics 22(8), 974\u2013980 (2006)","journal-title":"Bioinformatics"},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"Tang, J., Zhang, J., Yao, L., Li, J., Zhang, L., Su, Z.: Arnetminer: extraction and mining of academic social networks. In: SIGKDD, New York, NY, USA, pp. 990\u2013998. Association for Computing Machinery (2008)","DOI":"10.1145\/1401890.1402008"},{"key":"3_CR26","doi-asserted-by":"crossref","unstructured":"Yan, D., Guo, G., Chowdhury, M.M.R., \u00d6zsu, M.T., Ku, W., Lui, J.C.S.: G-thinker: a distributed framework for mining subgraphs in a big graph. In: ICDE, pp. 1369\u20131380, Dallas, TX, USA. IEEE (2020)","DOI":"10.1109\/ICDE48307.2020.00122"},{"key":"3_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/978-3-319-24075-6_60","volume-title":"Advances in Multimedia Information Processing \u2013 PCM 2015","author":"B Zhang","year":"2015","unstructured":"Zhang, B., Liu, X., Lang, B.: Fast graph similarity search via locality sensitive hashing. In: Ho, Y.-S., Sang, J., Ro, Y.M., Kim, J., Wu, F. (eds.) PCM 2015. LNCS, vol. 9314, pp. 623\u2013633. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24075-6_60"}],"container-title":["Lecture Notes in Computer Science","Web and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-2303-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,28]],"date-time":"2024-05-28T08:02:32Z","timestamp":1716883352000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-2303-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819723027","9789819723034"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-2303-4_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"29 May 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APWeb-WAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint International Conference on Web and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wuhan","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apwebwaim2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.apweb-waim2023.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}