Top

Published in:

2017 | OriginalPaper | Chapter

Top-k String Auto-Completion with Synonyms

Authors : Pengfei Xu, Jiaheng Lu

Published in: Database Systems for Advanced Applications

Publisher: Springer International Publishing

Activate our intelligent search to find suitable subject content or patents.

search-config

AI-assisted search

Off

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.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

previous chapter Locating Longest Common Subsequences with Limited Penalty

next chapter Efficient Regular Expression Matching on Compressed Strings

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.

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)MathSciNetCrossRefMATH

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

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)

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

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 CrossRef

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)

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

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)

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)

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)MathSciNetCrossRef

11.

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

12.

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

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)CrossRef

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)CrossRef

Title: Top-k String Auto-Completion with Synonyms
Authors: Pengfei Xu
Jiaheng Lu
Publisher: Springer International Publishing
Book: Database Systems for Advanced Applications
Print ISBN: 978-3-319-55698-7

Electronic ISBN: 978-3-319-55699-4

Copyright Year: 2017
DOI: https://doi.org/10.1007/978-3-319-55699-4_13

Springer Professional

Abstract

Please log in to get access to your license.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Springer Professional "Technik"

Springer Professional "Wirtschaft"

Premium Partner