{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/72089"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/72089","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"APPROXIMATE: A Query Processor That Produces Monotonically Improving Approximate Answers","abstract":"For some applications, it may be better for a database to produce an approximate answer when it is not possible to produce an exact answer. We have designed and implemented a query processor, called APPROXIMATE, that makes approximate answers available if part of the database is unavailable or if there is not enough time to produce an exact answer. The accuracy of the approximate answers produced improves monotonically with the amount of data retrieved to produce the result. APPROXIMATE returns the exact answer if all of the needed data are available and if there is enough time to continue with the processing. The latest, best available approximate answer is returned if the user demands an answer before query processing is completed. The approximate query processing algorithm of APPROXIMATE works within a standard relational algebra framework.","abstract_html":"For some applications, it may be better for a database to produce an approximate answer when it is not possible to produce an exact answer. We have designed and implemented a query processor, called APPROXIMATE, that makes approximate answers available if part of the database is unavailable or if there is not enough time to produce an exact answer. The accuracy of the approximate answers produced improves monotonically with the amount of data retrieved to produce the result. APPROXIMATE returns the exact answer if all of the needed data are available and if there is enough time to continue with the processing. The latest, best available approximate answer is returned if the user demands an answer before query processing is completed. The approximate query processing algorithm of APPROXIMATE works within a standard relational algebra framework.","abstract_has_math":false,"creators":["Vrbsky, Susan Vlasta"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Liu, Jane W.S."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2014,"date_issued":"2014-12-17T20:00:42Z","date_published":"2014-12-17T20:00:42Z","updated_at":"2026-07-22T22:26:06Z","subjects":["Computer Science"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(UMI)AAI9329191"],"render_values":[{"text":"(UMI)AAI9329191","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/72089","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Liu, Jane W.S."]},{"key":"dc:creator","label":"Author","values":["Vrbsky, Susan Vlasta"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2014-12-17T20:00:42Z","10000-01-01","1993"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computer Science"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/72089","(UMI)AAI9329191"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["For some applications, it may be better for a database to produce an approximate answer when it is not possible to produce an exact answer. We have designed and implemented a query processor, called APPROXIMATE, that makes approximate answers available if part of the database is unavailable or if there is not enough time to produce an exact answer. The accuracy of the approximate answers produced improves monotonically with the amount of data retrieved to produce the result. APPROXIMATE returns the exact answer if all of the needed data are available and if there is enough time to continue with the processing. The latest, best available approximate answer is returned if the user demands an answer before query processing is completed. The approximate query processing algorithm of APPROXIMATE works within a standard relational algebra framework.","In this thesis, we present the approximation semantics of APPROXIMATE that serves as the basis for meaningful approximations to set-valued and single-valued queries, and the approximate query processing algorithm used by APPROXIMATE. APPROXIMATE uses an object-oriented view of the database. This view provides semantic information about the initial approximations to a query and information about which segments of the database can be retrieved. A distance function is defined to provide additional semantic support needed to compare the accuracies of approximate answers to the exact answer and information about the convergence of approximate answers. We describe the overhead incurred by this semantic support and present an implementation of APPROXIMATE.","Made available in DSpace on 2014-12-17T20:00:42Z (GMT). No. of bitstreams: 1 9329191.pdf: 5553348 bytes, checksum: c67aa3a137b40cf68848a87f3e3e55e7 (MD5) Previous issue date: 1993","Embargo set by: Seth Robbins for item 72257 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","145 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1993."]},{"key":"dc:title","label":"Title","values":["APPROXIMATE: A Query Processor That Produces Monotonically Improving Approximate Answers"]}]}],"canonical_facts":{"dc:contributor":["Liu, Jane W.S."],"dc:creator":["Vrbsky, Susan Vlasta"],"dc:date":["2014-12-17T20:00:42Z","10000-01-01","1993"],"dc:description":["For some applications, it may be better for a database to produce an approximate answer when it is not possible to produce an exact answer. We have designed and implemented a query processor, called APPROXIMATE, that makes approximate answers available if part of the database is unavailable or if there is not enough time to produce an exact answer. The accuracy of the approximate answers produced improves monotonically with the amount of data retrieved to produce the result. APPROXIMATE returns the exact answer if all of the needed data are available and if there is enough time to continue with the processing. The latest, best available approximate answer is returned if the user demands an answer before query processing is completed. The approximate query processing algorithm of APPROXIMATE works within a standard relational algebra framework.","In this thesis, we present the approximation semantics of APPROXIMATE that serves as the basis for meaningful approximations to set-valued and single-valued queries, and the approximate query processing algorithm used by APPROXIMATE. APPROXIMATE uses an object-oriented view of the database. This view provides semantic information about the initial approximations to a query and information about which segments of the database can be retrieved. A distance function is defined to provide additional semantic support needed to compare the accuracies of approximate answers to the exact answer and information about the convergence of approximate answers. We describe the overhead incurred by this semantic support and present an implementation of APPROXIMATE.","Made available in DSpace on 2014-12-17T20:00:42Z (GMT). No. of bitstreams: 1 9329191.pdf: 5553348 bytes, checksum: c67aa3a137b40cf68848a87f3e3e55e7 (MD5) Previous issue date: 1993","Embargo set by: Seth Robbins for item 72257 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","145 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1993."],"dc:identifier":["http://hdl.handle.net/2142/72089","(UMI)AAI9329191"],"dc:subject":["Computer Science"],"dc:title":["APPROXIMATE: A Query Processor That Produces Monotonically Improving Approximate Answers"],"dc:type":["text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:26:06Z"}