1994 · 77 citations · 23 references
ComputingComputer ScienceInformation TechnologyAlgorithmsData ManagementDatabasesDatabase ManagementQuery OptimizationQuery ProcessingRelational AlgebraRelational DatabasesStructured Query LanguageExtensible Database SystemsJoinJoin AlgorithmsJoin OrderingJoin ProcessingPredicate PushdownRelational Database SystemsRelational Query Processing
We describe the implementation of the magic-sets transformation in the Starburst extensible relational database system. To our knowledge this is the first implementation of the magic-sets transformation in a relational database system. The Starburst implementation has many novel features that make our implementation especially interesting to database practitioners (in addition to database researchers). (1) We use a cost-based heuristic for determining join orders (sips) before applying magic. (2) We push all equality and non-equality predicates using magic, replacing traditional predicate pushdown optimizations. (3) We apply magic to full SQL with duplicates, aggregation, null values, and subqueries. (4) We integrate magic with other relational optimization techniques. (5) The implementation is extensible.
23
Access path selection in a relational database management system
Patricia G. Selinger, M. M. Astrahan, Donald D. Chamberlin et al. · 1979 · 2.2K citations
Magic sets and other strange ways to implement logic programs (extended abstract)
François Bancilhon, David Maier, Yehoshua Sagiv et al. · 1985 · 534 citations
On optimizing an SQL-like nested query
Won Bae Kim · ACM Transactions on Database Systems · 1982 · 393 citations · Full text
A logical language for data and knowledge bases
Choice Reviews Online · 1989 · 351 citations