{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T04:14:01Z","timestamp":1749096841878,"version":"3.41.0"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319444055"},{"type":"electronic","value":"9783319444062"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-44406-2_29","type":"book-chapter","created":{"date-parts":[[2016,8,5]],"date-time":"2016-08-05T13:35:51Z","timestamp":1470404151000},"page":"355-367","source":"Crossref","is-referenced-by-count":4,"title":["Query Similarity for Approximate Query Answering"],"prefix":"10.1007","author":[{"given":"Verena","family":"Kantere","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,6]]},"reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"Fagin, R., Kolaitis, P.G., Miller, R.J., Popa, L.: Data exchange: semantics and query answering. Th. Comput. Sci. 336 (1)","DOI":"10.1016\/j.tcs.2004.10.033"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Lenzerini, M.: Data Integration: a theoretical perspective. In: PODS (2002)","DOI":"10.1145\/543613.543644"},{"key":"29_CR3","unstructured":"Rodr\u00edguez-Gianolli, P., Kementsietsidis, A., Garzetti, M., Kiringa, I., Jiang, L., Masud, M., Miller, R.J., Mylopoulos, J.: Data sharing in the hyperion peer database system. In: VLDB (2005)"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"Duschka, O.M., Genesereth, M.R.: Answering recursive queries using views. In: PODS (1997)","DOI":"10.1145\/263661.263674"},{"key":"29_CR5","unstructured":"Levy, A.Y., Rajaraman, A., Ordille, J.O.: Query-answering algorithms for information agents. In: 13th International Conference on Artificila Intelligence (1996)"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Pottinger, R., Levy, A.: A scalable algorithm for answering queries using views. In: VLDB (2000)","DOI":"10.1007\/s007780100048"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Kantere, V., Orfanoudakis, G., Kementsietsidis, A., Sellis, T.: Query relaxation across heterogeneous data sources. In: ACM CIKM 2015, pp. 473\u2013482","DOI":"10.1145\/2806416.2806529"},{"key":"29_CR8","unstructured":"Batista, G., Monard, M.C.: A study of k-nearest neighbour as an imputation method. In: HIS (2002)"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Poosala, V., Ganti, V.: Fast approximate query answering using precomputed statistics. In: ICDE, p. 252 (1999)","DOI":"10.1109\/ICDE.1999.754932"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Chaudhuri, S., Das, G.: DBXplorer: a system for keyword-based search over relational databases. In: ICDE (2002)","DOI":"10.1145\/564691.564782"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Cohen, W.: Integration of heterogeneous databases without common domains using queries based on textual similarity. In: SIGMOD (1998)","DOI":"10.1145\/276304.276323"},{"issue":"3","key":"29_CR12","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1145\/45945.48027","volume":"6","author":"A Motro","year":"1988","unstructured":"Motro, A.: VAGUE: A user interface to relational databases that permis vague queries. TOIS 6(3), 187\u2013214 (1988)","journal-title":"TOIS"},{"key":"29_CR13","unstructured":"Fuhr, N.: A probabilistic framework for vague queries and imprecise information in databases. In: VLDB (1990)"},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"Kiebling, W., Kostner, G.: Preference SQL - design, implementation, experiences. In: VLDB (2002)","DOI":"10.1016\/B978-155860869-6\/50098-6"},{"key":"29_CR15","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Chaudhuri, S., Das, G., Gionis, A.: Automated ranking of database query results. In: CIDR (2003)","DOI":"10.1016\/B978-012088469-8.50078-4"},{"key":"29_CR16","unstructured":"Ghosh, A., Parikh, J., Sengar, V.S., Haritsa, J.R.: Plan selection based on query clustering. In: Intelligent Information Integration (1999)"},{"key":"29_CR17","doi-asserted-by":"crossref","unstructured":"Chu, W.W., Zhang, G.: Associative query answering via query feature similarity. In: IIS (1997)","DOI":"10.1109\/IIS.1997.645319"},{"key":"29_CR18","doi-asserted-by":"crossref","unstructured":"Potti, N., Patel, J.M.: Daq: a new paradigm for approximate query processing. In: VLDB, vol. 8","DOI":"10.14778\/2777598.2777599"},{"key":"29_CR19","doi-asserted-by":"crossref","unstructured":"Fan, W., Geerts, F., Libkin, L.: On scale independence for querying big data. In: ACM PODS, pp. 51\u201362 (2014)","DOI":"10.1145\/2594538.2594551"},{"issue":"12","key":"29_CR20","first-page":"1231","volume":"7","author":"Y Cao","year":"2014","unstructured":"Cao, Y., Fan, W., Wo, T., Yu, W.: Bounded conjunctive queries. PVLDB 7(12), 1231\u20131242 (2014)","journal-title":"PVLDB"},{"key":"29_CR21","unstructured":"Jagadish, H.V., Koudas, N., Muthukrishnan, S., Poosala, V., Sevcik, K.C., Suel, T.: Optimal histograms with quality guarantees. In: VLDB, pp. 275\u2013286 (1998)"},{"key":"29_CR22","doi-asserted-by":"crossref","unstructured":"Garofalakis, M.N., Gibbons, P.B.: Wavelet synopses with error guarantees. In: ACM SIGMOD, pp. 476\u2013487 (2002)","DOI":"10.1145\/564691.564746"},{"key":"29_CR23","doi-asserted-by":"crossref","unstructured":"Agarwal, S., Milner, H., Kleiner, A., Talwalkar, A., Jordan, M.I., Madden, S., Mozafari, B., Stoica, I.: Knowing when you\u2019re wrong: building fast and reliable approximate query processing systems. In: ACM SIGMOD, pp. 481\u2013492 (2014)","DOI":"10.1145\/2588555.2593667"},{"key":"29_CR24","doi-asserted-by":"crossref","unstructured":"Agarwal, S., Mozafari, B., Panda, A., Milner, H., Madden, S., Stoica, I.: Blinkdb: queries with bounded errors and bounded response times on very large data. In: EuroSys, pp. 29\u201342 (2013)","DOI":"10.1145\/2465351.2465355"},{"issue":"2","key":"29_CR25","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1006\/jcss.1997.1528","volume":"55","author":"S Chaudhuri","year":"1997","unstructured":"Chaudhuri, S., Kolaitis, P.G.: Can datalog be approximated? J. Comput. Syst. Sci. 55(2), 355\u2013369 (1997)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"29_CR26","doi-asserted-by":"crossref","first-page":"1085","DOI":"10.1137\/130911731","volume":"43","author":"P Barcel\u00f3","year":"2014","unstructured":"Barcel\u00f3, P., Libkin, L., Romero, M.: Efficient approximations of conjunctive queries. SIAM J. Comp. 43(3), 1085\u20131130 (2014)","journal-title":"SIAM J. Comp."},{"key":"29_CR27","doi-asserted-by":"crossref","unstructured":"Fink, R., Olteanu, D.: On the optimal approximation of queries using tractable propositional languages. In: ICDT (2011)","DOI":"10.1145\/1938551.1938575"},{"issue":"1","key":"29_CR28","first-page":"264","volume":"3","author":"W Fan","year":"2010","unstructured":"Fan, W., Li, J., Ma, S., Tang, N., Wu, Y., Wu, Y.: Graph pattern matching: From intractable to polynomial time. PVLDB 3(1), 264\u2013275 (2010)","journal-title":"PVLDB"},{"key":"29_CR29","unstructured":"Melnik, S., Garcia-Molina, H., Rahm, E.: Similarity flooding: a versatile graph matching algorithm and its application to schema mathcing. In: ICDE (2002)"},{"issue":"4","key":"29_CR30","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s00778-003-0104-2","volume":"12","author":"A Doan","year":"2003","unstructured":"Doan, A., Madhavan, J., Dhamankar, R., Domingos, P., Halevy, A.: Learning to match ontologies on the semantic web. VLDB J. 12(4), 303\u2013319 (2003)","journal-title":"VLDB J."},{"key":"29_CR31","doi-asserted-by":"publisher","unstructured":"Kantere, V., Tsoumakos, D., Sellis, T., Roussopoulos, N.: GrouPeer: dynamic clustering of P2P databases. In: Information Systems (2008). doi: 10.1016\/j.is.2008.04.002","DOI":"10.1016\/j.is.2008.04.002"},{"key":"29_CR32","doi-asserted-by":"crossref","unstructured":"L\u00edn, V., Vassalos, V., Malakasiotis, P.: Minicount: Efficient rewriting of count-queries using views. In: ICDE, p. 1 (2006)","DOI":"10.1109\/ICDE.2006.95"},{"issue":"3","key":"29_CR33","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/s007780050040","volume":"6","author":"M Steinbrunn","year":"1997","unstructured":"Steinbrunn, M., Moerkotte, G., Kemper, A.: Heuristic and randomized optimization for the join ordering problem. VLDB J. 6(3), 191\u2013208 (1997)","journal-title":"VLDB J."}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44406-2_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T15:23:02Z","timestamp":1749050582000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44406-2_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319444055","9783319444062"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44406-2_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}