Name
Abstract | ||
|---|---|---|
We consider matrix index and navigation index approaches to in-memory navigation of persistent object stores. We demonstrate that both approaches can be re-formulated independently from the used coding technique. We expose the limitations of fixed length coding and the inefficiency of simple continued fractions as a variable length coding technique. The conclusion is that alternative variable length coding techniques, possibly based on known compression algorithms, should be explored. The architecture of persistent object stores should permit plugging in and configuring coding algorithms to optimise the operation of a particular system. |
Year | Venue | Keywords |
|---|---|---|
2004 | SBBD | indexation,continued fraction,variable length code,compression algorithm |
Field | DocType | Citations |
Data mining,Architecture,Matrix (mathematics),Computer science,Inefficiency,Coding (social sciences),Coding algorithm,Data compression | Conference | 1 |
PageRank | References | Authors |
0.39 | 14 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Markus Kirchberg | 1 | 495 | 42.65 |
| Klaus-dieter Schewe | 2 | 1367 | 202.78 |
| Alexei Tretiakov | 3 | 114 | 16.92 |
| Alexander Kuckelberg | 4 | 13 | 3.32 |