Please use this identifier to cite or link to this item: https://doi.org/10.1016/j.ins.2012.02.004
DC FieldValue
dc.titleEfficient processing of probabilistic set-containment queries on uncertain set-valued data
dc.contributor.authorZhang, X.
dc.contributor.authorChen, K.
dc.contributor.authorShou, L.
dc.contributor.authorChen, G.
dc.contributor.authorGao, Y.
dc.contributor.authorTan, K.-L.
dc.date.accessioned2014-07-04T03:09:29Z
dc.date.available2014-07-04T03:09:29Z
dc.date.issued2012
dc.identifier.citationZhang, X., Chen, K., Shou, L., Chen, G., Gao, Y., Tan, K.-L. (2012). Efficient processing of probabilistic set-containment queries on uncertain set-valued data. Information Sciences 196 : 97-117. ScholarBank@NUS Repository. https://doi.org/10.1016/j.ins.2012.02.004
dc.identifier.issn00200255
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/77849
dc.description.abstractSet-valued data is a natural and concise representation for modeling complex objects. As an important operation of object-oriented or object-relational database, set containment query processing over set-valued data has been extensively studied in previous works. Recently, there is a growing realization that uncertain information is a first-class citizen in modern database management. As such, there is a strong demand for study of set containment queries over uncertain set-valued data. This paper investigates how set-containment queries over uncertain set-valued data can be efficiently processed. Based on the popular possible world semantics, we first present a practical model in which the uncertainty in set-valued data is represented by existential probabilities, and propose the probabilistic set containment semantics and its generalization-the expected Jaccard containment. Second, to avoid expensive computations in enumerating all possible worlds, we develop efficient schemes for computing these two probabilistic semantics. Third, we introduce two important queries, namely probability threshold containment query (PTCQ) and probability threshold containment join (PTCJ), and propose novel techniques to process them efficiently. Finally, we conduct extensive experiments to study the efficiency of the proposed methods. The experimental results indicate that the proposed methods are efficient in processing the uncertain set containment queries. © 2012 Published by Elsevier Inc.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1016/j.ins.2012.02.004
dc.sourceScopus
dc.subjectExpected Jaccard containment
dc.subjectProbabilistic set-containment query/join
dc.subjectSet containment query
dc.subjectUncertain query
dc.subjectUncertain set-valued attributes
dc.subjectUncertain set-valued data
dc.typeArticle
dc.contributor.departmentCOMPUTER SCIENCE
dc.description.doi10.1016/j.ins.2012.02.004
dc.description.sourcetitleInformation Sciences
dc.description.volume196
dc.description.page97-117
dc.description.codenISIJB
dc.identifier.isiut000303093000006
Appears in Collections:Staff Publications

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

SCOPUSTM   
Citations

5
checked on Jan 22, 2020

WEB OF SCIENCETM
Citations

4
checked on Jan 13, 2020

Page view(s)

53
checked on Dec 29, 2019

Google ScholarTM

Check

Altmetric


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