Engineering compact dynamic data structures and in-memory data mining
Compact and succinct data structures use space that approaches the information-theoretic lower bound on the space that is required to represent the data. In practice, their memory footprint is orders of magnitude smaller than normal data structures and at the same time they are competitive in speed....
Main Author: | Poyias, Andreas |
---|---|
Other Authors: | Raman, Rajeev ; Fung, Stanley |
Published: |
University of Leicester
2018
|
Subjects: | |
Online Access: | https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.745834 |
Similar Items
-
Transaction-filtering data mining and a predictive model for intelligent data management
by: Liao, ChenHan
Published: (2008) -
Data mining for relationships in large datasets
by: Tao, F.
Published: (2003) -
The construction and exploration of attribute-value taxonomies in data mining
by: Yi, Hong-Yan
Published: (2012) -
Mining time-series data using discriminative subsequences
by: Hills, Jonathan F. F.
Published: (2014) -
Mining text and time series data with applications in finance
by: Staines, J.
Published: (2015)