265 search results - page 14 / 53 » Tree-width and functional dependencies in databases |
BMCBI
2006
13 years 7 months ago
2006
Background: Existing biological databases support a variety of queries such as keyword or definition search. However, they do not provide any measure of relevance for the instance...
ACSC
2007
IEEE
14 years 2 months ago
2007
IEEE
A common approach in designing relational databases is to start with a universal relation schema, which is then decomposed into multiple subschemas. A good choice of subschemas ca...
FOIKS
2008
Springer
13 years 9 months ago
2008
Springer
We present a method for decomposing a hypergraph with certain regularities into smaller hypergraphs. By applying this to the set of all canonical covers of a given set of functiona...
DEXA
2008
Springer
13 years 9 months ago
2008
Springer
The query performance for tracing tags depends upon the distribution of tag trajectories in the data space. We examine a more efficient representation of tag trajectories by means ...
SPIESR
1997
13 years 9 months ago
1997
This paper presents a formal framework for designing search algorithms which can identify target images by the spatial distribution of color, edge and texture attributes. The fram...