Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/14683
DC FieldValue
dc.titleManaging cache for efficient query processing
dc.contributor.authorGOH SHEN TAT
dc.date.accessioned2010-04-08T10:45:42Z
dc.date.available2010-04-08T10:45:42Z
dc.date.issued2005-05-10
dc.identifier.citationGOH SHEN TAT (2005-05-10). Managing cache for efficient query processing. ScholarBank@NUS Repository.
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/14683
dc.description.abstractThis work discusses the opportunities and mechanisms to leverage query processing performance using caches. Our first set of techniques is realized in a centralized multi-user environment where we propose a non-speculative demand-driven caching: Conform-CoD, Scramble-CoD and Integrated-CoD, where the exact cost of investment and the return on investment are known, and the cache is certain to be reused. Also, we further extend the mechanism to exploit pipeline plans. Next, we move into a distributed environment, and explore the caches for assisting query answering. We propose 2 strategies: promotes the reuse of the cache content and improves query answering through recall-routing. Lastly, we propose a cache coherence method to update the caches for a hierarchy of network servers which includes 2 mechanisms: data scoping and delta profiling that work in conjunction with both the eager and lazy update models.
dc.language.isoen
dc.subjectCache-on-Demand, Common Subexpression, Cache Flushing, Query Forwarding, Cache Coherence, Update Propagation
dc.typeThesis
dc.contributor.departmentCOMPUTER SCIENCE
dc.contributor.supervisorTAN KIAN LEE
dc.description.degreePh.D
dc.description.degreeconferredDOCTOR OF PHILOSOPHY
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Ph.D Theses (Open)

Show simple item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
GohST.pdf674.18 kBAdobe PDF

OPEN

NoneView/Download

Google ScholarTM

Check


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