Abstract
The wealth of information generated by users interacting with the network and its applications is often under-utilized due to complications in accessing heterogeneous and dynamic data and in retrieving relevant information from sources having possibly unknown formats and structures. Processing complex requests on such information sources is, thus, costly, though not guaranteeing user satisfaction. In such environments, requests are often relaxed and query processing is forced to be adaptive and approximate, either to cope with limited processing resources (QoS-oriented techniques), possibly at the price of sacrificing result quality, or to cope with limited data knowledge and data heterogeneity (QoD-oriented techniques), with the aim of improving the quality of results. While both kinds of approximation techniques have been proposed, most adaptive solutions are QoS-oriented. Additionally, techniques which apply a QoD-oriented approximation in a QoD-oriented adaptive way (called ASAP - Approximate Search with Adaptive Processing - techniques), though demonstrated potentially useful in getting the right compromise between precise and approximate computations, have been largely neglected. In this paper, we first motivate the problem and provide a taxonomy for classifying approximate and adaptive techniques according to the dimensions pointed out above. Then, we show, through some concrete examples, the benefits of using ASAP techniques in two different contexts.
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
Amato, G., Rabitti, F., Savino, P., Zezula, P.: Region Proximity in Metric Spaces and its Use for Approximate Similarity Search. ACM Trans. Inf. Syst. 21(2), 192–227 (2003)
Arasu, A., Babcock, B., Babu, S., Datar, M., Ito, K., Motwani, R., Nishizawa, I., Srivastava, U., Thomas, D., Varma, R., Widom, J.: STREAM: The Stanford Stream Data Manager. IEEE Data Eng. Bull. 26(1), 19–26 (2003)
Arya, S., Mount, D.M., Netanyahu, N.S., Silverman, R., Wu, A.Y.: An Optimal Algorithm for Approximate Nearest Neighbor Searching Fixed Dimensions. J. ACM 45(6), 891–923 (1998)
Babcock, B., Datar, M., Motwani, R.: Load Shedding for Aggregation Queries over Data Streams. In: ICDE, pp. 350–361 (2004)
Babu, S., Srivastava, U., Widom, J.: Exploiting k-Constraints to Reduce Memory Overhead in Continuous Queries over Data Streams. ACM Trans. Database Syst. 29(3), 545–580 (2004)
Belussi, A., Boucelma, O., Catania, B., Lassoued, Y., Podestà, P.: Towards Similarity-Based Topological Query Languages. In: Grust, T., et al. (eds.) EDBT 2006. LNCS, vol. 4254, pp. 675–686. Springer, Heidelberg (2006)
Börzsönyi, S., Kossmann, D., Stocker, K.: The Skyline Operator. In: ICDE, pp. 421–430 (2001)
Catania, B., Guerrini, G.: Towards Adaptively Approximated Search in Distributed Architectures. In: Vakali, A., Jain, L.C. (eds.) New Directions in Web Data Management 1. SCI, vol. 331, pp. 171–212. Springer, Heidelberg (2011)
Catania, B., Guerrini, G.: Approximate queries with adaptive processing. In: Catania, B., Jain, L.C. (eds.) Advanced Query Processing, Volume 1: Issues and Trends. ISRL, vol. 36, pp. 237–269. Springer, Heidelberg (2013)
Catania, B., Guerrini, G., Belussi, A., Mandreoli, F., Martoglia, R., Penzo, W.: Wearable queries: adapting common retrieval needs to data and users. In: 7th International Workshop on Ranking in Databases (co-located with VLDB 2013), DBRank 2013, Riva del Garda, Italy, August 30, p. 7. ACM (2013)
Catania, B., Guerrini, G., Pinto, M.T., Podestà, P.: Towards relaxed selection and join queries over data streams. In: Morzy, T., Härder, T., Wrembel, R. (eds.) ADBIS 2012. LNCS, vol. 7503, pp. 125–138. Springer, Heidelberg (2012)
Catania, B., Guerrini, G., Pomerano, D.: An adaptive approach for processing relaxed continuous queries (in preparation)
Chaudhuri, S., Das, G., Narasayya, V.R.: Optimized Stratified Sampling for Approximate Query Processing. ACM Trans. Database Syst. 32(2), 9 (2007)
Chaudhuri, S., Ganti, V., Kaushik, R.: A Primitive Operator for Similarity Joins in Data Cleaning. In: ICDE, p. 5 (2006)
Ilyas, I.F., Aref, W.G., Elmagarmid, A.K., Elmongui, H.G., Shah, R., Vitter, J.S.: Adaptive Rank-aware Query Optimization in Relational Databases. ACM Trans. Database Syst. 31(4), 1257–1304 (2006)
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)
Koudas, N., Li, C., Tung, A.K.H., Vernica, R.: Relaxing Join and Selection Queries. In: VLDB, pp. 199–210 (2006)
Koudas, N., Srivastava, D.: Approximate Joins: Concepts and Techniques. In: VLDB, p. 1363 (2005)
Lengu, R., Missier, P., Fernandes, A.A.A., Guerrini, G., Mesiti, M.: Time-completeness Trade-offs in Record Linkage using Adaptive Query Processing. In: EDBT, pp. 851–861 (2009)
Marian, A., Amer-Yahia, S., Koudas, N., Srivastava, D.: Adaptive Processing of Top-k Queries in XML. In: ICDE, pp. 162–173 (2005)
Mass, Y., Ramanath, M., Sagiv, Y., Weikum, G.: IQ: The Case for Iterative Querying for Knowledge. In: Proc. of CIDR 2011, pp. 38–44 (2011)
Mishra, C., Koudas, N.: Interactive Query Refinement. In: EDBT, pp. 862–873 (2009)
Motwani, R., Widom, J., Arasu, A., Babcock, B., Babu, S., Datar, M., Manku, G.S., Olston, C., Rosenstein, J., Varma, R.: Query Processing, Approximation, and Resource Management in a Data Stream Management System. In: CIDR (2003)
Olston, C., Jiang, J., Widom, J.: Adaptive Filters for Continuous Queries over Distributed Data Streams. In: SIGMOD Conference, pp. 563–574 (2003)
Papadias, D., Tao, Y., Fu, G., Seeger, B.: Progressive Skyline Computation in Database Systems. ACM Trans. Database Syst. 30(1), 41–82 (2005)
Silva, Y.N., Aref, W.G., Ali, M.H.: The similarity join database operator. In: ICDE, pp. 892–903 (2010)
Spiegel, J., Polyzotis, N.: TuG Synopses for Approximate Query Answering. ACM Trans. Database Syst. 34(1) (2009)
Tatbul, N., Çetintemel, U., Zdonik, S.B., Cherniack, M., Stonebraker, M.: Load Shedding in a Data Stream Manager. In: VLDB, pp. 309–320 (2003)
Zhou, X., Gaugaz, J., Balke, W.-T., Nejdl, W.: Query Relaxation using Malleable Schemas. In: SIGMOD Conference, pp. 545–556 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Catania, B., Guerrini, G. (2015). Adaptively Approximate Techniques in Distributed Architectures. In: Italiano, G.F., Margaria-Steffen, T., Pokorný, J., Quisquater, JJ., Wattenhofer, R. (eds) SOFSEM 2015: Theory and Practice of Computer Science. SOFSEM 2015. Lecture Notes in Computer Science, vol 8939. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-46078-8_7
Download citation
DOI: https://doi.org/10.1007/978-3-662-46078-8_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-46077-1
Online ISBN: 978-3-662-46078-8
eBook Packages: Computer ScienceComputer Science (R0)