6094 search results - page 89 / 1219 » Applications of a Color-Naming Database |
158
click to vote
IMCIM
1995
15 years 7 months ago
1995
Despite the fact that object-oriented database systems (OODBS) have gained potential as promising database technology for non-standard applications such as computer integrated manu...
132
click to vote
SIGMOD
2004
ACM
16 years 4 months ago
2004
ACM
Trees and graphs are widely used to model biological databases. Providing efficient algorithms to support tree-based or graph-based querying is therefore an important issue. In th...
135
click to vote
PODS
2003
ACM
16 years 4 months ago
2003
ACM
Computing frequent itemsets and maximally frequent itemsets in a database are classic problems in data mining. The resource requirements of all extant algorithms for both problems...
126
click to vote
VLDB
2004
ACM
15 years 9 months ago
2004
ACM
We consider the problem of horizontally partitioning a dynamic relation across a large number of disks/nodes by the use of range partitioning. Such partitioning is often desirable...
120
click to vote
DAWAK
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We present an algorithm for mining frequent queries in arbitrary relational databases, over which functional dependencies are assumed. Building upon previous results, we ...