Paper Info
Title
Speeding up Array Query Processing by Just-In-Time Compilation
Abstract
Interpreted languages frequently suffer from higher processing times as compared to compiled approaches. Typically this happens when complex computations are performed. Array DBMSs, which extend database functionality with multidimensional array modeling and query support, find themselves in exactly this situation: queries often involve a large number of operations, and each such operation is applied to a large number of array elements.In this paper, we propose just-in-time compilation as an optimization method for an interpreted array query language. This is achieved by grouping suitable query nodes into complex operation nodes, for which C code is generated, compiled, and loaded during runtime.We present our approach based on the array DBMS rasdaman, discuss its benefits and its embedding into the rasdaman query evaluation, and show initial, rather promising benchmark results.
Year
DOI
Venue
2008
10.1109/ICDMW.2008.73
ICDM Workshops
Keywords
Field
DocType
just-in-time compilation,array dbms rasdaman,multidimensional array modeling,rasdaman query evaluation,array element,array query language,large number,array query processing,suitable query node,query support,complex operation node,complex computation,just in time compiler,pediatrics,query language,database management systems,optimization,query languages,just in time compilation,interpreted languages,benchmark testing,databases,array dbms
Query optimization,Array DBMS,Data mining,Sparse array,Query language,Query expansion,Computer science,Sargable,Range query (data structures),Theoretical computer science,Rasdaman
Conference
ISBN
Citations 
PageRank 
978-0-7695-3503-6
7
0.63
References 
Authors
8
3
Name
Order
Citations
PageRank
Constantin Jucovschi1537.56
Peter Baumann223141.02
Sorin Stancu-Mara3202.33