Sciweavers

525 search results - page 18 / 105
» On Query Algebras for Probabilistic Databases
Sort
View
ICDE
2009
IEEE
178views Database» more  ICDE 2009»
13 years 5 months ago
Efficient Query Evaluation over Temporally Correlated Probabilistic Streams
Many real world applications such as sensor networks and other monitoring applications naturally generate probabilistic streams that are highly correlated in both time and space. ...
Bhargav Kanagal, Amol Deshpande
PODS
2007
ACM
196views Database» more  PODS 2007»
14 years 7 months ago
On the complexity of managing probabilistic XML data
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
Pierre Senellart, Serge Abiteboul
BNCOD
1997
76views Database» more  BNCOD 1997»
13 years 8 months ago
Query Evaluation in CROQUE - Calculus and Algebra Coincide
With the substantial change of declarative query languages from plain SQL to the so-called \object SQLs", in particular OQL, there has surprisingly been not much change in the...
Torsten Grust, Joachim Kröger, Dieter Gluche,...
VLDB
2006
ACM
124views Database» more  VLDB 2006»
14 years 7 months ago
Query optimization in XML structured-document databases
While the information published in the form of XML-compliant documents keeps fast mounting up, efficient and effective query processing and optimization for XML have now become mor...
Dunren Che, Karl Aberer, M. Tamer Özsu
SEKE
2007
Springer
14 years 1 months ago
Query Processing in Paraconsistent Databases in the Presence of Integrity Constraints
In this paper, we present an approach to query processing for paraconsistent databases in the presence of integrity constraints. Paraconsistent databases are capable of representi...
Navin Viswanath, Rajshekhar Sunderraman