101 search results - page 5 / 21 » Partitioning techniques for fine-grained indexing |
ICMCS
2005
IEEE
14 years 3 months ago
2005
IEEE
Motivated by the needs for efficient indexing structures adapted to real applications in video database, we present a new indexing structure named Kpyr. In Kpyr, we use a clusteri...
DEXA
2008
Springer
13 years 11 months ago
2008
Springer
Properly-designed bulk-loading techniques are more efficient than the conventional tuple-loading method in constructing a multidimensional index tree for a large data set. Although...
IS
2011
13 years 4 months ago
2011
Metric access methods based on hyperplane partitioning have the advantage, compared to the ballpartitioning-based ones, that regions do not overlap. The price is less flexibility...
COMAD
2008
13 years 11 months ago
2008
Answering aggregate queries like sum, count, min, max over regions containing moving objects is often needed for virtual world applications, real-time monitoring systems, etc. Sin...
VLDB
1994
ACM
14 years 1 months ago
1994
ACM
This paper presents an innovative partitionbased time join strategy for temporal databases where time is represented by time intervals. The proposed method maps time intervals to ...