Please use this identifier to cite or link to this item:
https://doi.org/10.1145/2247596.2247626
DC Field | Value | |
---|---|---|
dc.title | Efficient approximation of the maximal preference scores by lightweight cubic views | |
dc.contributor.author | Chen, Y. | |
dc.contributor.author | Cui, B. | |
dc.contributor.author | Du, X. | |
dc.contributor.author | Tung, A.K.H. | |
dc.date.accessioned | 2013-07-04T08:39:08Z | |
dc.date.available | 2013-07-04T08:39:08Z | |
dc.date.issued | 2012 | |
dc.identifier.citation | Chen, Y.,Cui, B.,Du, X.,Tung, A.K.H. (2012). Efficient approximation of the maximal preference scores by lightweight cubic views. ACM International Conference Proceeding Series : 240-251. ScholarBank@NUS Repository. <a href="https://doi.org/10.1145/2247596.2247626" target="_blank">https://doi.org/10.1145/2247596.2247626</a> | |
dc.identifier.isbn | 9781450307901 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/41925 | |
dc.description.abstract | Given a multi-features data set, a best preference query (BPQ) computes the maximal preference score (MPS) that the tuples in the data set can achieve with respect to a preference function. BPQs are very useful in applications where users want to efficiently check whether many individual data sets contain tuples that are of interest to them. Although a BPQ can be naïvely answered by issuing a top-1 query and computing the score from the returned tuple, doing so might require to load a larger number of tuples externally. In this paper, we address the problem of efficient processing BPQs by using lightweight cubic (3-dimensional) views. With these in-memory views, the MPSs of BPQs can be efficiently estimated with an error bound guaranteed, by paying only a small number of I/Os. Extensive experimental results over real-life data sets show that our approximate solution can achieve the efficiency of up to three orders of magnitude compared to exact solutions, with certain accuracy guaranteed. © 2012 ACM. | |
dc.description.uri | http://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1145/2247596.2247626 | |
dc.source | Scopus | |
dc.subject | best preference score | |
dc.subject | materialized views | |
dc.subject | preference query | |
dc.subject | top-k query | |
dc.type | Conference Paper | |
dc.contributor.department | COMPUTER SCIENCE | |
dc.description.doi | 10.1145/2247596.2247626 | |
dc.description.sourcetitle | ACM International Conference Proceeding Series | |
dc.description.page | 240-251 | |
dc.identifier.isiut | NOT_IN_WOS | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.