Sciweavers

976 search results - page 65 / 196
» A Framework for Querying Pedigree Data
Sort
View
SIGMOD
2011
ACM
202views Database» more  SIGMOD 2011»
12 years 11 months ago
Sensitivity analysis and explanations for robust query evaluation in probabilistic databases
Probabilistic database systems have successfully established themselves as a tool for managing uncertain data. However, much of the research in this area has focused on efficient...
Bhargav Kanagal, Jian Li, Amol Deshpande
ER
2007
Springer
163views Database» more  ER 2007»
14 years 3 months ago
Know your Limits: Enhanced XML Modeling with Cardinality Constraints
XML Schema supports the specification of occurrence constraints by declaring values for its min/maxOccurs attributes. These constraints are structural in the sense that they rest...
Sebastian Link, Thu Trinh
VLDB
1989
ACM
150views Database» more  VLDB 1989»
14 years 29 days ago
Aggregates in Possibilistic Databases
Fuzzy set theory represents a uniform framework for extending the relational database model to han-, dle imprecision of information found in the real world. None of the existing p...
Elke A. Rundensteiner, Lubomir Bic
CINQ
2004
Springer
180views Database» more  CINQ 2004»
14 years 20 days ago
Interactivity, Scalability and Resource Control for Efficient KDD Support in DBMS
The conflict between resource consumption and query performance in the data mining context often has no satisfactory solution. This not only stands in sharp contrast to the need of...
Matthias Gimbel, Michael Klein, Peter C. Lockemann
VLDB
1989
ACM
104views Database» more  VLDB 1989»
14 years 29 days ago
Gral: An Extensible Relational Database System for Geometric Applications
: We describe the architecture of a relational databasesystem that is extensible by user-defined data types and operations, including relation operations. The central concept is to...
Ralf Hartmut Güting