On Saying "Enough Already!" in SQL.
Michael J. Carey, Donald Kossmann:
On Saying "Enough Already!" in SQL.
SIGMOD Conference 1997: 219-230@inproceedings{DBLP:conf/sigmod/CareyK97,
author = {Michael J. Carey and
Donald Kossmann},
editor = {Joan Peckham},
title = {On Saying "Enough Already!" in SQL},
booktitle = {SIGMOD 1997, Proceedings ACM SIGMOD International Conference
on Management of Data, May 13-15, 1997, Tucson, Arizona, USA},
publisher = {ACM Press},
year = {1997},
pages = {219-230},
ee = {http://doi.acm.org/10.1145/253260.253302, db/conf/sigmod/CareyK97.html},
crossref = {DBLP:conf/sigmod/97},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX
Abstract
In this paper, we study a simple SQL extension that enables query
writers to explicitly limit the cardinality of a query result. We
examine its impact on the query optimization and run-time execution
components of a relational DBMS, presenting two approaches - a
Conservative approach and an Aggressive approach - to exploiting
cardinality limits in relational query plans. Results obtained from
an empirical study conducted using DB2 demonstrate the benefits
of the SQL extension and illustrate the tradeoffs between our two
approaches to implementing it.
Copyright © 1997 by the ACM,
Inc., used by permission. Permission to make
digital or hard copies is granted provided that
copies are not made or distributed for profit or
direct commercial advantage, and that copies show
this notice on the first page or initial screen of
a display along with the full citation.
Online Version (ACM WWW Account required): Full Text in PDF Format
CDROM Version: Load the CDROM "Volume 1 Issue 1, SIGMOD '93-'97" and ...
DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...
BibTeX
Printed Edition
Joan Peckham (Ed.):
SIGMOD 1997, Proceedings ACM SIGMOD International Conference on Management of Data, May 13-15, 1997, Tucson, Arizona, USA.
ACM Press 1997 BibTeX
,
SIGMOD Record 26(2),
June 1997
Contents
[Index Terms]
[Full Text in PDF Format, 1532 KB]
References
- [A+92]
- ...
- [BM96]
- Roberto J. Bayardo Jr., Daniel P. Miranker:
Processing Queries for First Few Answers.
CIKM 1996: 45-52 BibTeX
- [C+95]
- Michael J. Carey, Laura M. Haas, Peter M. Schwarz, Manish Arya, William F. Cody, Ronald Fagin, Myron Flickner, Allen Luniewski, Wayne Niblack, Dragutin Petkovic, Joachim Thomas II, John H. Williams, Edward L. Wimmers:
Towards Heterogeneous Multimedia Information Systems: The Garlic Approach.
RIDE-DOM 1995: 124-131 BibTeX
- [CG96]
- Surajit Chaudhuri, Luis Gravano:
Optimizing Queries over Multimedia Repositories.
SIGMOD Conference 1996: 91-102 BibTeX
- [CS94]
- Surajit Chaudhuri, Kyuseok Shim:
Including Group-By in Query Optimization.
VLDB 1994: 354-366 BibTeX
- [Fag96]
- Ronald Fagin:
Combining Fuzzy Information from Multiple Systems.
PODS 1996: 216-226 BibTeX
- [GD87]
- Goetz Graefe, David J. DeWitt:
The EXODUS Optimizer Generator.
SIGMOD Conference 1987: 160-172 BibTeX
- [G+92]
- Sumit Ganguly, Waqar Hasan, Ravi Krishnamurthy:
Query Optimization for Parallel Execution.
SIGMOD Conference 1992: 9-18 BibTeX
- [IBM95]
- ...
- [Knu73]
- Donald E. Knuth:
The Art of Computer Programming, Volume III: Sorting and Searching.
Addison-Wesley 1973, ISBN 0-201-03803-X
BibTeX
- [KS95]
- Ralph Kimball, Kevin Strehlo:
Why Decision Support Fails and How To Fix It.
SIGMOD Record 24(3): 92-97(1995) BibTeX
- [Loh88]
- Guy M. Lohman:
Grammar-like Functional Rules for Representing Query Optimization Alternatives.
SIGMOD Conference 1988: 18-27 BibTeX
- [MS93]
- Jim Melton, Alan R. Simon:
Understanding the New SQL: A Complete Guide.
Morgan Kaufmann 1993, ISBN 1-55860-245-3
Contents BibTeX
- [S+79]
- Patricia G. Selinger, Morton M. Astrahan, Donald D. Chamberlin, Raymond A. Lorie, Thomas G. Price:
Access Path Selection in a Relational Database Management System.
SIGMOD Conference 1979: 23-34 BibTeX
- [S+96]
- David E. Simmen, Eugene J. Shekita, Timothy Malkemus:
Fundamental Techniques for Order Optimization.
SIGMOD Conference 1996: 57-67 BibTeX
- [Sto96]
- Michael Stonebraker, Dorothy Moore:
Object-Relational DBMSs: The Next Great Wave.
Morgan Kaufmann 1996, ISBN 1-55860-397-2
BibTeX
- [WA91]
- Annita N. Wilschut, Peter M. G. Apers:
Dataflow Query Execution in a Parallel Main-Memory Environment.
PDIS 1991: 68-77 BibTeX
Referenced by
- Hyoseop Shin, Bongki Moon, Sukho Lee:
Adaptive Multi-Stage Distance Join Processing.
SIGMOD Conference 2000: 343-354
- Sergio Flesca, Sergio Greco:
Querying Graph Databases.
EDBT 2000: 510-524
- Vijayshankar Raman, Bhaskaran Raman, Joseph M. Hellerstein:
Online Dynamic Reordering for Interactive Data Processing.
VLDB 1999: 709-720
- Laura M. Haas, Donald Kossmann, Ioana Ursu:
Loading a Cache with Query Results.
VLDB 1999: 351-362
- Donko Donjerkovic, Raghu Ramakrishnan:
Probabilistic Optimization of Top N Queries.
VLDB 1999: 411-422
- Surajit Chaudhuri, Luis Gravano:
Evaluating Top-k Selection Queries.
VLDB 1999: 397-410
- Kian-Lee Tan, Cheng Hian Goh, Beng Chin Ooi:
On Getting Some Answers Quickly, and Perhaps More Later.
ICDE 1999: 32-39
- Michael J. Carey, Donald Kossmann:
Reducing the Braking Distance of an SQL Query Engine.
VLDB 1998: 158-169
- Björn Þór Jónsson, Michael J. Franklin, Divesh Srivastava:
Interaction of Query Evaluation and Buffer Management for Information Retrieval.
SIGMOD Conference 1998: 118-129
- Gísli R. Hjaltason, Hanan Samet:
Incremental Distance Join Algorithms for Spatial Databases.
SIGMOD Conference 1998: 237-248
- Sibel Adali, Piero A. Bonatti, Maria Luisa Sapino, V. S. Subrahmanian:
A Multi-Similarity Algebra.
SIGMOD Conference 1998: 402-413
- Michael J. Carey, Donald Kossmann:
Processing Top N and Bottom N Queries.
IEEE Data Eng. Bull. 20(3): 12-19(1997)
BibTeX
ACM SIGMOD Anthology - DBLP:
[Home | Search: Author, Title | Conferences | Journals]
ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Sat May 16 23:40:37 2009