Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/39098
DC FieldValue
dc.titleOn getting some answers quickly, and perhaps more later
dc.contributor.authorTan, Kian-Lee
dc.contributor.authorGoh, Cheng Hian
dc.contributor.authorOoi, Beng Chin
dc.date.accessioned2013-07-04T07:33:54Z
dc.date.available2013-07-04T07:33:54Z
dc.date.issued1999
dc.identifier.citationTan, Kian-Lee,Goh, Cheng Hian,Ooi, Beng Chin (1999). On getting some answers quickly, and perhaps more later. Proceedings - International Conference on Data Engineering : 32-39. ScholarBank@NUS Repository.
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/39098
dc.description.abstractTraditionally, the answer to a database query is construed to be the set of all tuples that meet the criteria stated. Strict adherence to this notion in query evaluation is however increasingly unsatisfactory because decision makers are more prone to adopting an exploratory strategy for information search which we call 'getting some answers quickly, and perhaps more later.' In this paper, we propose a progressive query processing strategy that exploits this behavior to conserve system resources and to minimize query response time. This is accomplished by the heuristic decomposition of user queries into subqueries that can be evaluated on demand. We also described the architecture of a prototype system that provides a non-intrusive implementation of our approach. Finally, we present experimental results that demonstrate the benefits of the progressive query processing strategy.
dc.sourceScopus
dc.typeArticle
dc.contributor.departmentCOMPUTER SCIENCE
dc.description.sourcetitleProceedings - International Conference on Data Engineering
dc.description.page32-39
dc.description.codenPIDEE
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Page view(s)

90
checked on Jun 11, 2021

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.