Sciweavers

126 search results - page 23 / 26
» The Complexity of Acyclic Conjunctive Queries
Sort
View
DILS
2004
Springer
13 years 11 months ago
Efficient Techniques to Explore and Rank Paths in Life Science Data Sources
Abstract. Life science data sources represent a complex link-driven federation of publicly available Web accessible sources. A fundamental need for scientists today is the ability ...
Zoé Lacroix, Louiqa Raschid, Maria-Esther V...
ALT
2004
Springer
14 years 4 months ago
New Revision Algorithms
A revision algorithm is a learning algorithm that identifies the target concept, starting from an initial concept. Such an algorithm is considered efficient if its complexity (in ...
Judy Goldsmith, Robert H. Sloan, Balázs Sz&...
ADBIS
2004
Springer
115views Database» more  ADBIS 2004»
14 years 27 days ago
Making More Out of an Inconsistent Database
Repairing a database means making the database consistent by applying changes that are as small as possible. Nearly all approaches to repairing have assumed deletions and insertion...
Jef Wijsen
EDBT
2006
ACM
103views Database» more  EDBT 2006»
14 years 7 months ago
Finding Equivalent Rewritings in the Presence of Arithmetic Comparisons
The problem of rewriting queries using views has received significant attention because of its applications in a wide variety of datamanagement problems. For select-project-join SQ...
Foto N. Afrati, Rada Chirkova, Manolis Gergatsouli...
ICDT
2012
ACM
251views Database» more  ICDT 2012»
11 years 10 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich