{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T05:07:50Z","timestamp":1735708070051,"version":"3.32.0"},"reference-count":16,"publisher":"Association for Computing Machinery (ACM)","issue":"12","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2024,8]]},"abstract":"<jats:p>Progressive query processing enables data scientists to efficiently analyze and explore large datasets. Data scientists can start further analyses earlier if the progressive result can represent the complete results well. Most progressive processing frameworks carefully control which parts of the input to process in order to improve the quality of progressive results. The input control strategies work well when the data are processed uniformly. However, the progressive results will be biased towards the join keys if the processed data are not uniform. A recently proposed input&amp;output framework named QPJ corrects the bias by temporarily hiding some results. The framework dynamically estimates the distribution of the complete result and outputs progressive results with a similar distribution to the estimated complete result. This demo presents QPJVis, which is a progressive query processing system designed to inherently process the progressive queries using the QPJ framework. Additionally, we also implement an input control framework, Prism, in QPJVis so that users can compare the difference between the input&amp;output framework and a purely input framework.<\/jats:p>","DOI":"10.14778\/3685800.3685871","type":"journal-article","created":{"date-parts":[[2024,11,8]],"date-time":"2024-11-08T17:25:21Z","timestamp":1731086721000},"page":"4345-4348","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["QPJVis Demo: Quality-Boost Progressive Join Query Processing System"],"prefix":"10.14778","volume":"17","author":[{"given":"Xin","family":"Zhang","sequence":"first","affiliation":[{"name":"University of California, Riverside, Riverside, USA"}]},{"given":"Ahmed","family":"Eldawy","sequence":"additional","affiliation":[{"name":"University of California, Riverside, Riverside, USA"}]}],"member":"320","published-online":{"date-parts":[[2024,11,8]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Ning An et al. 2001. Selectivity estimation for spatial joins. In ICDE. 368--375.","key":"e_1_2_1_1_1","DOI":"10.1109\/ICDE.2001.914849"},{"key":"e_1_2_1_2_1","volume-title":"VLDB","volume":"98","author":"Lars","unstructured":"Lars Arge et al. 1998. Scalable sweeping-based spatial join. In VLDB, Vol. 98. Citeseer, 570--581."},{"key":"e_1_2_1_3_1","volume-title":"Marviq: Quality-Aware Geospatial Visualization of Range-Selection Queries Using Materialization. In SIGMOD. 67--82.","author":"Liming Dong","year":"2020","unstructured":"Liming Dong et al. 2020. Marviq: Quality-Aware Geospatial Visualization of Range-Selection Queries Using Materialization. In SIGMOD. 67--82."},{"key":"e_1_2_1_4_1","first-page":"14","article-title":"2013. Scalable progressive analytics on big data in the cloud","volume":"6","author":"Chandramouli Badrish","year":"2013","unstructured":"Chandramouli Badrish et al. 2013. Scalable progressive analytics on big data in the cloud. PVLDB 6, 14 (2013), 1726--1737.","journal-title":"PVLDB"},{"unstructured":"Ding Mengsu et al. 2021. Progressive Join Algorithms Considering User Preference.. In CIDR.","key":"e_1_2_1_5_1"},{"doi-asserted-by":"crossref","unstructured":"Moritz Dominik et al. 2017. Trust but verify: Optimistic visualizations of approximate queries for exploring big data. In CHI. 2904--2915.","key":"e_1_2_1_6_1","DOI":"10.1145\/3025453.3025456"},{"key":"e_1_2_1_7_1","volume-title":"Informatics","volume":"6","author":"Procopio","unstructured":"Procopio Marianne et al. 2019. Selective wander join: Fast progressive visualizations for data joins. In Informatics, Vol. 6. MDPI, 14."},{"doi-asserted-by":"crossref","unstructured":"Wee Hyong Tok et al. 2008. A stratified approach to progressive approximate joins. In EDBT. 582--593.","key":"e_1_2_1_8_1","DOI":"10.1145\/1353343.1353414"},{"doi-asserted-by":"crossref","unstructured":"Zhao Zhuoyue et al. 2020. Efficient join synopsis maintenance for data warehouse. In SIGMOD. 2027--2042.","key":"e_1_2_1_9_1","DOI":"10.1145\/3318464.3389717"},{"unstructured":"Hector Garcia-Molina. 2008. Database systems: the complete book. Pearson Education India.","key":"e_1_2_1_10_1"},{"doi-asserted-by":"crossref","unstructured":"Oje Kwon and Ki-Joune Li. 2011. Progressive spatial join for polygon data stream. In SIGSPATIAL. 389--392.","key":"e_1_2_1_11_1","DOI":"10.1145\/2093973.2094030"},{"key":"e_1_2_1_12_1","first-page":"9","article-title":"2021. Impact of cognitive biases on progressive visualization","volume":"28","author":"Marianne Procopio","year":"2021","unstructured":"Marianne Procopio et al. 2021. Impact of cognitive biases on progressive visualization. TVCG 28, 9 (2021), 3093--3112.","journal-title":"TVCG"},{"key":"e_1_2_1_13_1","first-page":"11","article-title":"2017. I've seen\" enough\" incrementally improving visualizations to support rapid decision making","volume":"10","author":"Rahman Sajjadur","year":"2017","unstructured":"Rahman Sajjadur et al. 2017. I've seen\" enough\" incrementally improving visualizations to support rapid decision making. PVLDB 10, 11 (2017), 1262--1273.","journal-title":"PVLDB"},{"unstructured":"The OpenLayers Dev Team. 2006. OpenLayers. https:\/\/openlayers.org","key":"e_1_2_1_14_1"},{"volume-title":"Advanced Query Processing: Volume 1: Issues and Trends","author":"Tok Wee Hyong","unstructured":"Wee Hyong Tok and St\u00e9phane Bressan. 2013. Progressive and approximate join algorithms on data streams. In Advanced Query Processing: Volume 1: Issues and Trends. Springer, 157--185.","key":"e_1_2_1_15_1"},{"doi-asserted-by":"crossref","unstructured":"Xin Zhang and Ahmed Eldawy. 2023. Less is More: How Fewer Results Improve Progressive Join Query Processing. In SSDBM. 1--12.","key":"e_1_2_1_16_1","DOI":"10.1145\/3603719.3603728"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3685800.3685871","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T05:25:50Z","timestamp":1735622750000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3685800.3685871"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8]]},"references-count":16,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["10.14778\/3685800.3685871"],"URL":"https:\/\/doi.org\/10.14778\/3685800.3685871","relation":{},"ISSN":["2150-8097"],"issn-type":[{"type":"print","value":"2150-8097"}],"subject":[],"published":{"date-parts":[[2024,8]]},"assertion":[{"value":"2024-11-08","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}