An Improved Method of Keyword Search over Relational Data Streams by Aggressive Candidate Network Consolidation

Abstract

Keyword search over relational streams is useful when allowing users to query on streams without understanding the details about the streams and query language as well. There have been several research works on this direction, and the state-of-the-art approaches exploit Candidate Networks (CNs), which are schema-level descriptions of possible joining networks of tuples, and generate query plans based on CNs. However, in fact, the performance of these approaches seriously degrades in particular when the maximum size of CNs ($T_{max}$) and/or the number of query keywords are large due to the explosive increase in number of CNs. To cope with this problem, we propose a novel query plan called MX-structure to consolidate all CNs as much as possible. We suppress explosive blowup of nodes in query plans by consolidating all common edges among CNs. The experimental results prove that the proposed algorithm performs much better than the state-of-the-art approaches.