| A query language for multidimensional arrays: design, implementation, and optimization techniques |
| Full text |
Pdf
(1.38 MB)
|
| Source
|
International Conference on Management of Data
archive
Proceedings of the 1996 ACM SIGMOD international conference on Management of data
table of contents
Montreal, Quebec, Canada
Pages: 228 - 239
Year of Publication: 1996
ISBN:0-89791-794-4
Also published in ...
|
|
Authors
|
|
Leonid Libkin
|
Bell Laboratories, 600 Mountain Avenue, Murray Hill, NJ
|
|
Rona Machlin
|
Dept. of Comp. & Info. Science, Univ. of Pennsylvania, Philadelphia, PA
|
|
Limsoon Wong
|
Real World Computing Partnership Novel Function Institute of Systems Science Laboratory, Heng Mui Keng Terrace, Singapore 0511
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 7, Downloads (12 Months): 58, Citation Count: 16
|
|
|
ABSTRACT
While much recent research has focussed on extending databases beyond the traditional relational model, relatively little has been done to develop database tools for querying data organized in (multidimensional) arrays. The scientific computing community has made little use of available database technology. Instead, multidimensional scientific data is typically stored in local files conforming to various data exchange formats and queried via specialized access libraries tied in to general purpose programming languages.To allow such data to be queried using known database techniques, we design and implement a query language for multidimensional arrays. Our main design decision is to treat arrays as functions from index sets to values rather than as collection types. This leads to clean syntax and semantics as well as simple but powerful optimization rules.We present a calculus for arrays that extends standard calculi for complex objects. We derive a higher-level comprehension style query language based on this calculus and describe its implementation, including a data driver for the NetCDF data exchange format. Next, we explore some optimization rules obtained from the equational laws of our core calculus. Finally, we study the expressiveness of our calculus and prove that it essentially corresponds to adding ranking to a query language for complex objects.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
|
| |
2
|
H. Barendregt. Lambda Calculus: Its Syntaz and Semantics. North Holland, 1984.
|
| |
3
|
C. Beeri and D.K.C. Chan. Bounded arrays: a bulk type perspective. Hebrew Univ. Technical Report, 1995.
|
| |
4
|
P. Buneman. The fast Fourier transform as a database query. Technical Report MS-CIS-93-37/L&C 60, University of Pennsylvania, March 1993.
|
| |
5
|
|
 |
6
|
|
| |
7
|
|
| |
8
|
R.G.G. Cattell, ed. The Object Database Standard: ODMG-93. Morgan-Kaufmann, 1994.
|
 |
9
|
|
| |
10
|
J. Feo. Arrays in Sisal. in Proc. Workshop on Arrays, Functional Languages and Parallel Systems, L. Mullin et al. eds., Kluwer Academic PubLishers, 1990.
|
| |
11
|
|
| |
12
|
|
 |
13
|
|
 |
14
|
|
| |
15
|
P. Hudak, S.L. Peyton Jones and P. Wadler. Report on the Programming Language HaskeU. SIGPLAN Notices, March 1992.
|
| |
16
|
|
| |
17
|
|
| |
18
|
|
| |
19
|
|
 |
20
|
Leonid Libkin , Limsoon Wong, New techniques for studying set languages, bag languages and aggregate functions, Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.155-166, May 24-27, 1994, Minneapolis, Minnesota, United States
[doi> 10.1145/182591.182609]
|
| |
21
|
|
 |
22
|
|
| |
23
|
|
 |
24
|
Giansalvatore Mecca , Anthony J. Bonner, Sequences, Datalog and transducers, Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.23-35, May 22-25, 1995, San Jose, California, United States
[doi> 10.1145/212433.212440]
|
| |
25
|
|
| |
26
|
|
| |
27
|
T. More. Axioms and theorems for a theory of arrays. IBM J. Res. and Development 17 (1973), 135-175.
|
| |
28
|
R. Rew, G. Davis and S. Emmerson. NetGDF User's Guide, Unidata Program Center, 1993.
|
 |
29
|
Praveen Seshadri , Miron Livny , Raghu Ramakrishnan, Sequence query processing, Proceedings of the 1994 ACM SIGMOD international conference on Management of data, p.430-441, May 24-27, 1994, Minneapolis, Minnesota, United States
|
| |
30
|
|
| |
31
|
|
 |
32
|
Scott L. Vandenberg , David J. DeWitt, Algebraic support for complex objects with arrays, identity, and inheritance, Proceedings of the 1991 ACM SIGMOD international conference on Management of data, p.158-167, May 29-31, 1991, Denver, Colorado, United States
|
| |
33
|
P. Wadler. Comprehending monads. Mathematical Structures in Computer Science 2 (1992), 461-493.
|
| |
34
|
|
CITED BY 16
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Alberto Lerner , Dennis Shasha, AQuery: query language for ordered data, optimization techniques, and experiments, Proceedings of the 29th international conference on Very large data bases, p.345-356, September 09-12, 2003, Berlin, Germany
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|