{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T05:33:06Z","timestamp":1768109586683,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,5,27]],"date-time":"2015-05-27T00:00:00Z","timestamp":1432684800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,5,27]]},"DOI":"10.1145\/2723372.2747647","type":"proceedings-article","created":{"date-parts":[[2015,6,2]],"date-time":"2015-06-02T05:35:02Z","timestamp":1433223302000},"page":"107-122","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":41,"title":["LEMP"],"prefix":"10.1145","author":[{"given":"Christina","family":"Teflioudi","sequence":"first","affiliation":[{"name":"Max Planck Institute for Computer Science, Saarbruecken, Germany"}]},{"given":"Rainer","family":"Gemulla","sequence":"additional","affiliation":[{"name":"University of Mannheim, Mannheim, Germany"}]},{"given":"Olga","family":"Mykytiuk","sequence":"additional","affiliation":[{"name":"Sulzer GmbH, Muenchen, Germany"}]}],"member":"320","published-online":{"date-parts":[[2015,5,27]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1201\/9781584888338"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"e_1_3_2_1_3_1","unstructured":"S. Riedel L. Yao B. M. Marlin and A. McCallum \"Relation extraction with matrix factorization and universal schemas \" in HLT-NAACL 2013.  S. Riedel L. Yao B. M. Marlin and A. McCallum \"Relation extraction with matrix factorization and universal schemas \" in HLT-NAACL 2013."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/375551.375567"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242591"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.9"},{"key":"e_1_3_2_1_7_1","first-page":"422","article-title":"An efficient similarity join algorithm with cosine similarity predicate","author":"Lee D.","year":"2010","unstructured":"D. Lee , J. Park , J. Shim , and S.-g. Lee , \" An efficient similarity join algorithm with cosine similarity predicate ,\" in DEXA: Part II , 2010 , pp. 422 -- 436 . D. Lee, J. Park, J. Shim, and S.-g. Lee, \"An efficient similarity join algorithm with cosine similarity predicate,\" in DEXA: Part II, 2010, pp. 422--436.","journal-title":"DEXA: Part"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367516"},{"key":"e_1_3_2_1_9_1","first-page":"518","article-title":"Similarity search in high dimensions via hashing","author":"Gionis A.","year":"1999","unstructured":"A. Gionis , P. Indyk , and R. Motwani , \" Similarity search in high dimensions via hashing ,\" in VLDB , 1999 , pp. 518 -- 529 . A. Gionis, P. Indyk, and R. Motwani, \"Similarity search in high dimensions via hashing,\" in VLDB, 1999, pp. 518--529.","journal-title":"VLDB"},{"key":"e_1_3_2_1_10_1","first-page":"1","article-title":"Fast exact max-kernel search","author":"Curtin R. R.","year":"2013","unstructured":"R. R. Curtin , P. Ram , and A. G. Gray , \" Fast exact max-kernel search ,\" in SDM , 2013 , pp. 1 -- 9 . R. R. Curtin, P. Ram, and A. G. Gray, \"Fast exact max-kernel search,\" in SDM, 2013, pp. 1--9.","journal-title":"SDM"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339677"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143857"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1002\/sam.11218"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2600428.2609578"},{"key":"e_1_3_2_1_15_1","first-page":"2321","article-title":"Asymmetric LSH (ALSH) for sublinear time maximum inner product search (MIPS)","author":"Shrivastava A.","year":"2014","unstructured":"A. Shrivastava and P. Li , \" Asymmetric LSH (ALSH) for sublinear time maximum inner product search (MIPS) ,\" in NIPS , 2014 , pp. 2321 -- 2329 . A. Shrivastava and P. Li, \"Asymmetric LSH (ALSH) for sublinear time maximum inner product search (MIPS),\" in NIPS, 2014, pp. 2321--2329.","journal-title":"NIPS"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2645710.2645741"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2396831"},{"key":"e_1_3_2_1_18_1","volume-title":"L2ap: Fast cosine similarity search with prefix l-2 norm bounds,\" in ICDE","author":"Anastasiu D. C.","year":"2014","unstructured":"D. C. Anastasiu and G. Karypis , \" L2ap: Fast cosine similarity search with prefix l-2 norm bounds,\" in ICDE , 2014 . D. C. Anastasiu and G. Karypis, \"L2ap: Fast cosine similarity search with prefix l-2 norm bounds,\" in ICDE, 2014."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.14778\/2140436.2140440"},{"key":"e_1_3_2_1_20_1","volume-title":"The Netflix prize,\" in KDD Cup and Workshop","author":"Bennett J.","year":"2007","unstructured":"J. Bennett and S. Lanning , \" The Netflix prize,\" in KDD Cup and Workshop , 2007 . J. Bennett and S. Lanning, \"The Netflix prize,\" in KDD Cup and Workshop, 2007."},{"key":"e_1_3_2_1_21_1","volume-title":"The Yahoo! Music Dataset and KDD-Cup'11,\" JMLR Workshop and Conference Proceedings","author":"Dror G.","year":"2012","unstructured":"G. Dror , N. Koenigstein , Y. Koren , and M. Weimer , \" The Yahoo! Music Dataset and KDD-Cup'11,\" JMLR Workshop and Conference Proceedings , vol. 18 , 2012 . G. Dror, N. Koenigstein, Y. Koren, and M. Weimer, \"The Yahoo! Music Dataset and KDD-Cup'11,\" JMLR Workshop and Conference Proceedings, vol. 18, 2012."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68880-8_32"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.120"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043932.2043964"},{"key":"e_1_3_2_1_25_1","first-page":"1135","article-title":"Patty: A taxonomy of relational patterns with semantic types","author":"Nakashole N.","year":"2012","unstructured":"N. Nakashole , G. Weikum , and F. Suchanek , \" Patty: A taxonomy of relational patterns with semantic types ,\" in EMNLP-CoNLL , 2012 , pp. 1135 -- 1145 . N. Nakashole, G. Weikum, and F. Suchanek, \"Patty: A taxonomy of relational patterns with semantic types,\" in EMNLP-CoNLL, 2012, pp. 1135--1145.","journal-title":"EMNLP-CoNLL"}],"event":{"name":"SIGMOD\/PODS'15: International Conference on Management of Data","location":"Melbourne Victoria Australia","acronym":"SIGMOD\/PODS'15","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2723372.2747647","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2723372.2747647","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:16:38Z","timestamp":1750227398000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2723372.2747647"}},"subtitle":["Fast Retrieval of Large Entries in a Matrix Product"],"short-title":[],"issued":{"date-parts":[[2015,5,27]]},"references-count":25,"alternative-id":["10.1145\/2723372.2747647","10.1145\/2723372"],"URL":"https:\/\/doi.org\/10.1145\/2723372.2747647","relation":{},"subject":[],"published":{"date-parts":[[2015,5,27]]},"assertion":[{"value":"2015-05-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}