Please use this identifier to cite or link to this item: https://doi.org/10.1145/2424321.2424371
DC FieldValue
dc.titleCaching support for skyline query processing with partially-ordered domains
dc.contributor.authorHsueh, Y.-L.
dc.contributor.authorZimmermann, R.
dc.contributor.authorKu, W.-S.
dc.date.accessioned2013-07-04T08:46:05Z
dc.date.available2013-07-04T08:46:05Z
dc.date.issued2012
dc.identifier.citationHsueh, Y.-L.,Zimmermann, R.,Ku, W.-S. (2012). Caching support for skyline query processing with partially-ordered domains. GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems : 386-389. ScholarBank@NUS Repository. <a href="https://doi.org/10.1145/2424321.2424371" target="_blank">https://doi.org/10.1145/2424321.2424371</a>
dc.identifier.isbn9781450316910
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/42208
dc.description.abstractThe results of skyline queries performed on data sets with partially-ordered domains vary depending on users' preference profiles specified for the partially-ordered domains. Existing work has addressed the issue of handling each individual query with some efficiency. However, processing large volumes of such queries for online applications with low response time is still very challenging. In this paper, we introduce a novel approach, termed CSS, to reduce the latency by caching query results with their unique user preferences. Of paramount importance in this case is that cached queries with compatible preference profiles need to be utilized. For this purpose, we introduce a similarity measure that establishes the level of a relation of a new query to each of the previously cached queries and profiles. The similarity measure allows the cached entries to be effectively ordered according to descending values; hence, query processing can start with the most promising candidates. If a new query is only partially answerable from the cache, the proposed method pursues a second optimization step. The query processor utilizes the partial result sets and augments them by performing less expensive constraint skyline queries guided by constraint violations between different query preference profiles. Extensive experiments are presented to demonstrate the performance and utility of our novel approach. © 2012 Authors.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1145/2424321.2424371
dc.sourceScopus
dc.subjectcaching techniques
dc.subjectskyline query processing over partially-ordered domains
dc.subjectspatiotemporal databases
dc.typeConference Paper
dc.contributor.departmentCOMPUTER SCIENCE
dc.description.doi10.1145/2424321.2424371
dc.description.sourcetitleGIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems
dc.description.page386-389
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.

Google ScholarTM

Check

Altmetric


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