1567 search results - page 41 / 314 » Compressing Relations and Indexes |
BTW
2007
Springer
14 years 3 months ago
2007
Springer
B-tree and index into two layers of abstraction. In addition, this paper provides algorithms for (i) concurrency control and recovery including locking of individual keys and of co...
EDBT
2009
ACM
14 years 1 months ago
2009
ACM
Traditional bitmap indexes are utilized as a special type of primary or clustered indexes where the queries are answered by performing fast logical operations supported by hardwar...
SIGMOD
2009
ACM
14 years 9 months ago
2009
ACM
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...
USENIX
2001
13 years 10 months ago
2001
Stackable file systems can provide extensible file system functionality with minimal performance overhead and development cost. However, previous approaches provide only limited f...
VLDB
2000
ACM
14 years 17 days ago
2000
ACM
Primary B+ -tree, a variant of B+ -tree structure with row data in leaf blocks, is an ideal storage organization for queries involving exact match and/or range search on primary k...