Interactive query refinement

Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology, EDBT'09

Volumn , Issue , 2009, Pages 862-873

  Mishra, Chaitanya ^a   Koudas, Nick ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CARDINALITY CONSTRAINTS; CATEGORICAL ATTRIBUTES; EXPERIMENTAL EVALUATION; INTERACTIVE MODELS; INTERACTIVE QUERIES; OPEN SOURCES; QUERY REFINEMENT; QUERY RESULTS; SQL QUERY; USER FEEDBACK;

DISTRIBUTED COMPUTER SYSTEMS; REFINING;

DATABASE SYSTEMS;

EID: 70349095177     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1516360.1516459     Document Type: Conference Paper

References (27)

1. S. Agrawal, S. Chaudhuri, G. Das, and A. Gionis. Automated ranking of database query results. CIDR, 2003.
2. S. Börzsönyi, D. Kossmann, and K. Stocker. The skyline operator. ICDE, 2001.
3. N. Bruno, S. Chaudhuri, and D. Thomas. Generating queries with cardinality constraints for dbms testing. IEEE TKDE, 18(12):1721-1725, 2006.
4. M. J. Carey and D. Kossmann. On saying "enough already!" in sql. SIGMOD, pages 219-230, 1997.
5. S. Chaudhuri. Generalization and a framework for query modification. ICDE, 1990.
6. S. Chaudhuri, N. N. Dalvi, and R. Kaushik. Robust cardinality and cost estimation for skyline operator. ICDE, 2006.
7. S. Chaudhuri, G. Das, V. Hristidis, and G. Weikum. Probabilistic ranking of database query results. VLDB, 2004.
8. S. Chaudhuri, R. Motwani, and V. Narasayya. On Random Sampling Over Joins. SIGMOD, 1999.
9. S. Chaudhuri and V. Narasayya. Program for TPC-D Data generation with skew. ftp://ftp. research. microsoft. com/users/viveknar/tpcdskew.
10. W. W. Chu and Q. Chen. A structured approach for cooperative query answering. TKDE, 1994.
11. R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. JCSS, 66(4):614-656, 2003.
12. M. Fontoura, V. Josifovski, R. Kumar, C. Olston, A. Tomkins, and S. Vassilvitskii. Relaxation in text search using taxonomies. VLDB, 2008.
13. P. Godfrey. Skyline cardinality for relational processing. Fo IKS, 2004.
14. P. Haas, J. Naughton, S. Seshadri, and A. Swami. Fixed Precision Estimation Of Join Selectivity. PODS, June 1993.
15. V. Harinarayan, A. Rajaraman, and J. D. Ullman. Implementing data cubes efficiently. SIGMOD, 1996.
16. D. Haussler and E. Welzl. Epsilon-nets and simplex range queries. SoCG, 1986.
17. J. Hershberger, N. Shrivastava, S. Suri, and C. D. Tóth. Adaptive spatial partitioning for multidimensional data streams. Algorithrnica, 46(1), 2006.
18. O. H. Ibarra and C. E. Kim. Fast approximation algorithms for the knapsack and sum of subset problems. J. ACM, 22(4):463-468, 1975.
19. I. F. Ilyas, W. G. Aref, and A. K. Elmagarmid. Supporting top-k join queries in relational databases. VLDB, 2003.
20. Y. Ioannidis and S. Christodoulakis. Optimal Histograms for Limiting Worst-Case Error Propagation in the Size of Join Results. ACM Transactions on Database Systems, Vol. 18, No. 4, pages 709-748, Dec. 1993.
21. A. Kadlag, A. V. Wanjari, J. Freire, and J. R. Haritsa. Supporting exploratory queries in databases. DASFAA, 2004.
22. N. Koudas, C. Li, A. K. H. Tung, and R. Vernica. Relaxing join and selection queries. VLDB, 2006.
23. G. Luo. Efficient detection of empty-result queries. VLDB, 2006.
24. V. Markl, V. Raman, D. Simmen, G. Lohman, H. Pirahesh, and M. Cilimdzic. Robust Query Processing Through Progressive Optimization. SIGMOD, 2004.
25. S. Martello and P. Toth. Worst-case analysis of greedy algorithms for the subset-sum problem. Math. Programming, 28(2), 1984.
26. C. Mishra, N. Koudas, and C. Zuzarte. Generating targeted queries for database testing. SIGMOD, 2008.
27. V. N. Vapnik and A. Chervonenkis. On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its Applications, 16(2):264-280, 1971.