Skip to main content
Conference Proceedings

A history of distribution-sensitive data structures

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2013) 8066 LNCS 133-149
DOI: 10.1007/978-3-642-40273-9_10
5Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Distribution-sensitive data structures attempt to exploit patterns in query distributions in order to allow many sequences of queries execute faster than in traditional data structures. In this paper, we survey the history of such data structures, outline open problems in the area, and offer some new results. © Springer-Verlag 2013.

Cite

CITATION STYLE

APA

Bose, P., Howat, J., & Morin, P. (2013). A history of distribution-sensitive data structures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8066 LNCS, pp. 133–149). Springer Verlag. https://doi.org/10.1007/978-3-642-40273-9_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free