Query Aware Determinization of Uncertain Objects RESULT PAPER

Authors

  • Mr. Milind K.Patil Computer Science & Engg., J. T. Mahajan Polytechnic, Faizpur
  • Assistant Prof. Yogesh S. Patil Computer Science & Engg., S.S.G.B.C.O.E.T, Bhusawal
  • H.O.D. & Associate Prof. Dinesh D. Patil Computer Science & Engg., S.S.G.B.C.O.E.T, Bhusawal

Keywords:

Determinization, uncertain data, data quality, query workload, branch and bound algorithm

Abstract

In this paper considers the problem of determinizing probabilistic data to enable such data to be stored in
legacy systems that accept only deterministic input. Probabilistic data may be generated by automated data
analysis/enrichment techniques such as entity resolution, information extraction, and speech processing. The legacy
system may correspond to pre-existing web applications such as Flickr, Picasa, etc. The goal is to generate a
deterministic representation of probabilistic data that optimizes the quality of the end-application built on deterministic
data. We explore such a Determinization problem in the context of two different data processing tasks triggers and
selection queries. We show that approaches such as thresholding or top-1 selection traditionally used for
Determinization lead to suboptimal performance for such applications. Instead, we develop a query-aware strategy and
show its advantages over existing solutions through a comprehensive empirical evaluation over real and synthetic
datasets.

Published

2016-04-25

How to Cite

Query Aware Determinization of Uncertain Objects RESULT PAPER. (2016). International Journal of Advance Engineering and Research Development (IJAERD), 3(4), 132-138. https://www.ijaerd.org/index.php/IJAERD/article/view/1338

Similar Articles

1-10 of 2354

You may also start an advanced similarity search for this article.