See this document in CiteSeerX!

Reusing Invariants: A New Strategy for Correlated Queries (1998)  (Make Corrections)  (12 citations)
Jun Rao Department of Computer Science Columbia University...



  Home/Search   Context   Related

 
View or download:
columbia.edu/~kar/pubsk/invariant.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  informatik.tudarmstadt.de/D...dw (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Correlated queries are very common and important in decision support systems. Traditional nested iteration evaluation methods for such queries can be very time consuming. When they apply, query rewriting techniques have been shown to be much more efficient. But query rewriting is not always possible. When query rewriting does not apply, can we do something better than the traditional nested iteration methods? In this paper, we propose a new invariant technique to evaluate correlated queries... (Update)

Context of citations to this paper:   More

...or implementation used for each operator. The problem of (intermediate) result size estimation has been intensively studied in literature [11, 5, 12]. In this article, we focus on the physical cost component. Therefore, we assume a perfect oracle to predict the data volumes....

...set. This subplan is re initialized whenever a binding variable in its parameter list changes. Note that this follows the approach taken in [19] in which subexpressions with exactly zero bindings are executed only once. We generalize this to materialize at the appropriate level...

Cited by:   More
Optimization of Run-time Management of Data Intensive Web.. - Daniela Florescu Inria (1999)   (Correct)
Optimizing View Queries in ROLEX to Support.. - Bohannon, Ganguly.. (2002)   (Correct)
Generic Database Cost Models for Hierarchical Memory Systems - Manegold, Boncz, Kersten (2002)   (Correct)

Active bibliography (related documents):   More   All
0.6:   Adapting Materialized Views After Redefinitions: . . . - Gupta, al. (1995)   (Correct)
0.6:   Groupwise Processing of Relational Queries - Chatziantoniou, Ross (1997)   (Correct)
0.3:   Monad Comprehensions: A Versatile Representation for Queries - Grust (2003)   (Correct)

Similar documents based on text:   More   All
0.1:   Implementing Database Operations Using SIMD Instructions - Zhou, Ross (2002)   (Correct)
0.1:   A Multi-resolution Block Storage Model for Database Design - Zhou, Ross (2003)   (Correct)
0.0:   Query Decomposition, Optimization and Processing in.. - Evrendilek, Dogac (1994)   (Correct)

Related documents from co-citation:   More   All
5:   Selection of views to materialize in a data warehouse - Gupta - 1997
5:   Complex query decorrelation (context) - Seshadri, Pirahesh et al. - 1996
4:   Access path selection in a relational database management system (context) - Selinger, Astrahan et al. - 1979

BibTeX entry:   (Update)

J. Rao and K. A. Ross. Reusing invariants: A new strategy for correlated queries. In Proc. of ACM SIGMOD Conf. on Management of Data, pages 37--48, 1998. http://citeseer.ist.psu.edu/rao98reusing.html   More

@inproceedings{ rao98reusing,
    author = "Jun Rao and Kenneth A. Ross",
    title = "Reusing invariants: a new strategy for correlated queries",
    pages = "37--48",
    year = "1998",
    url = "citeseer.ist.psu.edu/rao98reusing.html" }
Citations (may not include all citations):
389   Access path selection in a relational database management sy.. (context) - Selinger, Astrahan et al. - 1979
194   Online aggregation - Hellerstein, Haas et al. - 1997
74   On optimizing an sql-like nested query (context) - Kim - 1982
64   Measuring the complexity of join enumeration in query optimi.. (context) - Ono, Lohman - 1990
59   Of nests and trees: A unified approach to processing queries.. (context) - Dayal - 1987
57   ACM Transactions on Database Systems (context) - Sellis - 1988
47   Optimization of nested sql queries revisited (context) - Ganski, Wong - 1987
46   Eager aggregation and lazy aggregation - Yan, Larson - 1995
36   functions and machine learning (context) - Michie - 1968
32   Practical predicate placement - Hellerstein - 1994
28   Fundamental techniques for order optimization (context) - Simmen, Shekita et al. - 1996
26   Complex query decorrelation (context) - Seshadri, Pirahesh et al. - 1996
24   Query execution techniques for caching expensive methods - Hellerstein, Naughton - 1996
21   Improved query performance with variant indexes (context) - O'Neil, Quas - 1997
19   Processing queries for first few answers - Jr, Miranker - 1996
12   an extensible and parallel query evaluation system (context) - Graefe - 1994
8   An evaluation of buffer management strategies for relational.. (context) - Chou, Dewitt - 1985
3   Sybase IQ (context) - Corporation - 1997
3   personal communication (context) - Paulley - 1997
3   Groupwise processing of relational queries - Chatziantoniou, Ross - 1997
2   Optimization of Complex Aggregate Queries in Relational Data.. (context) - Chatziantoniou - 1997
1   Adaptive Server Enterprise (context) - Corporation - 1997
1   rule based query rewrite optimization in startburst (context) - Pirahesh, Hellerstein et al. - 1992
1   IEEE Transactions on knowledge and data enginnering (context) - Sellis, Ghosh et al. - 1990
1   Sybase IQ Internal Engineering Document (context) - Bello, in - 1996
1   Dataflow operators feature specification (context) - Leary - 1996



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.informatik.tu-darmstadt.de/DVS1/staff/wu/dw.html):   More
PERF Join: An Alternative To Two-way Semijoin And Bloomjoin - Li, Ross (1995)   (Correct)
Faster Joins, Self-Joins and Multi-Way Joins Using Join Indices - Lei, Ross   (Correct)
Fast Computation of Sparse Datacubes - Ross, Srivastava (1997)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC