NDLI: Optimization of continuous queries with shared expensive filters

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

Generalized hypertree decompositions: np-hardness and tractable variants

Machine models and lower bounds for query processing

XML transformation by tree-walking transducers with invisible pebbles

Maintaining bernoulli samples over evolving multisets

CWA-solutions for data exchange settings with target dependencies

A crash course on database queries

Monadic datalog over finite structures with bounded treewidth

Reasoning about XML update constraints

Optimization of continuous queries with shared expensive filters

Marrying words and trees

Privacy, accuracy, and consistency too: a holistic solution to contingency table release

Management of probabilistic data: foundations and challenges

Queries determined by views: pack your views

Decision trees for entity identification: approximation algorithms and hardness results

The complexity of query containment in expressive fragments of XPath 2.0

Finding near neighbors through cluster pruning

Quasi-inverses of schema mappings

The complexity of reasoning about pattern-based XML schemas

Index-based multidimensional array queries: safety and equivalence

Polynomial time fragments of XPath with variables

Variance estimation over sliding windows

Estimating statistical aggregates on probabilistic data streams

On the complexity of managing probabilistic XML data

Provenance semirings

Expressiveness and complexity of xml publishing transducers

On reconciling data exchange, data integration, and peer data management

Non-linear prefixes in query languages

Sketching unaggregated data streams for subpopulation-size queries

The dichotomy of conjunctive queries on probabilistic structures

What is "next" in event processing?

Maximally joining probabilistic data

Optimization of continuous queries with shared expensive filters

Content Provider	ACM Digital Library
Author	Widom, Jennifer Munagala, Kamesh Srivastava, Utkarsh
Abstract	We consider the problem of optimizing and executing multiple continuous queries, where each query is a conjunction of filters and each filter may occur in multiple queries. When filters are expensive, significant performance gains are achieved by sharing filter evaluations across queries. A shared execution strategy in our scenario can either be fixed, in which filters are evaluated in the same predetermined order for all input, or adaptive, in which the next filter to be evaluated is chosen at runtime based on the results of the filters evaluated so far. We show that as filter costs increase, the best adaptive strategy is superior to any fixed strategy, despite the overhead of adaptivity. We show that itis NP-hard to find the optimal adaptive strategy, even if we are willing to approximate within any factor smaller than m where m is the number of queries. We then present a greedy adaptive execution strategy and show that it approximates the best adaptive strategy to within a factor $O(log^{2}m$ log n) where n is the number of distinct filters. We also give a precomputation technique that can reduce the execution overhead of adaptive strategies.
Starting Page	215
Ending Page	224
Page Count	10
File Format	PDF
ISBN	9781595936851
DOI	10.1145/1265530.1265561
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2007-06-11
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Expensive predicates Shared execution Query optimization
Content Type	Text
Resource Type	Article

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

Abstract optimization of continuous queries with shared expensive filters ∗.

ABSTRACT Optimization of Continuous Queries with Shared Expensive Filters ∗

Optimization of continuous queries with shared expensive filters (2007)

Optimizing Queries with Expensive Video Predicates Based on Estimation of Attribute Cardinality

Optimization of multi-version expensive predicates

Optimizing complex queries with multiple relation instances

Optimizing disjunctive queries with expensive predicates

Execution and optimization of continuous queries with cyclops

Predicate migration: optimizing queries with expensive predicates

Optimization of continuous queries with shared expensive filters

Similar Documents

Abstract optimization of continuous queries with shared expensive filters ∗.

ABSTRACT Optimization of Continuous Queries with Shared Expensive Filters ∗

Optimization of continuous queries with shared expensive filters (2007)

Optimizing Queries with Expensive Video Predicates Based on Estimation of Attribute Cardinality

Optimization of multi-version expensive predicates

Optimizing complex queries with multiple relation instances

Optimizing disjunctive queries with expensive predicates

Execution and optimization of continuous queries with cyclops

Predicate migration: optimizing queries with expensive predicates

Optimization of continuous queries with shared expensive filters