Chaitanya Mishra
ABSTRACT
We investigate the problem of refining SQL queries to satisfy cardinality constraints on the query result. This has applications to the many/few answers problems often faced by database users. We formalize the problem of query refinement and propose a framework to support it in a database system. We introduce an interactive model of refinement that incorporates user feedback to best capture user preferences. Our techniques are designed to handle queries having range and equality predicates on numerical and categorical attributes. We present an experimental evaluation of our framework implemented in an open source data manager and demonstrate the feasibility and practical utility of our approach.
- S. Agrawal, S. Chaudhuri, G. Das, and A. Gionis. Automated ranking of database query results. CIDR, 2003.Google Scholar
- S. Börzsönyi, D. Kossmann, and K. Stocker. The skyline operator. ICDE, 2001.Google ScholarDigital Library
- N. Bruno, S. Chaudhuri, and D. Thomas. Generating queries with cardinality constraints for dbms testing. IEEE TKDE, 18(12):1721--1725, 2006. Google ScholarDigital Library
- M. J. Carey and D. Kossmann. On saying "enough already!" in sql. SIGMOD, pages 219--230, 1997. Google ScholarDigital Library
- S. Chaudhuri. Generalization and a framework for query modification. ICDE, 1990. Google ScholarDigital Library
- S. Chaudhuri, N. N. Dalvi, and R. Kaushik. Robust cardinality and cost estimation for skyline operator. ICDE, 2006. Google ScholarDigital Library
- S. Chaudhuri, G. Das, V. Hristidis, and G. Weikum. Probabilistic ranking of database query results. VLDB, 2004. Google ScholarDigital Library
- S. Chaudhuri, R. Motwani, and V. Narasayya. On Random Sampling Over Joins. SIGMOD, 1999. Google ScholarDigital Library
- S. Chaudhuri and V. Narasayya. Program for TPC-D Data generation with skew. ftp://ftp.research.microsoft.com/users/viveknar/tpcdskew.Google Scholar
- W. W. Chu and Q. Chen. A structured approach for cooperative query answering. TKDE, 1994. Google ScholarDigital Library
- R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. JCSS, 66(4):614--656, 2003. Google ScholarDigital Library
- M. Fontoura, V. Josifovski, R. Kumar, C. Olston, A. Tomkins, and S. Vassilvitskii. Relaxation in text search using taxonomies. VLDB, 2008. Google ScholarDigital Library
- P. Godfrey. Skyline cardinality for relational processing. FoIKS, 2004.Google ScholarCross Ref
- P. Haas, J. Naughton, S. Seshadri, and A. Swami. Fixed Precision Estimation Of Join Selectivity. PODS, June 1993. Google ScholarDigital Library
- V. Harinarayan, A. Rajaraman, and J. D. Ullman. Implementing data cubes efficiently. SIGMOD, 1996. Google ScholarDigital Library
- D. Haussler and E. Welzl. Epsilon-nets and simplex range queries. SoCG, 1986. Google ScholarDigital Library
- J. Hershberger, N. Shrivastava, S. Suri, and C. D. Tóth. Adaptive spatial partitioning for multidimensional data streams. Algorithmica, 46(1), 2006. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- I. F. Ilyas, W. G. Aref, and A. K. Elmagarmid. Supporting top-k join queries in relational databases. VLDB, 2003. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- A. Kadlag, A. V. Wanjari, J. Freire, and J. R. Haritsa. Supporting exploratory queries in databases. DASFAA, 2004.Google ScholarCross Ref
- N. Koudas, C. Li, A. K. H. Tung, and R. Vernica. Relaxing join and selection queries. VLDB, 2006. Google ScholarDigital Library
- G. Luo. Efficient detection of empty-result queries. VLDB, 2006. Google ScholarDigital Library
- V. Markl, V. Raman, D. Simmen, G. Lohman, H. Pirahesh, and M. Cilimdzic. Robust Query Processing Through Progressive Optimization. SIGMOD, 2004. Google ScholarDigital Library
- S. Martello and P. Toth. Worst-case analysis of greedy algorithms for the subset-sum problem. Math. Programming, 28(2), 1984.Google Scholar
- C. Mishra, N. Koudas, and C. Zuzarte. Generating targeted queries for database testing. SIGMOD, 2008. Google ScholarDigital Library
- 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.Google ScholarCross Ref
- Interactive query refinement
Recommendations
Short query refinement with query derivation
AIRS'08: Proceedings of the 4th Asia information retrieval conference on Information retrieval technologyIn this paper we present a method for short query refinement. The method includes a query retrieval model that constructs multiple derived queries for the user's query, where derived queries denote a set of queries that are closely related to the query ...
Comments