Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/39810
DC FieldValueLanguage
dc.contributorDepartment of Computing-
dc.creatorSingh, S-
dc.creatorCheng, R-
dc.creatorXia, Y-
dc.creatorPrabhakar, S-
dc.creatorShah, R-
dc.creatorVitter, JS-
dc.date.accessioned2016-05-11T10:18:08Z-
dc.date.available2016-05-11T10:18:08Z-
dc.identifier.isbn1-59593-433-2-
dc.identifier.urihttp://hdl.handle.net/10397/39810-
dc.language.isoenen_US
dc.subjectImprecise dataen_US
dc.subjectJoinsen_US
dc.subjectUncertainty managementen_US
dc.titleEfficient join processing over uncertain dataen_US
dc.typeConference Paperen_US
dc.identifier.spage738-
dc.identifier.epage747-
dc.identifier.doi10.1145/1183614.1183719-
dcterms.abstractIn many applications data values are inherently uncertain. This includes moving-objects, sensors and biological databases. There has been recent interest in the development of database management systems that can handle uncertain data. Some proposals for such systems include attribute values that are uncertain. In particular, an attribute value can be modeled as a range of possible values, associated with a probability density function. Previous efforts for this type of data have only addressed simple queries such as range and nearest-neighbor queries. Queries that join multiple relations have not been addressed in earlier work despite the significance of joins in databases. In this paper we address join queries over uncertain data. We propose a semantics for the join operation, define probabilistic operators over uncertain data, and propose join algorithms that provide efficient execution of probabilistic joins. The paper focuses on an important class of joins termed probabilistic threshold joins that avoid some of the semantic complexities of dealing with uncertain data. For this class of joins we develop three sets of optimization techniques: item-level, page-level, and index-level pruning. These techniques facilitate pruning with little space and time overhead, and are easily adapted to most join algorithms. We verify the performance of these techniques experimentally.-
dcterms.bibliographicCitationCIKM '06 Proceedings of the 15th ACM International Conference on Information and Knowledge Management, Arlington, USA, November 2006, p. 738-747-
dcterms.issued2006-
dc.relation.conferenceACM International Conference on Information and Knowledge Management [CIKM]-
dc.identifier.rosgroupidr30329-
dc.description.ros2006-2007 > Academic research: refereed > Refereed conference paper-
Appears in Collections:Conference Paper
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

SCOPUSTM   
Citations

72
Last Week
0
Last month
Citations as of Aug 21, 2020

Page view(s)

137
Last Week
0
Last month
Citations as of Oct 26, 2020

Google ScholarTM

Check

Altmetric


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