{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T04:52:55Z","timestamp":1755838375746},"reference-count":32,"publisher":"Association for Computing Machinery (ACM)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2009,8]]},"abstract":"<jats:p>\n            Data approximation is a popular means to support energy-efficient query processing in sensor networks. Conventional data approximation methods require users to specify fixed error bounds\n            <jats:italic>a prior<\/jats:italic>\n            to address the trade-off between result accuracy and energy efficiency of queries. We argue that this can be infeasible and inefficient when, as in many real-world scenarios, users are unable to determine\n            <jats:italic>in advance<\/jats:italic>\n            what error bounds can lead to affordable cost in query processing. We envision \u03b5-\n            <jats:italic>approximate querying (EAQ)<\/jats:italic>\n            to bridge the gap.\n            <jats:italic>EAQ<\/jats:italic>\n            is a uniform data access scheme underlying various queries in sensor networks. It allows users or query executors to incrementally 'refine' previously obtained approximate data to reach arbitrary accuracy.\n            <jats:italic>EAQ<\/jats:italic>\n            not only grants more flexibility to in-network query processing, but also minimizes energy consumption through communicating data upto a\n            <jats:italic>just-sufficient<\/jats:italic>\n            level. To enable the\n            <jats:italic>EAQ<\/jats:italic>\n            scheme, we propose a novel\n            <jats:italic>data shuffling<\/jats:italic>\n            algorithm. The algorithm converts sensed datasets into special representations called\n            <jats:italic>multi-version array (MVA)<\/jats:italic>\n            . From prefixes of\n            <jats:italic>MVA<\/jats:italic>\n            , we can recover approximate versions of the entire dataset, where all individual data items have guaranteed error bounds. The\n            <jats:italic>EAQ<\/jats:italic>\n            scheme supports efficient and flexible processing of various queries including\n            <jats:italic>spatial window<\/jats:italic>\n            query,\n            <jats:italic>value range<\/jats:italic>\n            query, and queries with\n            <jats:italic>QoS<\/jats:italic>\n            constraints. The effectiveness and efficiency of the\n            <jats:italic>EAQ<\/jats:italic>\n            scheme are evaluated in a real sensor network testbed.\n          <\/jats:p>","DOI":"10.14778\/1687627.1687647","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:17:57Z","timestamp":1403612277000},"page":"169-180","source":"Crossref","is-referenced-by-count":8,"title":["Enabling \u03b5-approximate querying in sensor networks"],"prefix":"10.14778","volume":"2","author":[{"given":"Liu","family":"Yu","sequence":"first","affiliation":[{"name":"Harbin Institute of Technology, Harbin, China"}]},{"given":"Jianzhong","family":"Li","sequence":"additional","affiliation":[{"name":"Harbin Institute of Technology, Harbin, China"}]},{"given":"Hong","family":"Gao","sequence":"additional","affiliation":[{"name":"Harbin Institute of Technology, Harbin, China"}]},{"given":"Xiaolin","family":"Fang","sequence":"additional","affiliation":[{"name":"Harbin Institute of Technology, Harbin, China"}]}],"member":"320","published-online":{"date-parts":[[2009,8]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTCSA.2005.47"},{"issue":"4","key":"e_1_2_1_2_1","first-page":"3","article-title":"The New Jersey data reduction report","volume":"20","author":"Barbar\u00e1 D.","year":"1997","journal-title":"IEEE Data Engineering Bulletin"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/11776178_22"},{"key":"e_1_2_1_4_1","first-page":"111","volume-title":"Intl. Conf. on Very Large Data Bases (VLDB)","author":"Chakrabarti K.","year":"2000"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.21"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2007.143"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007628"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24741-8_38"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2005.63"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1316689.1316741"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.3138\/FM57-6770-U75U-7727"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559926"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1114244.1114246"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/984622.984624"},{"issue":"2","key":"e_1_2_1_15_1","first-page":"7","article-title":"Adaptive query processing: Technology in evolution","volume":"23","author":"Hellerstein J. M.","year":"2000","journal-title":"IEEE Data Engineering Bulletin"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253291"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2002.808417"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1218556.1218558"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/373626.373678"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2003.1260811"},{"key":"e_1_2_1_21_1","volume-title":"Introduction to the Design and Analysis of Algorithms: A Strategic Approach","author":"Lee R. C. T.","year":"2005"},{"key":"e_1_2_1_22_1","volume-title":"T2: A second generation OS for embedded sensor networks. Technical report","author":"Levis P.","year":"2005"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/958491.958500"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497488"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/1060289.1060303"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.908985"},{"key":"e_1_2_1_27_1","volume-title":"Intl. Conf. on Distributed Computing Systems (ICDCS)","author":"Siyao C.","year":"2009"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/WISES.2006.329119"},{"key":"e_1_2_1_29_1","first-page":"187","volume-title":"Intl. Conf. on Very Large Data Bases (VLDB)","author":"Subramaniam S.","year":"2006"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1098918.1098925"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/MIC.2006.26"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.119"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/1687627.1687647","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T11:24:42Z","timestamp":1672226682000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/1687627.1687647"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,8]]}},"alternative-id":["10.14778\/1687627.1687647"],"URL":"https:\/\/doi.org\/10.14778\/1687627.1687647","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2009,8]]}}}