Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
Polytope: an algorithm for efficient feature extraction on hypercubes
by
Leuridan, Mathilde
, Hawkes, James
, Danovaro, Emanuele
, Schultz, Martin
, Quintino, Tiago
, Smart, Simon
in
Algorithms
/ Big Data
/ Boxes
/ Communications Engineering
/ Computational geometry
/ Computational Science and Engineering
/ Computer Science
/ Data
/ Data extraction
/ Data management
/ Data Mining and Knowledge Discovery
/ Data points
/ Data processing
/ Data storage
/ Database Management
/ Datacube
/ Datasets
/ Extraction
/ Feature extraction
/ Geometry
/ Hypercubes
/ Information Storage and Retrieval
/ Mathematical Applications in Computer Science
/ Methods
/ Networks
/ Polygons
/ Polytopes
/ Software
/ Storage
/ Storage systems
2025
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Polytope: an algorithm for efficient feature extraction on hypercubes
by
Leuridan, Mathilde
, Hawkes, James
, Danovaro, Emanuele
, Schultz, Martin
, Quintino, Tiago
, Smart, Simon
in
Algorithms
/ Big Data
/ Boxes
/ Communications Engineering
/ Computational geometry
/ Computational Science and Engineering
/ Computer Science
/ Data
/ Data extraction
/ Data management
/ Data Mining and Knowledge Discovery
/ Data points
/ Data processing
/ Data storage
/ Database Management
/ Datacube
/ Datasets
/ Extraction
/ Feature extraction
/ Geometry
/ Hypercubes
/ Information Storage and Retrieval
/ Mathematical Applications in Computer Science
/ Methods
/ Networks
/ Polygons
/ Polytopes
/ Software
/ Storage
/ Storage systems
2025
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
Polytope: an algorithm for efficient feature extraction on hypercubes
by
Leuridan, Mathilde
, Hawkes, James
, Danovaro, Emanuele
, Schultz, Martin
, Quintino, Tiago
, Smart, Simon
in
Algorithms
/ Big Data
/ Boxes
/ Communications Engineering
/ Computational geometry
/ Computational Science and Engineering
/ Computer Science
/ Data
/ Data extraction
/ Data management
/ Data Mining and Knowledge Discovery
/ Data points
/ Data processing
/ Data storage
/ Database Management
/ Datacube
/ Datasets
/ Extraction
/ Feature extraction
/ Geometry
/ Hypercubes
/ Information Storage and Retrieval
/ Mathematical Applications in Computer Science
/ Methods
/ Networks
/ Polygons
/ Polytopes
/ Software
/ Storage
/ Storage systems
2025
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Polytope: an algorithm for efficient feature extraction on hypercubes
Journal Article
Polytope: an algorithm for efficient feature extraction on hypercubes
2025
Request Book From Autostore
and Choose the Collection Method
Overview
Data extraction algorithms on data hypercubes, or datacubes, are traditionally only capable of cutting boxes of data along the datacube axes. For many use cases however, this returns much more data than users actually need, leading to an unnecessary consumption of I/O resources. In this paper, we propose an alternative feature extraction technique, which carefully computes the indices of data points contained within user-requested shapes. This enables data storage systems to only read and return bytes useful to user applications from the datacube. Our main algorithm is based on high-dimensional computational geometry concepts and operates by successively reducing polytopes down to the points contained within them. We analyse this algorithm in detail before providing results about its performance and scalability. In particular, we show it is possible to achieve data reductions of up to 99% using this algorithm instead of current state of practice data extraction methods, such as meteorological field extractions from ECMWF’s FDB data store, where feature shapes are extracted a posteriori as a post-processing step. As we discuss later on, this novel extraction method will considerably help scale access to large petabyte size data hypercubes in a variety of scientific fields.
Publisher
Springer International Publishing,Springer Nature B.V,SpringerOpen
This website uses cookies to ensure you get the best experience on our website.