Searching for "Compact B-Trees." – sorted by Relevance.
-
New concurrency control algorithms for accessing and compacting B-trees
- New Concurrency Control Algorithms for Accessing and Compacting B-Trees V. W. Setzer A. Zisman
- Cited by 1 (0 self) – Add To MetaCart
-
Compact O-Complete Trees: A New Method For Searching Large Files
- efficiently emulate the access method defined for 0-complete paginated binary "trie"s with a compact B-tree
- Add To MetaCart
-
Are floorplan representations important in digital design
- in terms of runtime and solution quality. 2.3 B*-tree B*-tree represents a compacted packing by a binary
- Cited by 5 (0 self) – Add To MetaCart
-
Cache Conscious Indexing for Decision-Support in Main Memory
- papers have considered the issue of compact representations of B-tree indexes [CS83, JTR87]. These papers
- Cited by 60 (9 self) – Add To MetaCart
-
Indexing Open Schemas
- Patricias, including Sybase’s Compact B-tree Index in the iAnywhere product [8] and the String B-tree [9
- Add To MetaCart
-
Cache Conscious Indexing for Decision-Support in
- . Some other papers have considered the issue of compact representations of B-tree indexes [CS83, JTR87
- Add To MetaCart
-
The JS Storage Engine
- to represent many indexes compactly. As with B-trees, most of the space of a layered index is needed
- Add To MetaCart
-
VLDB94 Papers
- ] V.W. Setzer and A. Zisman. New Concurrency Control Algorithms for Accessing and Compacting B-Trees
- Add To MetaCart
-
The Google File System
- that. The checkpoint is in a compact B-tree like form that can be directly mapped into memory and used
- Cited by 2 (0 self) – Add To MetaCart

