{"title":"LexEQUAL: supporting multilexical queries in SQL","authors":"A. Kumaran, J. Haritsa","doi":"10.1109/ICDE.2004.1320075","DOIUrl":null,"url":null,"abstract":"Current database systems offer support for storing multilingual data, but are not capable of querying across languages, an important consideration in today's global economy. We therefore propose a new multilexical operator called LexEQUAL that extends the standard lexicographic matching in database systems to matching of text data across languages, specifically for names, which form close to twenty percent of text corpora. The implementation of the LexEQUAL operator is based on transforming matches in language space into parameterized approximate matches in the equivalent phoneme space. A detailed evaluation of our approach on a real data set shows that there exist settings of the algorithm parameters with which it is possible to achieve both good recall and precision.","PeriodicalId":358862,"journal":{"name":"Proceedings. 20th International Conference on Data Engineering","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 20th International Conference on Data Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDE.2004.1320075","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
Current database systems offer support for storing multilingual data, but are not capable of querying across languages, an important consideration in today's global economy. We therefore propose a new multilexical operator called LexEQUAL that extends the standard lexicographic matching in database systems to matching of text data across languages, specifically for names, which form close to twenty percent of text corpora. The implementation of the LexEQUAL operator is based on transforming matches in language space into parameterized approximate matches in the equivalent phoneme space. A detailed evaluation of our approach on a real data set shows that there exist settings of the algorithm parameters with which it is possible to achieve both good recall and precision.