[jira] [Updated] (CASSANDRA-7065) Add some extra metadata in leveled manifest to be able to reduce the amount of sstables searched on read path
[ https://issues.apache.org/jira/browse/CASSANDRA-7065?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ] C. Scott Andreas updated CASSANDRA-7065: Component/s: Local Write-Read Paths > Add some extra metadata in leveled manifest to be able to reduce the amount > of sstables searched on read path > - > > Key: CASSANDRA-7065 > URL: https://issues.apache.org/jira/browse/CASSANDRA-7065 > Project: Cassandra > Issue Type: Improvement > Components: Local Write-Read Paths >Reporter: Marcus Eriksson >Priority: Major > Labels: lcs > > Based on this; > http://rocksdb.org/blog/431/indexing-sst-files-for-better-lookup-performance/ > By keeping pointers from the sstables in lower to higher levels we could > reduce the number of candidates in higher levels, ie, instead of searching > all 1000 L3 sstables, we use the information from the L2 search to include > less L3 sstables. > First we need to figure out if this can beat our IntervalTree approach (and > if the win is worth it). -- This message was sent by Atlassian JIRA (v7.6.3#76005) - To unsubscribe, e-mail: commits-unsubscr...@cassandra.apache.org For additional commands, e-mail: commits-h...@cassandra.apache.org
[jira] [Updated] (CASSANDRA-7065) Add some extra metadata in leveled manifest to be able to reduce the amount of sstables searched on read path
[ https://issues.apache.org/jira/browse/CASSANDRA-7065?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ] Wei Deng updated CASSANDRA-7065: Labels: lcs (was: ) > Add some extra metadata in leveled manifest to be able to reduce the amount > of sstables searched on read path > - > > Key: CASSANDRA-7065 > URL: https://issues.apache.org/jira/browse/CASSANDRA-7065 > Project: Cassandra > Issue Type: Improvement >Reporter: Marcus Eriksson > Labels: lcs > > Based on this; > http://rocksdb.org/blog/431/indexing-sst-files-for-better-lookup-performance/ > By keeping pointers from the sstables in lower to higher levels we could > reduce the number of candidates in higher levels, ie, instead of searching > all 1000 L3 sstables, we use the information from the L2 search to include > less L3 sstables. > First we need to figure out if this can beat our IntervalTree approach (and > if the win is worth it). -- This message was sent by Atlassian JIRA (v6.3.4#6332)
