Skip to main content
SpringerLink
Log in

Top-k String Auto-Completion with Synonyms

  • Conference paper
  • First Online:
Database Systems for Advanced Applications (DASFAA 2017)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 10178))

Included in the following conference series:

Abstract

Auto-completion is one of the most prominent features of modern information systems. The existing solutions of auto-completion provide the suggestions based on the beginning of the currently input character sequence (i.e. prefix). However, in many real applications, one entity often has synonyms or abbreviations. For example, “DBMS” is an abbreviation of “Database Management Systems”. In this paper, we study a novel type of auto-completion by using synonyms and abbreviations. We propose three trie-based algorithms to solve the top-k auto-completion with synonyms; each one with different space and time complexity trade-offs. Experiments on large-scale datasets show that it is possible to support effective and efficient synonym-based retrieval of completions of a million strings with thousands of synonyms rules at about a microsecond per-completion, while taking small space overhead (i.e. 160–200 bytes per string). The implementation of algorithms is publicly available at http://udbms.cs.helsinki.fi/?projects/autocompletion/download.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    In this table, we use the denotation \({\texttt {ab}{{\underline{\mathtt{{c}}}}}}\) to represent a node with label “c” with parent node labeled “b”, in path root – a – b – c.

References

  1. Burg, J.J., Ainsworth, J.D., Casto, B., Lang, S.: Experiments with the “oregon trail knapsack problem”. Electron. Notes Discrete Math. 1, 26–35 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  2. Cai, F., Rijke, M.: A survey of query auto completion in information retrieval. Found. Trends Inf. Retrieval 10(4), 273–363 (2016)

    Article  Google Scholar 

  3. Chaudhuri, S., Kaushik, R.: Extending autocompletion to tolerate errors. In: Proceedings of the 2009 ACM SIGMOD International Conference on Management of Data, SIGMOD 2009, pp. 707–718. ACM, New York (2009)

    Google Scholar 

  4. Dantzig, G.B.: Discrete-variable extremum problems. Oper. Res. 5(2), 266–277 (1957)

    Article  MathSciNet  Google Scholar 

  5. Hyvönen, E., Mäkelä, E.: Semantic autocompletion. In: Mizoguchi, R., Shi, Z., Giunchiglia, F. (eds.) ASWC 2006. LNCS, vol. 4185, pp. 739–751. Springer, Heidelberg (2006). doi:10.1007/11836025_72

    Chapter  Google Scholar 

  6. Ji, S., Li, G., Li, C., Feng, J.: Efficient interactive fuzzy keyword search. In: Proceedings of the 18th International Conference on World Wide Web, WWW 2009, pp. 371–380. ACM, New York (2009)

    Google Scholar 

  7. Kolesar, P.J.: A branch and bound algorithm for the knapsack problem. Manage. Sci. 13(9), 723–735 (1967)

    Article  Google Scholar 

  8. LeFevre, J., Sankaranarayanan, J., Hacigümüs, H., Tatemura, J., Polyzotis, N., Carey, M.J.: MISO: souping up big data query processing with a multistore system. In: SIGMOD Conference, pp. 1591–1602. ACM (2014)

    Google Scholar 

  9. Li, G., Ji, S., Li, C., Feng, J.: Efficient type-ahead search on relational data: a TASTIER approach. In: ACM SIGMOD, pp. 695–706 (2009)

    Google Scholar 

  10. Lu, J., Lin, C., Wang, W., Li, C., Xiao, X.: Boosting the quality of approximate string matching by synonyms. ACM Trans. Database Syst. 40(3), 15 (2015)

    Article  MathSciNet  Google Scholar 

  11. Schnaitter, K., Polyzotis, N., Getoor, L.: Index interactions in physical design tuning: modeling, analysis, and applications. PVLDB 2(1), 1234–1245 (2009)

    Google Scholar 

  12. Singh, R., Gulwani, S.: Learning semantic string transformations from examples. PVLDB 5(8), 740–751 (2012)

    Google Scholar 

  13. Tsuruoka, Y., McNaught, J., Tsujii, J., Ananiadou, S.: Learning string similarity measures for gene/protein name dictionary look-up using logistic regression. Bioinformatics 23(20), 2768–2774 (2007)

    Article  Google Scholar 

  14. Xiao, C., Qin, J., Wang, W., Ishikawa, Y., Tsuda, K., Sadakane, K.: Efficient error-tolerant query autocompletion. Proc. VLDB Endow. 6(6), 373–384 (2013)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Helsinki, Helsinki, Finland

    Pengfei Xu & Jiaheng Lu

Authors
  1. Pengfei Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jiaheng Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Pengfei Xu .

Editor information

Editors and Affiliations

  1. Arizona State University, Tempe - Phoenix, Arizona, USA

    Selçuk Candan

  2. of Science and Technology, Hong Kong University of Science and Technology, Hong Kong, China

    Lei Chen

  3. Aalborg University , Aalborg, Denmark

    Torben Bach Pedersen

  4. University of New South Wales , Sydney, New South Wales, Australia

    Lijun Chang

  5. The University of Queensland , Brisbane, Queensland, Australia

    Wen Hua

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Xu, P., Lu, J. (2017). Top-k String Auto-Completion with Synonyms. In: Candan, S., Chen, L., Pedersen, T., Chang, L., Hua, W. (eds) Database Systems for Advanced Applications. DASFAA 2017. Lecture Notes in Computer Science(), vol 10178. Springer, Cham. https://doi.org/10.1007/978-3-319-55699-4_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-55699-4_13

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-55698-7

  • Online ISBN: 978-3-319-55699-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation