770 search results - page 59 / 154 » An Approach to Querying Multiple Object Databases |
ICDT
1995
ACM
15 years 1 months ago
1995
ACM
Partial information in databases can arise when information from several databases is combined. Even if each database is complete for some \world", the combined databases wil...
SSDBM
2007
IEEE
15 years 4 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...
198
click to vote
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
This demonstration program presents the V*-kNN algorithm, an efficient algorithm to process moving k nearest neighbor queries (MkNN). The V*-kNN algorithm is based on a safe-region...
MMM
2005
Springer
15 years 3 months ago
2005
Springer
The efficient management of complex objects has become an enabling technology for modern multimedia information systems as well as for many novel database applications. Unfortunat...
142
click to vote
SIGMOD
2007
ACM
15 years 10 months ago
2007
ACM
A "sparse" data set typically has hundreds or even thousands of attributes, but most objects have non-null values for only a small number of these attributes. A popular ...