×

Improving query evaluation with approximate functional dependency based decompositions. (English) Zbl 1010.68830

Eaglestone, Barry (ed.) et al., Advances in databases. 19th British national conference on databases, BNCOD 19, Sheffield, UK, July 17-19, 2002. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2405, 26-41 (2002).
Summary: We investigate how relational restructuring may be used to improve query performance. Our approach parallels recent research extending semantic query optimization (SQO), which uses knowledge about the instance to achieve more efficient query processing. Our approach differs, however, in that the instance does not govern whether the optimization may be applied; rather, the instance governs whether the optimization yields more efficient query processing. It also differs in that it involves an explicit decomposition of the relation instance. We use approximate functional dependencies as the conceptual basis for this decomposition and develop query rewriting techniques to exploit it. We present experimental results leading to a characterization of a well-defined class of queries for which improved processing time is observed.
For the entire collection see [Zbl 1008.68687].

MSC:

68U99 Computing methodologies and applications
68P15 Database theory

Citations:

Zbl 1008.68687

Software:

FastFDs
PDFBibTeX XMLCite
Full Text: Link