Sciweavers

735 search results - page 15 / 147
» Evaluating Probabilistic Queries over Imprecise Data
Sort
View
PODS
2002
ACM
164views Database» more  PODS 2002»
15 years 11 months ago
Characterizing Memory Requirements for Queries over Continuous Data Streams
We consider conjunctive queries with arithmetic comparisons over multiple continuous data streams. We specify an algorithm for determining whether or not a query can be evaluated ...
Arvind Arasu, Brian Babcock, Shivnath Babu, Jon Mc...
VLDB
2005
ACM
124views Database» more  VLDB 2005»
15 years 5 months ago
Indexing Multi-Dimensional Uncertain Data with Arbitrary Probability Density Functions
In an “uncertain database”, an object o is associated with a multi-dimensional probability density function (pdf), which describes the likelihood that o appears at each positi...
Yufei Tao, Reynold Cheng, Xiaokui Xiao, Wang Kay N...
PODS
1999
ACM
160views Database» more  PODS 1999»
15 years 4 months ago
Queries with Incomplete Answers over Semistructured Data
Semistructured data occur in situations where information lacks a homogeneous structure and is incomplete. Yet, up to now the incompleteness of information has not been re ected b...
Yaron Kanza, Werner Nutt, Yehoshua Sagiv
SSDBM
2009
IEEE
174views Database» more  SSDBM 2009»
15 years 6 months ago
Optimization and Execution of Complex Scientific Queries over Uncorrelated Experimental Data
Scientific experiments produce large volumes of data represented as complex objects that describe independent events such as particle collisions. Scientific analyses can be express...
Ruslan Fomkin, Tore Risch
GVD
2009
125views Database» more  GVD 2009»
14 years 9 months ago
A quantum logic-based query processing approach for extending relational query languages
Evaluating a traditional database query against a data tuple returns a true on match and a false on mismatch. Unfortunately, there are many application scenarios where such an eva...
Sebastian Lehrack