103 search results - page 4 / 21 » Direct Algorithms for Computing the Transitive Closure of Da... |
CJ
2010
13 years 8 months ago
2010
Abstract. Motivated by research on how topology may be a helpful foundation for building information modeling (BIM), a relational database version of the notions of chain complex a...
ICPR
2008
IEEE
14 years 2 months ago
2008
IEEE
In the past, clusterings combination approaches are based on “flat” clustering algorithms, i.e. algorithms that operate on non-hierarchical clustering schemes. These approache...
VLDB
1993
ACM
13 years 12 months ago
1993
ACM
The enforcement of semantic integrity constraints in data and knowledge bases constitutea a major performance bottleneck. Integrity constraint simplification methods aim at reduci...
ADMA
2005
Springer
13 years 10 months ago
2005
Springer
Efficient discovery of frequent patterns from large databases is an active research area in data mining with broad applications in industry and deep implications in many areas of d...
CIKM
2010
Springer
13 years 6 months ago
2010
Springer
The cost of reachability query computation using traditional algorithms such as depth first search or transitive closure has been found to be prohibitive and unacceptable in mass...