Horizontal fragmentation for fuzzy querying databases

摘要

Fuzzy querying is one of the main research topics of database investigators. Several research works to date focused on building fuzzy data models, fuzzy query languages, and fuzzy database systems. However, such systems turn out to be less efficient when it comes to querying very large data. Therefore, improving the performance of such database systems is an important research issue. In this paper, we address this issue by proposing a complete fragmentation methodology. Especially, we propose an horizontal fragmentation algorithm as well as different query execution strategies whose aim is minimizing the number of fragment accesses. Extensive experimental evaluation demonstrates the efficiency of our framework scaling up to millions of tuples.