skip to content
Cracking KD-Tree: The first multidimensional adaptive indexing Preview this item
ClosePreview this item
Checking...

Cracking KD-Tree: The first multidimensional adaptive indexing

Author: Pedro Holanda; Matheus Nerone; Eduardo Almeida; Stefan Manegold
Edition/Format: Book Book : English
Summary:
htmlabstractWorkload-aware physical data access structures are crucial to achieve short response time with (exploratory) data analysis tasks as commonly required for Big Data and Data Science applications. Recently proposed techniques such as automatic index advisers (for a priori known static workloads) and query-driven adaptive incremental indexing (for a priori unknown dynamic workloads) form the state-of-the-art  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Find a copy online

Find a copy in the library

We were unable to get information about libraries that hold this item.

Details

Document Type: Book
All Authors / Contributors: Pedro Holanda; Matheus Nerone; Eduardo Almeida; Stefan Manegold
ISBN: 978-989-758-318-6
Language Note: English
Unique Identifier: 8087041868
Awards:

Abstract:

htmlabstractWorkload-aware physical data access structures are crucial to achieve short response time with (exploratory) data analysis tasks as commonly required for Big Data and Data Science applications. Recently proposed techniques such as automatic index advisers (for a priori known static workloads) and query-driven adaptive incremental indexing (for a priori unknown dynamic workloads) form the state-of-the-art to build single-dimensional indexes for single-attribute query predicates. However, similar techniques for more demanding multi-attribute query predicates, which are vital for any data analysis task, have not been proposed, yet. In this paper, we present our on-going work on a new set of workload-adaptive indexing techniques that focus on creating multidimensional indexes. We present our proof-of-concept, the Cracking KD-Tree, an adaptive indexing approach that generates a KD-Tree based on multidimensional range query predicates. It works by incrementally creating partial multidimensional indexes as a by-product of query processing. The indexes are produced only on those parts of the data that are accessed, and their creation cost is effectively distributed across a stream of queries. Experimental results show that the Cracking KD-Tree is three times faster than creating a full KD-Tree, one order of magnitude faster than executing full scans and two orders of magnitude faster than using uni-dimensional full or adaptive indexes on multiple columns.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


\n\n

Primary Entity<\/h3>\n
<http:\/\/www.worldcat.org\/oclc\/8087041868<\/a>> # Cracking KD-Tree: The first multidimensional adaptive indexing<\/span>\n\u00A0\u00A0\u00A0\u00A0a \nschema:CreativeWork<\/a>, schema:Book<\/a> ;\u00A0\u00A0\u00A0\nlibrary:oclcnum<\/a> \"8087041868<\/span>\" ;\u00A0\u00A0\u00A0\nrdfs:comment<\/a> \"949 $l conferencepaper<\/span>\" ;\u00A0\u00A0\u00A0\nschema:contributor<\/a> <http:\/\/experiment.worldcat.org\/entity\/work\/data\/9083053292#Person\/nerone_matheus<\/a>> ; # Matheus Nerone<\/span>\n\u00A0\u00A0\u00A0\nschema:contributor<\/a> <http:\/\/experiment.worldcat.org\/entity\/work\/data\/9083053292#Person\/almeida_eduardo<\/a>> ; # Eduardo Almeida<\/span>\n\u00A0\u00A0\u00A0\nschema:contributor<\/a> <http:\/\/experiment.worldcat.org\/entity\/work\/data\/9083053292#Person\/manegold_stefan<\/a>> ; # Stefan Manegold<\/span>\n\u00A0\u00A0\u00A0\nschema:creator<\/a> <http:\/\/experiment.worldcat.org\/entity\/work\/data\/9083053292#Person\/holanda_pedro<\/a>> ; # Pedro Holanda<\/span>\n\u00A0\u00A0\u00A0\nschema:description<\/a> \"htmlabstractWorkload-aware physical data access structures are crucial to achieve short response time with (exploratory) data analysis tasks as commonly required for Big Data and Data Science applications. Recently proposed techniques such as automatic index advisers (for a priori known static workloads) and query-driven adaptive incremental indexing (for a priori unknown dynamic workloads) form the state-of-the-art to build single-dimensional indexes for single-attribute query predicates. However, similar techniques for more demanding multi-attribute query predicates, which are vital for any data analysis task, have not been proposed, yet. In this paper, we present our on-going work on a new set of workload-adaptive indexing techniques that focus on creating multidimensional indexes. We present our proof-of-concept, the Cracking KD-Tree<\/i>, an adaptive indexing approach that generates a KD-Tree based on multidimensional range query predicates. It works by incrementally creating partial multidimensional indexes as a by-product of query processing. The indexes are produced only on those parts of the data that are accessed, and their creation cost is effectively distributed across a stream of queries. Experimental results show that the Cracking KD-Tree<\/i> is three times faster than creating a full KD-Tree, one order of magnitude faster than executing full scans and two orders of magnitude faster than using uni-dimensional full or adaptive indexes on multiple columns.<\/span>\" ;\u00A0\u00A0\u00A0\nschema:exampleOfWork<\/a> <http:\/\/worldcat.org\/entity\/work\/id\/9083053292<\/a>> ;\u00A0\u00A0\u00A0\nschema:name<\/a> \"Cracking KD-Tree: The first multidimensional adaptive indexing<\/span>\" ;\u00A0\u00A0\u00A0\nschema:productID<\/a> \"8087041868<\/span>\" ;\u00A0\u00A0\u00A0\nschema:url<\/a> <https:\/\/ir.cwi.nl\/pub\/28273<\/a>> ;\u00A0\u00A0\u00A0\nschema:workExample<\/a> <http:\/\/worldcat.org\/isbn\/978-989-758-318-6<\/a>> ;\u00A0\u00A0\u00A0\nwdrs:describedby<\/a> <http:\/\/www.worldcat.org\/title\/-\/oclc\/8087041868<\/a>> ;\u00A0\u00A0\u00A0\u00A0.\n\n\n<\/div>\n\n

Related Entities<\/h3>\n
<http:\/\/experiment.worldcat.org\/entity\/work\/data\/9083053292#Person\/almeida_eduardo<\/a>> # Eduardo Almeida<\/span>\n\u00A0\u00A0\u00A0\u00A0a \nschema:Person<\/a> ;\u00A0\u00A0\u00A0\nschema:name<\/a> \"Eduardo Almeida<\/span>\" ;\u00A0\u00A0\u00A0\u00A0.\n\n\n<\/div>\n
<http:\/\/experiment.worldcat.org\/entity\/work\/data\/9083053292#Person\/holanda_pedro<\/a>> # Pedro Holanda<\/span>\n\u00A0\u00A0\u00A0\u00A0a \nschema:Person<\/a> ;\u00A0\u00A0\u00A0\nschema:name<\/a> \"Pedro Holanda<\/span>\" ;\u00A0\u00A0\u00A0\u00A0.\n\n\n<\/div>\n
<http:\/\/experiment.worldcat.org\/entity\/work\/data\/9083053292#Person\/manegold_stefan<\/a>> # Stefan Manegold<\/span>\n\u00A0\u00A0\u00A0\u00A0a \nschema:Person<\/a> ;\u00A0\u00A0\u00A0\nschema:name<\/a> \"Stefan Manegold<\/span>\" ;\u00A0\u00A0\u00A0\u00A0.\n\n\n<\/div>\n
<http:\/\/experiment.worldcat.org\/entity\/work\/data\/9083053292#Person\/nerone_matheus<\/a>> # Matheus Nerone<\/span>\n\u00A0\u00A0\u00A0\u00A0a \nschema:Person<\/a> ;\u00A0\u00A0\u00A0\nschema:name<\/a> \"Matheus Nerone<\/span>\" ;\u00A0\u00A0\u00A0\u00A0.\n\n\n<\/div>\n
<http:\/\/worldcat.org\/isbn\/978-989-758-318-6<\/a>>\u00A0\u00A0\u00A0\u00A0a \nschema:ProductModel<\/a> ;\u00A0\u00A0\u00A0\nschema:isbn<\/a> \"978-989-758-318-6<\/span>\" ;\u00A0\u00A0\u00A0\u00A0.\n\n\n<\/div>\n
<http:\/\/www.worldcat.org\/title\/-\/oclc\/8087041868<\/a>>\u00A0\u00A0\u00A0\u00A0a \ngenont:InformationResource<\/a>, genont:ContentTypeGenericResource<\/a> ;\u00A0\u00A0\u00A0\nschema:about<\/a> <http:\/\/www.worldcat.org\/oclc\/8087041868<\/a>> ; # Cracking KD-Tree: The first multidimensional adaptive indexing<\/span>\n\u00A0\u00A0\u00A0\nschema:dateModified<\/a> \"2019-05-20<\/span>\" ;\u00A0\u00A0\u00A0\nvoid:inDataset<\/a> <http:\/\/purl.oclc.org\/dataset\/narcis<\/a>> ;\u00A0\u00A0\u00A0\u00A0.\n\n\n<\/div>\n