Candidate joining trees of the tuples generation algorithm based on an index over keyword search in relational databases

摘要

Candidate joining trees of tuples generation based on a schema graph is an important factor that affects system query efficiency. In this paper, we propose a candidate joining trees of tuples generation algorithm based on index. The algorithm creates an index between tuples through primary key to foreign key relationships between the table and the table in the preprocessing stage, and then generates the candidate joining trees of tuples using the index. Theoretical analysis and experiment results show that the algorithm reduces the time spent generating candidate joining trees of tuples and improves the efficiency of a keyword search.