Sciweavers

525 search results - page 8 / 105
» On Query Algebras for Probabilistic Databases
Sort
View
WWW
2004
ACM
14 years 8 months ago
A query algebra for xml p2p databases
This paper describes a query algebra for queries over XML p2p databases that provides explicit mechanisms for modeling data dissemination, replication constraints, and for capturi...
Carlo Sartiani
SIGMOD
1993
ACM
140views Database» more  SIGMOD 1993»
13 years 11 months ago
Second-Order Signature: A Tool for Specifying Data Models, Query Processing, and Optimization
Abstract: We propose a framework for the specification of extensible database systems. A particular goal is to implement a software component for parsing and rule-based optimizatio...
Ralf Hartmut Güting
PVLDB
2010
110views more  PVLDB 2010»
13 years 5 months ago
Read-Once Functions and Query Evaluation in Probabilistic Databases
Probabilistic databases hold promise of being a viable means for large-scale uncertainty management, increasingly needed in a number of real world applications domains. However, q...
Prithviraj Sen, Amol Deshpande, Lise Getoor
ICDT
2001
ACM
189views Database» more  ICDT 2001»
13 years 12 months ago
A Semi-monad for Semi-structured Data
This document proposes an algebra for XML Query. The algebra has been submitted to the W3C XML Query Working Group. A novel feature of the algebra is the use of regular-expression ...
Mary F. Fernández, Jérôme Sim&...
ICDE
2009
IEEE
155views Database» more  ICDE 2009»
14 years 2 months ago
SPROUT: Lazy vs. Eager Query Plans for Tuple-Independent Probabilistic Databases
— A paramount challenge in probabilistic databases is the scalable computation of confidences of tuples in query results. This paper introduces an efficient secondary-storage o...
Dan Olteanu, Jiewen Huang, Christoph Koch