274 lines
9.0 KiB
BibTeX
274 lines
9.0 KiB
BibTeX
|
|
@article{319745,
|
||
|
|
author = {Won Kim},
|
||
|
|
title = {On optimizing an SQL-like nested query},
|
||
|
|
journal = {ACM Trans. Database Syst.},
|
||
|
|
volume = {7},
|
||
|
|
number = {3},
|
||
|
|
year = {1982},
|
||
|
|
issn = {0362-5915},
|
||
|
|
pages = {443--469},
|
||
|
|
doi = {http://doi.acm.org/10.1145/319732.319745},
|
||
|
|
publisher = {ACM},
|
||
|
|
address = {New York, NY, USA},
|
||
|
|
}
|
||
|
|
|
||
|
|
@article{38723,
|
||
|
|
author = {Richard A. Ganski and Harry K. T. Wong},
|
||
|
|
title = {Optimization of nested SQL queries revisited},
|
||
|
|
journal = {SIGMOD Rec.},
|
||
|
|
volume = {16},
|
||
|
|
number = {3},
|
||
|
|
year = {1987},
|
||
|
|
issn = {0163-5808},
|
||
|
|
pages = {23--33},
|
||
|
|
doi = {http://doi.acm.org/10.1145/38714.38723},
|
||
|
|
publisher = {ACM},
|
||
|
|
address = {New York, NY, USA},
|
||
|
|
}
|
||
|
|
|
||
|
|
@INPROCEEDINGS{Brantner2007,
|
||
|
|
title = {Unnesting Scalar {SQL} Queries in the Presence of Disjunction},
|
||
|
|
author = {Brantner, M. and May, N. and Moerkotte, G.},
|
||
|
|
booktitle = {Data Engineering, 2007. {ICDE} 2007. {IEEE} 23rd International Conference on},
|
||
|
|
year = {2007},
|
||
|
|
pages = {46--55},
|
||
|
|
address = {Istanbul,},
|
||
|
|
month = apr,
|
||
|
|
abstract = {Optimizing nested queries is an intricate problem. It becomes even
|
||
|
|
harder if in a nested query the linking predicate or the
|
||
|
|
correlation predicate occurs disjunctively. We present the
|
||
|
|
first unnesting strategy that can effectively deal with such
|
||
|
|
queries. The starting point of our approach is to translate SQL
|
||
|
|
into the relational algebra extended by bypass operators. Then
|
||
|
|
we present for the first time unnesting equivalences which are
|
||
|
|
valid for algebraic expressions containing bypass operators.
|
||
|
|
Applying these to the translated queries results in our
|
||
|
|
effective unnesting strategy for nested SQL queries with
|
||
|
|
disjunction. With an extensive experimental study (including
|
||
|
|
three commercial DBMSs), we demonstrate the possible
|
||
|
|
performance gains of our approach.},
|
||
|
|
doi = {10.1109/ICDE.2007.367850},
|
||
|
|
}
|
||
|
|
|
||
|
|
@article{244812,
|
||
|
|
author = {C\'esar Galindo-Legaria and Arnon Rosenthal},
|
||
|
|
title = {Outerjoin simplification and reordering for query optimization},
|
||
|
|
journal = {ACM Trans. Database Syst.},
|
||
|
|
volume = {22},
|
||
|
|
number = {1},
|
||
|
|
year = {1997},
|
||
|
|
issn = {0362-5915},
|
||
|
|
pages = {43--74},
|
||
|
|
doi = {http://doi.acm.org/10.1145/244810.244812},
|
||
|
|
publisher = {ACM},
|
||
|
|
address = {New York, NY, USA},
|
||
|
|
}
|
||
|
|
|
||
|
|
@inproceedings{98738,
|
||
|
|
author = {Arnon Rosenthal and Cesar Galindo-Legaria},
|
||
|
|
title = {Query graphs, implementing trees, and freely-reorderable outerjoins},
|
||
|
|
booktitle = {SIGMOD '90: Proceedings of the 1990 ACM SIGMOD international conference on Management of data},
|
||
|
|
year = {1990},
|
||
|
|
isbn = {0-89791-365-5},
|
||
|
|
pages = {291--299},
|
||
|
|
location = {Atlantic City, New Jersey, United States},
|
||
|
|
doi = {http://doi.acm.org/10.1145/93597.98738},
|
||
|
|
publisher = {ACM},
|
||
|
|
address = {New York, NY, USA},
|
||
|
|
}
|
||
|
|
|
||
|
|
@inproceedings{191908,
|
||
|
|
author = {C\'esar A. Galindo-Legaria},
|
||
|
|
title = {Outerjoins as disjunctions},
|
||
|
|
booktitle = {SIGMOD '94: Proceedings of the 1994 ACM SIGMOD international conference on Management of data},
|
||
|
|
year = {1994},
|
||
|
|
isbn = {0-89791-639-5},
|
||
|
|
pages = {348--358},
|
||
|
|
location = {Minneapolis, Minnesota, United States},
|
||
|
|
doi = {http://doi.acm.org/10.1145/191839.191908},
|
||
|
|
publisher = {ACM},
|
||
|
|
address = {New York, NY, USA},
|
||
|
|
}
|
||
|
|
|
||
|
|
@INPROCEEDINGS{Microsoft03executingnested,
|
||
|
|
author = {Goetz Graefe Microsoft and Goetz Graefe},
|
||
|
|
title = {Executing Nested Queries},
|
||
|
|
booktitle = {In BTW},
|
||
|
|
year = {2003},
|
||
|
|
pages = {58--77}
|
||
|
|
}
|
||
|
|
|
||
|
|
@inproceedings{756653,
|
||
|
|
author = {Muralikrishna, M.},
|
||
|
|
title = {Improved Unnesting Algorithms for Join Aggregate SQL Queries},
|
||
|
|
booktitle = {VLDB '92: Proceedings of the 18th International Conference on Very Large Data Bases},
|
||
|
|
year = {1992},
|
||
|
|
isbn = {1-55860-151-1},
|
||
|
|
pages = {91--102},
|
||
|
|
publisher = {Morgan Kaufmann Publishers Inc.},
|
||
|
|
address = {San Francisco, CA, USA},
|
||
|
|
}
|
||
|
|
|
||
|
|
@inproceedings{671634,
|
||
|
|
author = {Dayal, Umeshwar},
|
||
|
|
title = {Of Nests and Trees: A Unified Approach to Processing Queries That Contain Nested Subqueries, Aggregates, and Quantifiers},
|
||
|
|
booktitle = {VLDB '87: Proceedings of the 13th International Conference on Very Large Data Bases},
|
||
|
|
year = {1987},
|
||
|
|
isbn = {0-934613-46-X},
|
||
|
|
pages = {197--208},
|
||
|
|
publisher = {Morgan Kaufmann Publishers Inc.},
|
||
|
|
address = {San Francisco, CA, USA},
|
||
|
|
}
|
||
|
|
|
||
|
|
@inproceedings{88838,
|
||
|
|
author = {Muralikrishna, M.},
|
||
|
|
title = {Optimization and dataflow algorithms for nested tree queries},
|
||
|
|
booktitle = {VLDB '89: Proceedings of the 15th international conference on Very large data bases},
|
||
|
|
year = {1989},
|
||
|
|
isbn = {1-55860-101-5},
|
||
|
|
pages = {77--85},
|
||
|
|
location = {Amsterdam, The Netherlands},
|
||
|
|
publisher = {Morgan Kaufmann Publishers Inc.},
|
||
|
|
address = {San Francisco, CA, USA},
|
||
|
|
}
|
||
|
|
|
||
|
|
@inproceedings{1066180,
|
||
|
|
author = {Cao, Bin and Badia, Antonio},
|
||
|
|
title = {A nested relational approach to processing SQL subqueries},
|
||
|
|
booktitle = {SIGMOD '05: Proceedings of the 2005 ACM SIGMOD international conference on Management of data},
|
||
|
|
year = {2005},
|
||
|
|
isbn = {1-59593-060-4},
|
||
|
|
pages = {191--202},
|
||
|
|
location = {Baltimore, Maryland},
|
||
|
|
doi = {http://doi.acm.org/10.1145/1066157.1066180},
|
||
|
|
publisher = {ACM},
|
||
|
|
address = {New York, NY, USA},
|
||
|
|
}
|
||
|
|
|
||
|
|
@inproceedings{375748,
|
||
|
|
author = {Galindo-Legaria, C\'esar and Joshi, Milind},
|
||
|
|
title = {Orthogonal optimization of subqueries and aggregation},
|
||
|
|
booktitle = {SIGMOD '01: Proceedings of the 2001 ACM SIGMOD international conference on Management of data},
|
||
|
|
year = {2001},
|
||
|
|
isbn = {1-58113-332-4},
|
||
|
|
pages = {571--581},
|
||
|
|
location = {Santa Barbara, California, United States},
|
||
|
|
doi = {http://doi.acm.org/10.1145/375663.375748},
|
||
|
|
publisher = {ACM},
|
||
|
|
address = {New York, NY, USA},
|
||
|
|
}
|
||
|
|
|
||
|
|
@book{DBLP:books/mg/SilberschatzKS01,
|
||
|
|
author = {Abraham Silberschatz and
|
||
|
|
Henry F. Korth and
|
||
|
|
S. Sudarshan},
|
||
|
|
title = {Database System Concepts, 4th Edition},
|
||
|
|
publisher = {McGraw-Hill Book Company},
|
||
|
|
year = {2001},
|
||
|
|
isbn = {0-07-228363-7},
|
||
|
|
bibsource = {DBLP, http://dblp.uni-trier.de}
|
||
|
|
}
|
||
|
|
|
||
|
|
@book{DBLP:books/aw/Date95,
|
||
|
|
author = {C. J. Date},
|
||
|
|
title = {An Introduction to Database Systems, 6th Edition},
|
||
|
|
publisher = {Addison-Wesley},
|
||
|
|
year = {1995},
|
||
|
|
isbn = {0-201-82458-2},
|
||
|
|
bibsource = {DBLP, http://dblp.uni-trier.de}
|
||
|
|
}
|
||
|
|
|
||
|
|
@book{DBLP:books/sp/ClocksinM03,
|
||
|
|
author = {W. F. Clocksin and
|
||
|
|
Chris Mellish},
|
||
|
|
title = {Programming in Prolog, 5th Edition},
|
||
|
|
publisher = {Springer},
|
||
|
|
year = {2003},
|
||
|
|
isbn = {3-540-00678-8},
|
||
|
|
bibsource = {DBLP, http://dblp.uni-trier.de}
|
||
|
|
}
|
||
|
|
|
||
|
|
@book{270040,
|
||
|
|
author = {Clocksin, William F.},
|
||
|
|
title = {Clause and effect: Prolog programming for the working programmer},
|
||
|
|
year = {1997},
|
||
|
|
isbn = {3-540-62971-8},
|
||
|
|
publisher = {Springer-Verlag New York, Inc.},
|
||
|
|
address = {Secaucus, NJ, USA},
|
||
|
|
}
|
||
|
|
|
||
|
|
@article{DBLP:journals/tods/WongY76,
|
||
|
|
author = {Eugene Wong and
|
||
|
|
Karel Youssefi},
|
||
|
|
title = {Decomposition - A Strategy for Query Processing},
|
||
|
|
journal = {ACM Trans. Database Syst.},
|
||
|
|
volume = {1},
|
||
|
|
number = {3},
|
||
|
|
year = {1976},
|
||
|
|
pages = {223-241},
|
||
|
|
ee = {http://doi.acm.org/10.1145/320473.320479, db/journals/tods/WongY76.html},
|
||
|
|
bibsource = {DBLP, http://dblp.uni-trier.de}
|
||
|
|
}
|
||
|
|
|
||
|
|
@inproceedings{671658,
|
||
|
|
author = {B{\"u}ltzingsloewen, G{\"u}nter von},
|
||
|
|
title = {Translating and Optimizing SQL Queries Having Aggregates},
|
||
|
|
booktitle = {VLDB '87: Proceedings of the 13th International Conference on Very Large Data Bases},
|
||
|
|
year = {1987},
|
||
|
|
isbn = {0-934613-46-X},
|
||
|
|
pages = {235--243},
|
||
|
|
publisher = {Morgan Kaufmann Publishers Inc.},
|
||
|
|
address = {San Francisco, CA, USA},
|
||
|
|
}
|
||
|
|
|
||
|
|
@article{276309,
|
||
|
|
author = {Rao, Jun and Ross, Kenneth A.},
|
||
|
|
title = {Reusing invariants: a new strategy for correlated queries},
|
||
|
|
journal = {SIGMOD Rec.},
|
||
|
|
volume = {27},
|
||
|
|
number = {2},
|
||
|
|
year = {1998},
|
||
|
|
issn = {0163-5808},
|
||
|
|
pages = {37--48},
|
||
|
|
doi = {http://doi.acm.org/10.1145/276305.276309},
|
||
|
|
publisher = {ACM},
|
||
|
|
address = {New York, NY, USA},
|
||
|
|
}
|
||
|
|
|
||
|
|
@inproceedings{1247598,
|
||
|
|
author = {Elhemali, Mostafa and Galindo-Legaria, C\'{e}sar A. and Grabs, Torsten and Joshi, Milind M.},
|
||
|
|
title = {Execution strategies for SQL subqueries},
|
||
|
|
booktitle = {SIGMOD '07: Proceedings of the 2007 ACM SIGMOD international conference on Management of data},
|
||
|
|
year = {2007},
|
||
|
|
isbn = {978-1-59593-686-8},
|
||
|
|
pages = {993--1004},
|
||
|
|
location = {Beijing, China},
|
||
|
|
doi = {http://doi.acm.org/10.1145/1247480.1247598},
|
||
|
|
publisher = {ACM},
|
||
|
|
address = {New York, NY, USA},
|
||
|
|
}
|
||
|
|
|
||
|
|
@misc{TPC-D,
|
||
|
|
author = "{Transaction Processing Performance Council (TPC)}",
|
||
|
|
title = "TPC BENCHMARK\texttrademark D",
|
||
|
|
year = "1998",
|
||
|
|
howpublished = "\url{http://www.tpc.org/tpcd/spec/tpcd_current.pdf}",
|
||
|
|
note = "[Online; accessed 31-January-2009]"
|
||
|
|
}
|
||
|
|
|
||
|
|
@Book{ISO:1992:IITa,
|
||
|
|
author = "{ISO}",
|
||
|
|
title = "{ISO\slash IEC} 9075:1992: Title: Information
|
||
|
|
technology --- Database languages --- {SQL}",
|
||
|
|
publisher = "International Organization for Standardization",
|
||
|
|
address = "Geneva, Switzerland",
|
||
|
|
pages = "587",
|
||
|
|
year = "1992",
|
||
|
|
ISBN = "????",
|
||
|
|
ISBN-13 = "????",
|
||
|
|
LCCN = "????",
|
||
|
|
bibdate = "Wed Jul 01 11:02:07 1998",
|
||
|
|
note = "Available in English only.",
|
||
|
|
price = "CHF 348",
|
||
|
|
URL = "http://www.iso.org/iso/iso_catalogue/catalogue_tc/catalogue_detail.htm?csnumber=16663",
|
||
|
|
}
|