Optimal top-down join enumeration

D DeHaan, FW Tompa - Proceedings of the 2007 ACM SIGMOD …, 2007 - dl.acm.org
Most contemporary database systems perform cost-based join enumeration using some
variant of System-R's bottom-up dynamic programming method. The notable exceptions are …

[PDF][PDF] Robust query processing (dagstuhl seminar 12321)

G Graefe, W Guy, HA Kuno, G Paullley - Dagstuhl Reports, 2012 - drops.dagstuhl.de
Abstract The 2012 Dagstuhl 12321 Workshop on Robust Query Processing, held from 5--10
August 2012, brought together researchers from both academia and industry to discuss …

The clock data-aware eviction approach: Towards processing linked data streams with limited resources

S Gao, T Scharrenbach, A Bernstein - European Semantic Web …, 2014 - Springer
Processing streams rather than static files of Linked Data has gained increasing importance
in the web of data. When processing datastreams system builders are faced with the …

SQL Anywhere: A holistic approach to database self-management

IT Bowman, P Bumbulis, D Farrar… - 2007 IEEE 23rd …, 2007 - ieeexplore.ieee.org
In this paper we present an overview of the self-management features of SQL anywhere, a
full-function relational database system designed for frontline business environments with …

Method, system, and program for selecting a join order for tables subject to a join operation

TA Beavin, YC Fuh, JF Sinnott Jr - US Patent 6,980,981, 2005 - Google Patents
Provided are a method, System, and program for Selecting a join order for tables Subject to
a join operation. An estima tion is made of a join cost to perform joins on permutations of at …

[PDF][PDF] Optimal top-down join enumeration (extended version)

D DeHaan, FW Tompa - University of Waterloo, Tech. Rep, 2007 - cs.uwaterloo.ca
Most contemporary database systems perform cost-based join enumeration using some
variant of System-R's bottomup dynamic programming method. The notable exceptions are …

[PDF][PDF] Systematic literature review: Cost estimation in relational databases

RK Kurella - 2018 - wwwiti.cs.uni-magdeburg.de
Relational databases are used for the storage and retrieval of data. Users input queries for
retrieving the required data using SQL (a declarative language). Data is retrieved more often …

[PDF][PDF] Optimization Strategy of Top-Down Join Enumeration on Modern Multi-Core CPUs.

W Zuo, Y Chen, F He, K Chen - J. Comput., 2011 - Citeseer
Most contemporary database systems query optimizers exploit System-R's bottom-up
dynamic programming method (DP) to find the optimal query execution plan (QEP) without …

Deriving predicate statistics for logic rules

S Liang, M Kifer - Web Reasoning and Rule Systems: 6th International …, 2012 - Springer
Database query optimizers rely on data statistics in selecting query execution plans and rule-
based systems can greatly benefit from such optimizations as well. To this end, one first …

10381 Summary and Abstracts Collection–Robust Query Processing

G Graefe, AC König, HA Kuno, V Markl, KU Sattler - 2011 - drops.dagstuhl.de
Dagstuhl seminar 10381 on robust query processing (held 19.09. 10-24.09. 10) brought
together a diverse set of researchers and practitioners with a broad range of expertise for the …