Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Mokhtar Kandil is active.

Publication


Featured researches published by Mokhtar Kandil.


very large data bases | 2004

Automated statistics collection in DB2 UDB

Ashraf Aboulnaga; Peter J. Haas; Mokhtar Kandil; Sam Lightstone; Guy M. Lohman; Volker Markl; Ivan Popivanov; Vijayshankar Raman

The use of inaccurate or outdated database statistics by the query optimizer in a relational DBMS often results in a poor choice of query execution plans and hence unacceptably long query processing times. Configuration and maintenance of these statistics has traditionally been a time-consuming manual operation, requiring that the database administrator (DBA) continually monitor query performance and data changes in order to determine when to refresh the statistics values and when and how to adjust the set of statistics that the DBMS maintains. In this paper we describe the new Automated Statistics Collection (ASC) component of IBM® DB2® Universal DatabaseTM (DB2 UDB). This autonomic technology frees the DBA from the tedious task of manually supervising the collection and maintenance of database statistics. ASC monitors both the update-delete-insert (UDI) activities on the data as well as query feedback (QF), i.e., the results of the queries that are executed on the data. ASC uses these two sources of information to automatically decide which statistics to collect and when to collect them. This combination of UDI-driven and QF-driven autonomic processes ensures that the system can handle unforeseen queries while also ensuring good performance for frequent and important queries. We present the basic concepts, architecture, and key implementation details of ASC in DB2 UDB, and present a case study showing how the use of ASC can speed up a query workload by orders of magnitude without requiring any DBA intervention.


international conference on management of data | 2007

Progressive optimization in a shared-nothing parallel database

Wook-Shin Han; Jack Hon Wai Ng; Volker Markl; Holger Kache; Mokhtar Kandil

Commercial enterprise data warehouses are typically implemented on parallel databases due to the inherent scalability and performance limitation of a serial architecture. Queries used in such large data warehouses can contain complex predicates as well as multiple joins, and the resulting query execution plans generated by the optimizer may be sub-optimal due to mis-estimates of row cardinalities. Progressive optimization (POP) is an approach to detect cardinality estimation errors by monitoring actual cardinalities at run-time and to recover by triggering re-optimization with the actual cardinalities measured. However, the original serial POP solution is based on a serial processing architecture, and the core ideas cannot be readily applied to a parallel shared-nothing environment. Extending the serial POP to a parallel environment is a challenging problem since we need to determine when and how we can trigger re-optimization based on cardinalities collected from multiple independent nodes. In this paper, we present a comprehensive and practical solution to this problem, including several novel voting schemes whether to trigger re-optimization, a mechanism to reuse local intermediate results across nodes as a partitioned materialized view, several flavors of parallel checkpoint operators, and parallel checkpoint processing methods using efficient communication protocols. This solution has been prototyped in a leading commercial parallel DBMS. We have performed extensive experiments using the TPC-H benchmark and a real-world database. Experimental results show that our solution has negligible runtime overhead and accelerates the performance of complex OLAP queries by up to a factor of 22.


database and expert systems applications | 2012

Alternative Query Optimization for Workload Management

Zahid Abul-Basher; Yi Feng; Parke Godfrey; Xiaohui Yu; Mokhtar Kandil; Daniel C. Zilio; Calisto Zuzarte

Systems with heavy workloads run many queries concurrently. Modern database workloads—as those incurred by business intelligence applications—involve ad-hoc, highly complex, expensive queries. While query plans are optimized individually, the workload overall is not. Plans running together incur resource contention, resulting in sub-optimal performance. To address this, we introduce the idea of alternative-objective query optimization. Multiple query plans for the same query are generated, each optimized for an alternative resource usage. At runtime, the workload manager then can choose the plan for the query that works best for runtime conditions. This balances the system load, reducing contention, to increase overall workload throughput.


international conference on management of data | 2005

Automated statistics collection in action

Peter J. Haas; Mokhtar Kandil; Alberto Lerner; Volker Markl; Ivan Popivanov; Vijayshankar Raman; Daniel C. Zilio

If presented with inaccurate statistics, even the most sophisticated query optimizers make mistakes. They may wrongly estimate the output cardinality of a certain operation and thus make sub-optimal plan choices based on that cardinality. Maintaining accurate statistics is hard, both because each table may need a specifically parameterized set of statistics and because statistics get outdated as the database changes. Automated Statistic Collection (ASC) is a new component in IBM DB2 UDB that, without any DBA intervention, observes and analyzes the effects of faulty statistics and, in response, it triggers actions that continuously repair the latter. In this demonstration, we will show how ASC works to alleviate the DBA from the task of maintaining fresh, accurate statistics in several challenging scenarios. ASC is able to reconfigure the statistics collection parameters (e.g, number of frequent values for a column, or correlations between certain column pairs) on a per-table basis. ASC can also detect and guard against outdated statistics caused by high updates/inserts/deletes rates in volatile, dynamic databases. We will also show how ASC works from the inside: from how cardinality mis-estimations are introduced in different kind of operators, to how this error is propagated to later operations in the plan, to how this influences plan choices inside the optimizer.


international conference on data engineering | 2007

Poster Session Problem definition for effective workload management

Adrian M. Teisanu; Mariano P. Consens; Mokhtar Kandil; Sam Lightstone; Daniele Costante Zilio; Calisto Zuzarte

The paper introduces the problem of designing dynamic workload management (WM) tools that are aware of the diversity of classes of users and their diverse access patterns. Our approach should be contrasted with the current WM tools and their ability of detecting performance degradations in accordance with the users preference goals. We define the problem and suggest a formal definition that allows the further development of algorithms and architectures that allow the implementation of effective on-line database tuning strategies.


very large data bases | 2001

LEO - DB2's LEarning Optimizer

Michael Stillger; Guy M. Lohman; Volker Markl; Mokhtar Kandil


Archive | 2008

SYSTEM AND METHOD FOR MULTIPLE DISTINCT AGGREGATE QUERIES

Josep Aguilar Saborit; Miroslaw A. Flasza; Mokhtar Kandil; Serge Philippe Rielau; David C. Sharpe; Calisto Zuzarte


Archive | 2005

SQL query problem determination tool

Mokhtar Kandil; Volker Markl


Archive | 2006

Management of statistical views in a database system

Mokhtar Kandil; Alberto Lerner; Volker Markl; Daniele Costante Zilio; Calisto Zuzarte


Archive | 2004

Method, system, and program for storing sensor data in autonomic systems

Mokhtar Kandil; Volker Markl

Collaboration


Dive into the Mokhtar Kandil's collaboration.

Researchain Logo
Decentralizing Knowledge