Method and apparatus for query processing of uncertain data

Data processing: database and file management or data structures – Database and file access – Preparing data for information retrieval

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C707S742000

Reexamination Certificate

active

07917517

ABSTRACT:
Techniques are disclosed for indexing uncertain data in query processing systems. For example, a method for processing queries in an application that involves an uncertain data set includes the following steps. A representation of records of the uncertain data set is created based on mean values and uncertainty values. The representation is utilized for processing a query received on the uncertain data set.

REFERENCES:
patent: 6502091 (2002-12-01), Chundi et al.
R. Cheng et al. , “Efficient Indexing Methods for Probablistic Threshold Queries Over Uncertain Data,” VLDB Conference, 2004, pp. 876-887.
C.C. Aggarwal et al., “The IGrid Index: Reversing the Dimensionality Curse in High Dimensional Space,” ACM KDD Conference, 2000, 11 pages.
C.C. Aggarwal, “On Density Based Transforms for Uncertain Data Mining,” IEEE ICDE Conference, 2007, 10 pages.
C.C. Aggarwal et al, “A Survey of Uncertain Data Algorithms and Applications,” IBM Research Report, RC24394, 2007, 40 pages.
D. Barbara et al., “The Management of Probabilistic Data,” IEEE Transactions on Knowledge and Data Engineering, pp. 487-502, 1992, vol. 4, No. 5.
N. Beckmann et al., “The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles,” ACM SIGMOD Conference, 1994, pp. 322-331.
S. Berchtold et al., “The X-Tree: An Index Structure for High Dimensional Data,” VLDB Conference, 1996, 12 pages.
D. Burdick et al., “OLAP Over Uncertain and Imprecise Data,” VLDB Conference, 2005, pp. 970-981.
R. Cheng et al., “Efficient Indexing Methods for Probabilistic Threshold Queries Over Uncertain Data,” VLDB Conference, 2004, pp. 876-887.
R. Cheng et al., “Evaluating Probabilistic Queries over Imprecise Data,” ACM SIGMOD Conference, 2003, 12 pages.
N. Dalvi et al., “Efficient Query Evaluation on Probabilistic Databases,” VLDB Conference, 2004, pp. 864-875.
A. Das Sarma et al., “Working Models for Uncertain Data,” IEEE ICDE Conference, 2006, 21 pages.
A. Hinneburg et al., “What is the Nearest Neighbor in High Dimensional Spaces?,” VLDB Conference, 2000, pp. 506-515.
H.-P. Kriegel et al., “Density-Based Clustering of Uncertain Data,” ACM KDD Conference, 2005, pp. 672-677.
L.V.S Lakshmanan et al., “ProbView: A Flexible Database System,” ACM Transactions on Database Systems, 1997, pp. 419-469, vol. 22, No. 3.
S.I. McClean et al., “Aggregation of Imprecise and Uncertain Information,” IEEE Transactions on Knowledge and Data Engineering, 2001, pp. 902-912, vol. 13, No. 6.
D. Pfozer et al., “Capturing the Uncertainty of Moving Object Representations,” SSDM Conference, 1999, 17 pages.
S. Singh et al., “Indexing Uncertain Categorical Data,” IEEE ICDE Conference, 2007, 10 pages.
Y. Tao et al., “Indexing Multi-dimensional Uncertain Data with Arbitrary Probabality Density Functions,” VLDB Conference, 2005, pp. 922-933.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Method and apparatus for query processing of uncertain data does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method and apparatus for query processing of uncertain data, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for query processing of uncertain data will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2648988

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.