ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Platform-Independent Robust Query Processing

Karthik, S and Haritsa, JR and Kenkre, S and Pandit, V and Krishnan, L (2019) Platform-Independent Robust Query Processing. In: IEEE Transactions on Knowledge and Data Engineering, 31 (1). pp. 17-31.

[img] PDF
IEEE_tra_kno_dat_eng_31-1_17-31_2019.pdf - Published Version
Restricted to Registered users only

Download (1MB) | Request a copy
Official URL: https://doi.org/10.1109/TKDE.2017.2664827


To address the classical selectivity estimation problem for OLAP queries in relational databases, a radically different approach called PlanBouquet was recently proposed in [1] , wherein the estimation process is completely abandoned and replaced with a calibrated discovery mechanism. The beneficial outcome of this new construction is that provable guarantees on worst-case performance, measured as Maximum Sub-Optimality (MSO), are obtained thereby facilitating robust query processing. The PlanBouquet formulation suffers, however, from a systemic drawback-the MSO bound is a function of not only the query, but also the optimizer's behavioral profile over the underlying database platform. As a result, there are adverse consequences: (i) the bound value becomes highly variable, depending on the specifics of the current operating environment, and (ii) it becomes infeasible to compute the value without substantial investments in preprocessing overheads. In this paper, we first present SpillBound, a new query processing algorithm that retains the core strength of the PlanBouquet discovery process, but reduces the bound dependency to only the query. It does so by incorporating plan termination and selectivity monitoring mechanisms in the database engine. Specifically, SpillBound delivers a worst-case multiplicative bound, of D2+3D , where D is simply the number of error-prone predicates in the user query. Consequently, the bound value becomes independent of the optimizer and the database platform, and the guarantee can be issued simply by query inspection. We go on to prove that SpillBound is within an O(D) factor of the best possible deterministic selectivity discovery algorithm in its class. We next devise techniques to bridge this quadratic-To-linear MSO gap by introducing the notion of contour alignment, a characterization of the nature of plan structures along the boundaries of the selectivity space. Specifically, we propose a variant of SpillBound, called AlignedBound, which exploits the alignment property and provides a guarantee in the range [2D+2,D2+3D]. Finally, a detailed empirical evaluation over the standard decision-support benchmarks indicates that: (i) SpillBound provides markedly superior performance w.r.t. MSO as compared to PlanBouquet, and (ii) AlignedBound provides additional benefits for query instances that are challenging for SpillBound, often coming close to the ideal of MSO linearity in D. From an absolute perspective, AlignedBound evaluates virtually all the benchmark queries considered in our study with MSO of around 10 or lesser. Therefore, in an overall sense, SpillBound and AlignedBound offer a substantive step forward in the long-standing quest for robust query processing.

Item Type: Journal Article
Publication: IEEE Transactions on Knowledge and Data Engineering
Publisher: IEEE Computer Society
Additional Information: The copyright for this article belongs to IEEE Computer Society.
Keywords: Benchmarking; Decision support systems, Empirical evaluations; Monitoring mechanisms; Multiplicative bounds; plan bouquets; Query processing algorithms; Selectivity estimation; Substantial investments; Worst-case performance, Query processing
Department/Centre: Division of Electrical Sciences > Computer Science & Automation
Division of Interdisciplinary Sciences > Computational and Data Sciences
Date Deposited: 15 Nov 2022 09:26
Last Modified: 15 Nov 2022 09:26
URI: https://eprints.iisc.ac.in/id/eprint/78030

Actions (login required)

View Item View Item