| 
|
Quote: time-split B-trees are space and time efficient; the fraction of redundant records is bounded
topics >
all references >
references i-l >
Topic:
b-trees
Topic:
external search and sort
Topic:
temporal database
Quotation Skeleton
Our paper [SIGMOD '90, 353-363] describes several split polices and … bounded. This means that space for all policies … a random probe [for M record versions]. And finally, the cost … both O(N) because of the clustering of records … Google-1 Google-2
Copyright clearance needed for quotation.
Topic: b-trees (16 items)
Topic: external search and sort (23 items)
Topic: temporal database (23 items)