Abstract
Query refinement techniques enable database systems to automatically adjust a submitted query so that its result satisfies some specified constraints. While current techniques are fairly successful in generating refined queries based on cardinality constraints, they are rather oblivious to the (dis)similarity between the input query and its corresponding refined version. Meanwhile, enforcing a similarity-aware query refinement is a rather challenging task as it would require an exhaustive examination of the large space of possible query refinements. To address this challenge, we propose a novel scheme for efficient Similarity-aware Query Refinement (SAQR). SAQR aims to balance the tradeoff between satisfying the cardinality and similarity constraints imposed on the refined query so that to maximize its overall benefit to the user. To achieve that goal, SAQR implements efficient strategies to minimize the costs incurred in exploring the available search space. In particular, SAQR utilizes both similarity-based and cardinality-based pruning techniques to bound the search space and quickly find a refined query that meets the user expectations. Our experimental evaluation shows the scalability exhibited by SAQR under various workload settings, and the significant benefits it provides.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aref, W.G., Samet, H.: Efficient processing of window queries in the pyramid data structure. In: PODS (1990)
Bruno, N., Chaudhuri, S., Thomas, D.: Generating queries with cardinality constraints for dbms testing. IEEE Trans. Knowl. Data Eng. 18(12), 1721–1725 (2006)
Chaudhuri, S., Narasayya, V.: Program for generating skewed data distributions for tpc-d, ftp://ftp.research.microsoft.com/users/surajitc/TPCDSkew/
Fagin, R., et al.: Optimal aggregation algorithms for middleware. In: PODS (2001)
Ilyas, I.F., Beskales, G., Soliman, M.A.: A survey of top-k query processing techniques in relational database systems. ACM Comput. Surv. 40(4) (2008)
Kadlag, A., Wanjari, A.V., Freire, J.-L., Haritsa, J.R.: Supporting exploratory queries in databases. In: Lee, Y., Li, J., Whang, K.-Y., Lee, D. (eds.) DASFAA 2004. LNCS, vol. 2973, pp. 594–605. Springer, Heidelberg (2004)
Koudas, N., et al.: Relaxing join and selection queries. In: VLDB (2006)
Levandoski, J.J., et al.: Lars: A location-aware recommender system. In: ICDE (2012)
Marian, A., Bruno, N., Gravano, L.: Evaluating top-k queries over web-accessible databases. ACM Trans. Database Syst. 29(2), 319–362 (2004)
Mishra, C., et al.: Generating targeted queries for database testing. In: SIGMOD (2008)
Mishra, C., Koudas, N.: Interactive query refinement. In: EDBT (2009)
Muslea, I.: Machine learning for online query relaxation. In: KDD (2004)
Pan, L., et al.: Probing queries in wireless sensor networks. In: ICDCS (2008)
Tao, Y., Xiao, X., Pei, J.: Efficient skyline and top-k retrieval in subspaces. IEEE Trans. Knowl. Data Eng. 19(8), 1072–1088 (2007)
Tran, Q.T., et al.: How to conquer why-not questions. In: SIGMOD (2010)
Vartak, M., Raghavan, V., Rundensteiner, E.A.: Qrelx: generating meaningful queries that provide cardinality assurance. In: SIGMOD Conference (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Albarrak, A., Sharaf, M.A., Zhou, X. (2014). SAQR: An Efficient Scheme for Similarity-Aware Query Refinement. In: Bhowmick, S.S., Dyreson, C.E., Jensen, C.S., Lee, M.L., Muliantara, A., Thalheim, B. (eds) Database Systems for Advanced Applications. DASFAA 2014. Lecture Notes in Computer Science, vol 8421. Springer, Cham. https://doi.org/10.1007/978-3-319-05810-8_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-05810-8_8
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-05809-2
Online ISBN: 978-3-319-05810-8
eBook Packages: Computer ScienceComputer Science (R0)