Abstract
We give the first fully compressed representation of a set of m points on an n ×n grid, taking H + o(H) bits of space, where H = lg ( mn2) is the entropy of the set. This representation supports range counting, range reporting, and point selection queries, with a performance that is comparable to that of uncompressed structures and that improves upon the only previous compressed structure. Operating within entropy-bounded space opens a new line of research on an otherwise well-studied area, and is becoming extremely important for handling large datasets. © 2010 Springer-Verlag.
Cite
CITATION STYLE
Farzan, A., Gagie, T., & Navarro, G. (2010). Entropy-bounded representation of point grids. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6507 LNCS, pp. 327–338). https://doi.org/10.1007/978-3-642-17514-5_28
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
