Sciweavers

493 search results - page 31 / 99
» Consensus answers for queries over probabilistic databases
Sort
View
EDBTW
2010
Springer
15 years 6 months ago
Updating probabilistic XML
We investigate the complexity of performing updates on probabilistic XML data for various classes of probabilistic XML documents of different succinctness. We consider two elemen...
Evgeny Kharlamov, Werner Nutt, Pierre Senellart
EDBT
2006
ACM
130views Database» more  EDBT 2006»
15 years 11 months ago
Querying and Updating Probabilistic Information in XML
Abstract. We present in this paper a new model for representing probabilistic information in a semi-structured (XML) database, based on the use of probabilistic event variables. Th...
Serge Abiteboul, Pierre Senellart
JIIS
2006
83views more  JIIS 2006»
14 years 11 months ago
Querying a summary of database
For some years, data summarization techniques have been developed to handle the growth of databases. However these techniques are usually not provided with tools for enduserstoeffi...
W. Amenel Voglozin, Guillaume Raschia, Laurent Ugh...
SIGMOD
2004
ACM
107views Database» more  SIGMOD 2004»
15 years 11 months ago
Static Optimization of Conjunctive Queries with Sliding Windows Over Infinite Streams
We define a framework for static optimization of sliding window conjunctive queries over infinite streams. When computational resources are sufficient, we propose that the goal of...
Ahmed Ayad, Jeffrey F. Naughton
SIGMOD
2007
ACM
176views Database» more  SIGMOD 2007»
15 years 11 months ago
URank: formulation and efficient evaluation of top-k queries in uncertain databases
Top-k processing in uncertain databases is semantically and computationally different from traditional top-k processing. The interplay between query scores and data uncertainty ma...
Mohamed A. Soliman, Ihab F. Ilyas, Kevin Chen-Chua...