Leaplist: lessons learned in designing tm-supported range queries
We introduce Leaplist, a concurrent data-structure that is tailored to provide linearizable range queries. A lookup in Leaplist takes O (log n) and is comparable to a balanced binary search tree or to a Skiplist. However, in Leaplist, each node holds up-to K immutable key-value pairs, so collecting...
| Autors principals: | , , |
|---|---|
| Altres autors: | |
| Format: | Article |
| Idioma: | en_US |
| Publicat: |
Association for Computing Machinery (ACM)
2014
|
| Accés en línia: | http://hdl.handle.net/1721.1/90890 https://orcid.org/0000-0002-4552-2414 |