欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
在传统的关系数据库上进行关键字查询已经成为近来数据库领域的研究热点，现有的工作都是以单个元组作为结果单元来返回．为了满足用户对于返回多元组的要求，提出了基于元组组合的关键字查询的概念，并通过返回元纽组合来响应查询．通过对问题的分析得到了一系列启发式剪枝策略，设计了一个综合的优化算法．通过一系列真实数据集和人工数据集上的实验，验证了优化算法在绝大部分情况下比最初的算法在性能上有了显著的提高．
英文摘要：
Databases have been used to organize and retrieve information for many years. In traditional ways, users have to use retrieve languages like SQL to get certain information, this is unfriendly to those who don＇t know such languages. So recently, researchers develop a new way to retrieve information from database by the method of keyword query, some works extend the research to aggregate query. However, most of these works by now are aimed to obtain individual tuples to answer the query. In some scenarios, people want to get multiple tuples to make the decision. In order to meet the need of returning multiple tuples, this paper firstly proposes a new concept called combination query to answer keyword query by returning tuple combinations. Some heuristic prune methods are proposed through analysis of the problem, and are integrated to an optimization algorithm. An empirical evaluation on both real data sets and synthetic data sets verifies that the optimization algorithm outperforms the initial algorithm obviously in most cases.
同期刊论文项目
同项目期刊论文
期刊信息
位置：