{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,10]],"date-time":"2025-05-10T23:01:10Z","timestamp":1746918070005},"reference-count":12,"publisher":"Association for Computing Machinery (ACM)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2018,8]]},"abstract":"<jats:p>\n            Similarity search is a primitive operation in various database applications. Thus far, a large number of access methods have been proposed to accelerate the similarity query processing. Nonetheless, these methods mostly focus on developing standalone systems by proposing new indices. Given the fact that existing RDBMS merely support traditional indices, it is of great necessity and practical importance to develop a standard RDBMS built-in index based approach to speeding up the query processing. In this demonstration, we introduce MSQL+, a plugin toolkit that enable users to answer similarity queries in metric spaces simply using standard SQL statements. This toolkit can help existing RDBMS to effectively and efficiently handle with big data due to the following three advantages. First, MSQL+ enables users to find similar objects by submitting SELECT-FROM-WHERE statements so that it can be easily integrated into existing RDBMS. Second, MSQL+ works in a more general data space. Objects of any type can be indexed by B\n            <jats:sup>+<\/jats:sup>\n            -trees and the query processing can be boosted by using index seeks, as long as the similarity function is metric. Third, MSQL+ supports the parallelization of both pre-processing and query processing in distributed RDBMS.\n          <\/jats:p>","DOI":"10.14778\/3229863.3236237","type":"journal-article","created":{"date-parts":[[2018,9,10]],"date-time":"2018-09-10T12:12:28Z","timestamp":1536581548000},"page":"1970-1973","source":"Crossref","is-referenced-by-count":3,"title":["MSQL+"],"prefix":"10.14778","volume":"11","author":[{"given":"Wei","family":"Lu","sequence":"first","affiliation":[{"name":"Renmin University of China, Beijing, China"}]},{"given":"Xinyi","family":"Zhang","sequence":"additional","affiliation":[{"name":"Renmin University of China, Beijing, China"}]},{"given":"Zhiyu","family":"Shui","sequence":"additional","affiliation":[{"name":"Renmin University of China, Beijing, China"}]},{"given":"Zhe","family":"Peng","sequence":"additional","affiliation":[{"name":"Renmin University of China, Beijing, China"}]},{"given":"Xiao","family":"Zhang","sequence":"additional","affiliation":[{"name":"Renmin University of China, Beijing, China"}]},{"given":"Xiaoyong","family":"Du","sequence":"additional","affiliation":[{"name":"Renmin University of China, Beijing, China"}]},{"given":"Hao","family":"Huang","sequence":"additional","affiliation":[{"name":"Wuhan University, Wuhan, China"}]},{"given":"Xiaoyu","family":"Wang","sequence":"additional","affiliation":[{"name":"Tencent Inc., China"}]},{"given":"Anqun","family":"Pan","sequence":"additional","affiliation":[{"name":"Tencent Inc., China"}]},{"given":"Haixiang","family":"Li","sequence":"additional","affiliation":[{"name":"Tencent Inc., China"}]}],"member":"320","published-online":{"date-parts":[[2018,8]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Modern Information Retrieval","author":"Baeza-Yates R. A.","year":"1999","unstructured":"R. A. Baeza-Yates and B. A. Ribeiro-Neto . Modern Information Retrieval . ACM Press \/ Addison-Wesley , 1999 . R. A. Baeza-Yates and B. A. Ribeiro-Neto. Modern Information Retrieval. ACM Press \/ Addison-Wesley, 1999."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.32"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113317"},{"key":"e_1_2_1_4_1","first-page":"426","volume-title":"PVLDB","author":"Ciaccia P.","year":"1997","unstructured":"P. Ciaccia , M. Patella , and P. Zezula . M-tree: An efficient access method for similarity search in metric spaces . In PVLDB , pages 426 -- 435 , 1997 . P. Ciaccia, M. Patella, and P. Zezula. M-tree: An efficient access method for similarity search in metric spaces. In PVLDB, pages 426--435, 1997."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1025026030880"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1071610.1071612"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2309131"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-017-0481-6"},{"key":"e_1_2_1_9_1","volume-title":"sequences, and genomes: interdisciplinary statistics","author":"Waterman M. S.","year":"1995","unstructured":"M. S. Waterman . Introduction to computational biology -maps , sequences, and genomes: interdisciplinary statistics . CRC Press , 1995 . M. S. Waterman. Introduction to computational biology -maps, sequences, and genomes: interdisciplinary statistics. CRC Press, 1995."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.755617"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1093382.1093383"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807266"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3229863.3236237","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:09:15Z","timestamp":1672222155000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3229863.3236237"}},"subtitle":["a plugin toolkit for similarity search under metric spaces in distributed relational database systems"],"short-title":[],"issued":{"date-parts":[[2018,8]]},"references-count":12,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2018,8]]}},"alternative-id":["10.14778\/3229863.3236237"],"URL":"https:\/\/doi.org\/10.14778\/3229863.3236237","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2018,8]]}}}