3319 search results - page 378 / 664 » Type Theoretical Databases |
132
click to vote
ADBIS
2009
Springer
15 years 10 months ago
2009
Springer
The inefficiency of integration processes—as an abstraction of workflow-based integration tasks—is often reasoned by low resource utilization and significant waiting times f...
126
click to vote
ISAAC
2009
Springer
15 years 10 months ago
2009
Springer
Many database systems that use a B+ tree as the underlying data structure do not do rebalancing on deletion. This means that a bad sequence of deletions can create a very unbalance...
143
click to vote
DASFAA
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper, we design a local classification algorithm using implicit link analysis, considering the situation that the labeled and unlabeled data are drawn from two different ...
157
Voted
DASFAA
2007
IEEE
15 years 10 months ago
2007
IEEE
Today, result sets of skyline queries are unmanageable due to their exponential growth with the number of query predicates. In this paper we discuss the incremental re-computation ...
124
click to vote
SSDBM
2007
IEEE
15 years 10 months ago
2007
IEEE
Space-partitioning trees, like the disk-based trie, quadtree, kd-tree and their variants, are a family of access methods that index multi-dimensional objects. In the case of index...