IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2023i1p229-d1022705.html
   My bibliography  Save this article

A Trie Based Set Similarity Query Algorithm

Author

Listed:
  • Lianyin Jia

    (Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming 650500, China
    Yunnan Key Laboratory of Artificial Intelligence, Kunming University of Science and Technology, Kunming 650500, China)

  • Junzhuo Tang

    (Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming 650500, China)

  • Mengjuan Li

    (Library, Yunnan Normal University, Kunming 650500, China)

  • Runxin Li

    (Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming 650500, China)

  • Jiaman Ding

    (Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming 650500, China)

  • Yinong Chen

    (School of Computing and Augmented Intelligence, Arizona State University, Tempe, AZ 85287, USA)

Abstract

Set similarity query is a primitive for many applications, such as data integration, data cleaning, and gene sequence alignment. Most of the existing algorithms are inverted index based, they usually filter unqualified sets one by one and do not have sufficient support for duplicated sets, thus leading to low efficiency. To solve this problem, this paper designs T-starTrie, an efficient trie based index for set similarity query, which can naturally group sets with the same prefix into one node, and can filter all sets corresponding to the node at a time, thereby significantly improving the candidates generation efficiency. In this paper, we find that the set similarity query problem can be transformed into matching nodes of the first-layer (FMNodes) detecting problem on T-starTrie. Therefore, an efficient FLMNode detection algorithm is designed. Based on this, an efficient set similarity query algorithm, TT-SSQ, is implemented by developing a variety of filtering techniques. Experimental results show that TT-SSQ can be up to 3.10x faster than existing algorithms.

Suggested Citation

  • Lianyin Jia & Junzhuo Tang & Mengjuan Li & Runxin Li & Jiaman Ding & Yinong Chen, 2023. "A Trie Based Set Similarity Query Algorithm," Mathematics, MDPI, vol. 11(1), pages 1-13, January.
    • Handle: RePEc:gam:jmathe:v:11:y:2023:i:1:p:229-:d:1022705
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/1/229/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/11/1/229/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:11:y:2023:i:1:p:229-:d:1022705. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.