|
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
Apers, P.M.G., Hevner, A.R., Yao, S.B. Optimization Algorithms for Distributed Queries. IEEE Transactions on Software Engineering, Vol 9:1, 1983.
|
 |
2
|
Francois Bancilhon , David Maier , Yehoshua Sagiv , Jeffrey D Ullman, Magic sets and other strange ways to implement logic programs (extended abstract), Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems, p.1-15, March 24-26, 1986, Cambridge, Massachusetts, United States
[doi> 10.1145/6012.15399]
|
 |
3
|
Philip A. Bernstein , Nathan Goodman , Eugene Wong , Christopher L. Reeve , James B. Rothnie, Jr., Query processing in a system for distributed databases (SDD-1), ACM Transactions on Database Systems (TODS), v.6 n.4, p.602-625, Dec. 1981
[doi> 10.1145/319628.319650]
|
| |
4
|
Chaudhuri, S., Shim K. An Overview of Cost-based Optimization of Queries with Aggregates. IEEE DIS Bulletin, Sep. 1995. (Special Issue on Query Processing).
|
| |
5
|
|
| |
6
|
|
 |
7
|
|
| |
8
|
|
| |
9
|
|
 |
10
|
|
 |
11
|
Surajit Chaudhuri , Rajeev Motwani , Vivek Narasayya, Random sampling for histogram construction: how much is enough?, Proceedings of the 1998 ACM SIGMOD international conference on Management of data, p.436-447, June 01-04, 1998, Seattle, Washington, United States
|
| |
12
|
|
| |
13
|
|
 |
14
|
|
 |
15
|
|
 |
16
|
|
| |
17
|
Gassner, P., Lohman, G., Sehiefer, K.B. Query Optimization in the IBM DB2 Family. IEF~ Data Engineering Bulletin, Dee. 1993.
|
| |
18
|
|
 |
19
|
|
 |
20
|
|
| |
21
|
Graefe, G. The Cascades Framework for Query Optimization. In Data Engineering Bulletin. Sept. 1995.
|
 |
22
|
|
| |
23
|
|
| |
24
|
Jim Gray , Adam Bosworth , Andrew Layman , Hamid Pirahesh, Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Total, Proceedings of the Twelfth International Conference on Data Engineering, p.152-159, February 26-March 01, 1996
|
| |
25
|
|
 |
26
|
L. M. Haas , J. C. Freytag , G. M. Lohman , H. Pirahesh, Extensible query processing in starburst, Proceedings of the 1989 ACM SIGMOD international conference on Management of data, p.377-388, June 1989, Portland, Oregon, United States
|
| |
27
|
|
| |
28
|
|
 |
29
|
|
| |
30
|
Hellersteln, J.M, Predicate Migration placement. In Proe. of ACM SIGMOD, Minneapolis, 1994.
|
| |
31
|
|
| |
32
|
Hong, W, Parallel Query Processing Using Shared Memory Multlproeessors and Disk Arrays. Ph.D. Thesis, University of California, Berkeley, 1992.
|
| |
33
|
|
| |
34
|
|
 |
35
|
|
| |
36
|
|
 |
37
|
|
| |
38
|
Lohman, G,, Mohan, C,, Haas, L., Daniels, D., Lindsay, B., Selinger, P,, Wilms, P. Query Processing in R*. In Query Processing in Database Systems. Springer Verlag, 1985.
|
| |
39
|
|
 |
40
|
|
| |
41
|
|
 |
42
|
I. S. Mumick , S. J. Finkelstein , Hamid Pirahesh , Raghu Ramakrishnan, Magic is relevant, Proceedings of the 1990 ACM SIGMOD international conference on Management of data, p.247-258, May 23-26, 1990, Atlantic City, New Jersey, United States
|
 |
43
|
|
| |
44
|
|
| |
45
|
Muralikrishna M., Dewitt D.J. Equi-Depth Histograms for Estimating Selectivity Factors for Multi-Dimensional Queries, Proe. of ACM SIGMOD, Chicago, 1988.
|
| |
46
|
|
| |
47
|
|
 |
48
|
|
 |
49
|
Hamid Pirahesh , Joseph M. Hellerstein , Waqar Hasan, Extensible/rule based query rewrite optimization in Starburst, Proceedings of the 1992 ACM SIGMOD international conference on Management of data, p.39-48, June 02-05, 1992, San Diego, California, United States
|
 |
50
|
Viswanath Poosala , Peter J. Haas , Yannis E. Ioannidis , Eugene J. Shekita, Improved histograms for selectivity estimation of range predicates, Proceedings of the 1996 ACM SIGMOD international conference on Management of data, p.294-305, June 04-06, 1996, Montreal, Quebec, Canada
|
| |
51
|
|
 |
52
|
Viswanath Poosala , Peter J. Haas , Yannis E. Ioannidis , Eugene J. Shekita, Improved histograms for selectivity estimation of range predicates, Proceedings of the 1996 ACM SIGMOD international conference on Management of data, p.294-305, June 04-06, 1996, Montreal, Quebec, Canada
|
 |
53
|
Arnon Rosenthal , Cesar Galindo-Legaria, Query graphs, implementing trees, and freely-reorderable outerjoins, Proceedings of the 1990 ACM SIGMOD international conference on Management of data, p.291-299, May 23-26, 1990, Atlantic City, New Jersey, United States
|
| |
54
|
|
| |
55
|
P. Griffiths Selinger , M. M. Astrahan , D. D. Chamberlin , R. A. Lorie , T. G. Price, Access path selection in a relational database management system, Readings in database systems (3rd ed.), Morgan Kaufmann Publishers Inc., San Francisco, CA, 1998
|
 |
56
|
Praveen Seshadri , Joseph M. Hellerstein , Hamid Pirahesh , T. Y. Cliff Leung , Raghu Ramakrishnan , Divesh Srivastava , Peter J. Stuckey , S. Sudarshan, Cost-based optimization for magic: algebra and implementation, Proceedings of the 1996 ACM SIGMOD international conference on Management of data, p.435-446, June 04-06, 1996, Montreal, Quebec, Canada
|
| |
57
|
Seshadri, P., Pirahesh, H., Leung, T.Y.C. Decorrelating complex queries. In Proe. of the IEEE International Conference on Data Engineering, 1996.
|
 |
58
|
David Simmen , Eugene Shekita , Timothy Malkemus, Fundamental techniques for order optimization, Proceedings of the 1996 ACM SIGMOD international conference on Management of data, p.57-67, June 04-06, 1996, Montreal, Quebec, Canada
|
| |
59
|
|
| |
60
|
|
| |
61
|
|
CITED BY 50
|
|
|
|
|
Yingying Tao , Qiang Zhu , Calisto Zuzarte, Exploiting common subqueries for complex query optimization, Proceedings of the 2002 conference of the Centre for Advanced Studies on Collaborative research, p.12, September 30-October 03, 2002, Toronto, Ontario, Canada
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Yingying Tao , Qiang Zhu , Calisto Zuzarte , Wing Lau, Optimizing large star-schema queries with snowflakes via heuristic-based query rewriting, Proceedings of the 2003 conference of the Centre for Advanced Studies on Collaborative research, p.279-293, October 06-09, 2003, Toronto, Ontario, Canada
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Ruoming Jin , Scott McCallen , Yuri Breitbart , Dave Fuhry , Dong Wang, Estimating the number of frequent itemsets in a large database, Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology, March 24-26, 2009, Saint Petersburg, Russia
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Mihnea Andrei , Xun Cheng , Sudipto Chowdhuri , Curtis Johnson , Edwin Seputis, Ordering, distinctness, aggregation, partitioning and DQP optimization in sybase ASE 15, Proceedings of the 35th SIGMOD international conference on Management of data, June 29-July 02, 2009, Providence, Rhode Island, USA
|
|
|
|
|
|
|
|