NDLI: Robust query processing through progressive optimization

Please wait, while we are loading the content...

The next database revolution

Adaptive stream resource management using Kalman Filters

BLAS: an efficient XPath processing system

FleXPath: flexible structure and full-text querying for XML

Identifying similarities, periodicities and bursts for online search queries

Optimization of query streams using semantic prefetching

Lazy query evaluation for Active XML

A bi-level Bernoulli scheme for database sampling

Transaction support for indexed summary views

Constraint-based XML query rewriting for data integration

Adaptive ordering of pipelined stream filters

Clustering objects on a spatial network

Implementing a scalable XML publish/subscribe system using relational database systems

The price of validity in dynamic networks

Extending query rewriting techniques for fine-grained access control

Indexing spatio-temporal trajectories with Chebyshev polynomials

CORDS: automatic discovery of correlations and soft functional dependencies

Joining interval data in relational databases

TOSS: an extension of TAX with ontologies and similarity queries

Efficient set joins on similarity predicates

When one sample is not enough: improving text database selection using shrinkage

Toward a progress indicator for database queries

Relaxed currency and consistency: how to say "good enough" in SQL

Query sampling in DB2 Universal Database

Data densification in a relational database system

Models for Web Services tansactions

SoundCompass: a practical query-by-humming system; normalization of scalable and shiftable time-series data and effective subsequence generation

Requirements and policy challenges in highly secure environments

XML in the middle: XQuery in the WebLogic Platform

Declarative specification of Web applications exploiting Web services and workflows

Knocking the door to the deep Web: integrating Web query interfaces

MAIDS: mining alarming incidents from data streams

PIPES: a public infrastructure for processing and exploring streams

P2P-DIET: an extensible P2P service that unifies ad-hoc and continuous querying in super-peer networks

XSeq: an indexing infrastructure for tree pattern queries

"Share your data, keep your secrets."

LexEQUAL: multilexical matching operator in SQL

Rethinking the conference reviewing process

Tools for design of composite Web services

Security of shared data in large systems: state of the art and research directions

Fast algorithms for time series with applications to finance, physics, music, biology, and other suspects

Indexing and mining streams

The role of cryptography in database security

Online event-driven subsequence matching over financial data streams

Efficient processing of XML twig queries with OR-predicates

An interactive clustering-based approach to integrating source query interfaces on the deep Web

FARMER: finding interesting rule groups in microarray datasets

Buffering databse operations for enhanced instruction cache performance

Data stream management for historical XML data

Effective use of block-level sampling in statistics estimation

Graph indexing: a frequent structure-based approach

iMAP: discovering complex semantic matches between database schemas

Static optimization of conjunctive queries with sliding windows over infinite streams

Computing Clusters of Correlation Connected objects

Incremental maintenance of XML structural indexes

Compressing historical information in sensor networks

Order preserving encryption for numeric data

Prediction and indexing of moving objects with unknown motion patterns

Robust query processing through progressive optimization

Approximation techniques for spatial data

Information-theoretic tools for mining database structure from large data sets

Automatic categorization of query results

On the integration of structure indexes and inverted lists

Estimating progress of execution for SQL queries

Highly available, fault-tolerant, parallel dataflows

Query processing for SQL updates

Hosting the .NET Runtime in Microsoft SQL server

Enabling sovereign information sharing using Web Services

Model-driven business UI based on maps

Information assurance technical challenges

ORDPATHs: insert-friendly XML node labels

Yoo-Hoo!: building a presence service with XQuery and WSDL

Efficient development of data migration transformations

FAÇADE: a fast and effective approach to the discovery of dense clusters in noisy spatial data

Web-CAM: monitoring the dynamic Web to respond to continual queries

Querying at Internet scale

A TeXQuery-based XML full-text search engine

Managing healthcare data hippocratically

ITQS: an integrated transport query system

Holistic UDAFs at streaming speeds

Tree logical classes for efficient evaluation of XQuery

Understanding Web query interfaces: best-effort parsing with hidden syntax

Diamond in the rough: finding Hierarchical Heavy Hitters in multi-dimensional data

Rank-aware query optimization

Colorful XML: one hierarchy isn't enough

Online maintenance of very large random samples

The Priority R-tree: a practically efficient and worst-case optimal R-tree

Adapting to source properties in processing data integration queries

Dynamic plan migration for continuous queries over data streams

Incremental and effective data summarization for dynamic hierarchical clustering

Incremental evaluation of schema-directed XML publishing

Efficient query reformulation in peer data management systems

A formal analysis of information disclosure in data exchange

SINA: scalable incremental processing of continuous queries in spatio-temporal databases

Canonical abstraction for outerjoin optimization

Spatially-decaying aggregation over a network: model and algorithms

Parallel SQL execution in Oracle 10g

Vertical and horizontal percentage aggregations

Building dynamic application networks with Web Services

dbSwitch™: towards a database utility

Service-oriented BI: towards tight integration of business intelligence into operational applications

Liquid data for WebLogic: integrating enterprise data and services

Load management and high availability in the Medusa distributed stream processing system

Support for relaxed currency and consistency constraints in MTCache

BODHI: a database habitat for bio-diversity information

Using the structure of Web sites for automatic segmentation of tables

Cost-based labeling of groups of mass spectra

Fast computation of database operations using graphics processors

Approximate XML query answers

Conditional selectivity for statistics on query expressions

Integrating vertical and horizontal partitioning into automated physical database design

Secure XML querying with security views

STRIPES: an efficient index for predicted trajectories

Secure, reliable, transacted: innovation in Web Services architecture

StreaMon: an adaptive engine for stream query processing

An indexing framework for peer-to-peer systems

CAMAS: a citizen awareness system for crisis mitigation

Robust query processing through progressive optimization

Content Provider	ACM Digital Library
Author	Lohman, Guy Raman, Vijayshankar Simmen, David Pirahesh, Hamid Markl, Volker Cilimdzic, Miso
Abstract	Virtually every commercial query optimizer chooses the best plan for a query using a cost model that relies heavily on accurate cardinality estimation. Cardinality estimation errors can occur due to the use of inaccurate statistics, invalid assumptions about attribute independence, parameter markers, and so on. Cardinality estimation errors may cause the optimizer to choose a sub-optimal plan. We present an approach to query processing that is extremely robust because it is able to detect and recover from cardinality estimation errors. We call this approach "progressive query optimization" (POP). POP validates cardinality estimates against actual values as measured during query execution. If there is significant disagreement between estimated and actual values, execution might be stopped and re-optimization might occur. Oscillation between optimization and execution steps can occur any number of times. A re-optimization step can exploit both the actual cardinality and partial results, computed during a previous execution step. Checkpoint operators (CHECK) validate the optimizer's cardinality estimates against actual cardinalities. Each CHECK has a condition that indicates the cardinality bounds within which a plan is valid. We compute this validity range through a novel sensitivity analysis of query plan operators. If the CHECK condition is violated, CHECK triggers re-optimization. POP has been prototyped in a leading commercial DBMS. An experimental evaluation of POP using TPC-H queries illustrates the robustness POP adds to query processing, while incurring only negligible overhead. A case-study applying POP to a real-world database and workload shows the potential of POP, accelerating complex OLAP queries by almost two orders of magnitude.
Starting Page	659
Ending Page	670
Page Count	12
File Format	PDF
ISBN	1581138598
DOI	10.1145/1007568.1007642
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2004-06-13
Publisher Place	New York
Access Restriction	Subscribed
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in