Abstract
Geospatial array DBMSs handle big georeferenced arrays. Due to the geospatial data peculiarities, many queries have tunable parameters with values not known in advance: users gradually tune them until they get a satisfactory result. This generates a series of queries with slightly different structures and very similar outputs. Modern array DBMSs spend the same efforts to answer each such query. BitFun provides novel bitmap indexing strategies to continuously re-index arrays during queries with similar mathematical functions. It can be up to 8x faster than computing the results from scratch. We describe BitFun and offer lessons on real-world geospatial data, related to real practical tasks. A lesson involves tuning a math function parameter while the rich web GUI details the indexing process and query execution. Conference attendees will appreciate BitFun approaches, its performance, and learn its internals via fascinating lessons.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
