Sciweavers

2229 search results - page 85 / 446
» The Case for Grounding Databases
Sort
View
PODS
2006
ACM
104views Database» more  PODS 2006»
16 years 1 months ago
Tractable database design through bounded treewidth
Given that most elementary problems in database design are NP-hard, the currently used database design algorithms produce suboptimal results. For example, the current 3NF decompos...
Georg Gottlob, Reinhard Pichler, Fang Wei
ICDE
2009
IEEE
155views Database» more  ICDE 2009»
15 years 8 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
SDB
1995
91views Database» more  SDB 1995»
15 years 5 months ago
Semantics in Spatial Databases
In this paper we discuss two data models for spatial database systems: the linear data model and the topological data model. Both can be used to model a wide range of applications....
Bart Kuijpers, Jan Paredaens, Luc Vandeurzen
EOR
2006
117views more  EOR 2006»
15 years 1 months ago
Heuristics for selecting robust database structures with dynamic query patterns
The success of a company increasingly depends on timely information (internal or external) being available to the right person at the right time for crucial managerial decision-ma...
Andrew N. K. Chen, Paulo B. Goes, Alok Gupta, Jame...
IS
2008
15 years 1 months ago
The complexity and approximation of fixing numerical attributes in databases under integrity constraints
Consistent query answering is the problem of characterizing and computing the semantically correct answers to queries from a database that may not satisfy certain integrity constr...
Leopoldo E. Bertossi, Loreto Bravo, Enrico Francon...