José Tomás Cadenas, Leonid José Tineo Rodríguez, R. T. Pereira
{"title":"关于模糊查询处理","authors":"José Tomás Cadenas, Leonid José Tineo Rodríguez, R. T. Pereira","doi":"10.1109/CLEI.2013.6670605","DOIUrl":null,"url":null,"abstract":"Traditional Relational Database Management System (RDBMS) query languages suffer from rigidity. There are some proposals for solving this problem using fuzzy sets, such as SQLf. The trouble with fuzzy querying languages is that they have been proposed to be implemented with loosely or middle coupling architecture, adding undesired overhead. This paper deals with the theoretical and pragmatic foundations for providing SQLf with tight coupling. We present an original experimental study that evidences performance of tight coupling approach for fuzzy querying.","PeriodicalId":184399,"journal":{"name":"2013 XXXIX Latin American Computing Conference (CLEI)","volume":"5 3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"About fuzzy query processing\",\"authors\":\"José Tomás Cadenas, Leonid José Tineo Rodríguez, R. T. Pereira\",\"doi\":\"10.1109/CLEI.2013.6670605\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Traditional Relational Database Management System (RDBMS) query languages suffer from rigidity. There are some proposals for solving this problem using fuzzy sets, such as SQLf. The trouble with fuzzy querying languages is that they have been proposed to be implemented with loosely or middle coupling architecture, adding undesired overhead. This paper deals with the theoretical and pragmatic foundations for providing SQLf with tight coupling. We present an original experimental study that evidences performance of tight coupling approach for fuzzy querying.\",\"PeriodicalId\":184399,\"journal\":{\"name\":\"2013 XXXIX Latin American Computing Conference (CLEI)\",\"volume\":\"5 3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-11-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 XXXIX Latin American Computing Conference (CLEI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CLEI.2013.6670605\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 XXXIX Latin American Computing Conference (CLEI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CLEI.2013.6670605","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Traditional Relational Database Management System (RDBMS) query languages suffer from rigidity. There are some proposals for solving this problem using fuzzy sets, such as SQLf. The trouble with fuzzy querying languages is that they have been proposed to be implemented with loosely or middle coupling architecture, adding undesired overhead. This paper deals with the theoretical and pragmatic foundations for providing SQLf with tight coupling. We present an original experimental study that evidences performance of tight coupling approach for fuzzy querying.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
